Related papers: Minimally Universal Parity Quantum Computing
What additional gates are needed for a set of classical universal gates to do universal quantum computation? We answer this question by proving that any single-qubit real gate suffices, except those that preserve the computational basis.…
On the basis of introspective analysis, we establish a crucial requirement for the physical computation basis of consciousness: it should allow processing a significant amount of information together at the same time. Classical computation…
Quantum computing tries to exploit entanglement and interference to process information more efficiently than the best known classical solutions. Experiments demonstrating the feasibility of this approach have already been performed.…
Qudit is a multi-level computational unit alternative to the conventional 2-level qubit. Compared to qubit, qudit provides a larger state space to store and process information, and thus can provide reduction of the circuit complexity,…
Overcoming the influence of noise and imperfections is a major challenge in quantum computing. Here, we present an approach based on applying a desired unitary computation in superposition between the system of interest and some auxiliary…
We demonstrate that in a coupled two-qubit system any single-qubit gate can be decomposed into two conditional two-qubit gates and that any conditional two-qubit gate can be implemented by a manipulation analogous to that used for a…
Successfully implementing a quantum algorithm involves maintaining a low logical error rate by ensuring the validity of the quantum fault-tolerance theorem. The required number of physical qubits arranged in an array depends on the chosen…
We present two techniques that can greatly reduce the number of gates required to realize an energy measurement, with application to ground state preparation in quantum simulations. The first technique realizes that to prepare the ground…
We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with fast local unitaries. We also note that a related lower bound holds for arbitrary…
Current technological advancements of quantum computers highlight the need for application-driven, practical and well-defined methods of benchmarking their performance. As the existing NISQ device's quality of two-qubit gate errors rate is…
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…
Standard approaches to quantum error correction for fault-tolerant quantum computing are based on encoding a single logical qubit into many physical ones, resulting in asymptotically zero encoding rates and therefore huge resource…
To build a general-purpose quantum computer, it is crucial for the quantum devices to implement classical boolean logic. A straightforward realization of quantum boolean logic is to use auxiliary qubits as intermediate storage. This…
We present protocols for implementation of universal quantum gates on an arbitrary superposition of quantum states in a scalable solid-state Ising spin quantum computer. The spin chain is composed of identical spins 1/2 with the Ising…
We consider the problem of deciding if a set of quantum one-qudit gates $\mathcal{S}=\{U_1,\ldots,U_n\}$ is universal. We provide the compact form criteria leading to a simple algorithm that allows deciding universality of any given set of…
We present a native approach for realizing multi-qubit parity phase gates in neutral atom systems through global phase modulation of a Rydberg excitation laser. By shaping the temporal profile of the laser's phase, we enable high fidelity,…
We revisit the question of universality in quantum computing and propose a new paradigm. Instead of forcing a physical system to enact a predetermined set of universal gates (e.g., single-qubit operations and CNOT), we focus on the…
Many promising ideas for quantum computing demand the experimental ability to directly switch 'on' and 'off' a physical coupling between the component qubits. This is typically the key difficulty in implementation, and precludes quantum…
A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from…
Quantum error correction will be a necessary component towards realizing scalable quantum computers with physical qubits. Theoretically, it is possible to perform arbitrarily long computations if the error rate is below a threshold value.…