Abstract: Typical quantum computation is expressed in terms of qubits, or binary systems. In common quantum hardware, there is an infinite spectrum of discrete energy levels and the qubit abstraction is artificial: a quantum computer can be configured to operate on any number of d levels. Multivalued computation typically confers only constant advantage over binary when the entire computation is reencoded. When used temporarily, use of higher level states can confer asymptotic advantages. In this talk, I will introduce the basics of multivalued quantum computation and a few key examples of its application. In particular, I will examine some cases for temporary access to higher level states. First, I will present a generalized Toffoli decomposition which replaces ancilla with temporary access to the Ternary state. Second, I will present a method which allows us to generate ancilla using qubit-qudit compression, where the state of many qubits is stored in a smaller number of qudits resulting in clean ancilla. This generalizes the methods used in the Toffoli decomposition and extends to many arithmetic applications like adders
Jonathan Baker is a second year PhD student at the University of Chicago and is advised by Fred Chong as a member of the EPiQC group.
He is lead author on https://arxiv.org/abs/2002.10592 with the same title as his presentation.
Please e-mail firstname.lastname@example.org for the Zoom URL
By attending, you agree to abide by the Fermilab Community Standards