Related papers: A Classical-Quantum Adder with Constant Workspace …
Non-adiabatic dynamics at molecule-metal interfaces govern diverse and technologically important phenomena, from heterogeneous catalysis to dye-sensitized solar energy conversion and charge transport across molecular junctions. Realistic…
We study the resources required to achieve universal quantum computing via the gate sets that provide the fundamental instructions from which quantum algorithms are built. While single-gate universal sets are known, they rely on precisely…
To solve classically hard problems, quantum computers need to be resilient to the influence of noise and decoherence. In such a fault-tolerant quantum computer, noise-induced errors must be detected and corrected in real-time to prevent…
GCD computations and variants of the Euclidean algorithm enjoy broad uses in both classical and quantum algorithms. In this paper, we propose quantum circuits for GCD computation with $O(n \log n)$ depth with O(n) ancillae. Prior circuit…
This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one…
The quantum layout and the mapping of logical to physical qubits are crucial in quantum circuit synthesis for a real quantum computer. Circuits that include large $n$-bit Toffoli gates ($n \geq 3$), such as those designed from…
In the quest to build a practical quantum computer, it is important to use efficient schemes for enacting the elementary quantum operations from which quantum computer programs are constructed. The opposing requirements of well-protected…
We put forward a strategy to encode a quantum operation into the unmodulated dynamics of a quantum network without the need of external control pulses, measurements or active feedback. Our optimization scheme, inspired by supervised machine…
We estimate and analyze the error rates and the resource overheads of the repetition cat qubit approach to universal and fault-tolerant quantum computation. The cat qubits stabilized by two-photon dissipation exhibit an extremely biased…
We show how to carry out quantum logical operations (controlled-not and Toffoli gates) on encoded qubits for several encodings which protect against various 1-bit errors. This improves the reliability of these operations by allowing one to…
Quantum computing has garnered significant interest for its potential to solve certain computational problems much faster than the best-known classical algorithms. A fully functional and scalable quantum computer could transform various…
MQuantum algorithms of matrix operations are of great significance in many fields in science and technology. In this paper, by leveraging multi-qubit Toffoli gates and basic single-qubit operations, the quantum algorithms of matrix…
A quantum circuit to construct all maximal cliques using Grover search algorithm is presented. This oracle circuit takes as input an n-qubit state |x> and the adjacency matrix data A of an n-node network, and outputs the state (-1)^f(x) |x>…
We found that the actual computational time-cost of the QFT is O(n 2^n) for large n in a quantum computer using nuclear spins. The computational cost of a quantum algorithm has usually been estimated as the sum of the universal gates…
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…
We prove several new lower bounds for constant depth quantum circuits. The main result is that parity (and hence fanout) requires log depth circuits, when the circuits are composed of single qubit and arbitrary size Toffoli gates, and when…
A new method for computing sums on a quantum computer is introduced. This technique uses the quantum Fourier transform and reduces the number of qubits necessary for addition by removing the need for temporary carry bits. This approach also…
Proposed configurations for the implementation of graphene-based CNOT and Toffoli gates working at room temperature are presented. These two logic gates, essential for any quantum computing algorithm, involve ballistic Y junctions for qubit…
We investigate the minimal resources that are required in the local implementation of non-local quantum gates in a distributed quantum computer. Both classical communication requirements and entanglement consumption are investigated. We…
Unitary operations are expressed in the quantum circuit model as a finite sequence of elementary gates, such as controlled-not gates and single qubit gates. We prove that the simplified Toffoli gate by Margolus, which coincides with the…