8,935 research outputs found
An Arbitrary Two-qubit Computation In 23 Elementary Gates
Quantum circuits currently constitute a dominant model for quantum
computation. Our work addresses the problem of constructing quantum circuits to
implement an arbitrary given quantum computation, in the special case of two
qubits. We pursue circuits without ancilla qubits and as small a number of
elementary quantum gates as possible. Our lower bound for worst-case optimal
two-qubit circuits calls for at least 17 gates: 15 one-qubit rotations and 2
CNOTs. To this end, we constructively prove a worst-case upper bound of 23
elementary gates, of which at most 4 (CNOT) entail multi-qubit interactions.
Our analysis shows that synthesis algorithms suggested in previous work,
although more general, entail much larger quantum circuits than ours in the
special case of two qubits. One such algorithm has a worst case of 61 gates of
which 18 may be CNOTs. Our techniques rely on the KAK decomposition from Lie
theory as well as the polar and spectral (symmetric Shur) matrix decompositions
from numerical analysis and operator theory. They are related to the canonical
decomposition of a two-qubit gate with respect to the ``magic basis'' of
phase-shifted Bell states, published previously. We further extend this
decomposition in terms of elementary gates for quantum computation.Comment: 18 pages, 7 figures. Version 2 gives correct credits for the GQC
"quantum compiler". Version 3 adds justification for our choice of elementary
gates and adds a comparison with classical library-less logic synthesis. It
adds acknowledgements and a new reference, adds full details about the 8-gate
decomposition of topC-V and stealthily fixes several minor inaccuracies.
NOTE: Using a new technique, we recently improved the lower bound to 18 gates
and (tada!) found a circuit decomposition that requires 18 gates or less.
This work will appear as a separate manuscrip
Interpolation Methods for Binary and Multivalued Logical Quantum Gate Synthesis
A method for synthesizing quantum gates is presented based on interpolation
methods applied to operators in Hilbert space. Starting from the diagonal forms
of specific generating seed operators with non-degenerate eigenvalue spectrum
one obtains for arity-one a complete family of logical operators corresponding
to all the one-argument logical connectives. Scaling-up to n-arity gates is
obtained by using the Kronecker product and unitary transformations. The
quantum version of the Fourier transform of Boolean functions is presented and
a Reed-Muller decomposition for quantum logical gates is derived. The common
control gates can be easily obtained by considering the logical correspondence
between the control logic operator and the binary propositional logic operator.
A new polynomial and exponential formulation of the Toffoli gate is presented.
The method has parallels to quantum gate-T optimization methods using powers of
multilinear operator polynomials. The method is then applied naturally to
alphabets greater than two for multi-valued logical gates used for quantum
Fourier transform, min-max decision circuits and multivalued adders
Discrete Function Representations Utilizing Decision Diagrams and Spectral Techniques
All discrete function representations become exponential in size in the worst case. Binary decision diagrams have become a common method of representing discrete functions in computer-aided design applications. For many functions, binary decision diagrams do provide compact representations. This work presents a way to represent large decision diagrams as multiple smaller partial binary decision diagrams. In the Boolean domain, each truth table entry consisting of a Boolean value only provides local information about a function at that point in the Boolean space. Partial binary decision diagrams thus result in the loss of information for a portion of the Boolean space. If the function were represented in the spectral domain however, each integer-valued coefficient would contain some global information about the function. This work also explores spectral representations of discrete functions, including the implementation of a method for transforming circuits from netlist representations directly into spectral decision diagrams
- …