14,912 research outputs found
Quantum proofs can be verified using only single qubit measurements
QMA (Quantum Merlin Arthur) is the class of problems which, though
potentially hard to solve, have a quantum solution which can be verified
efficiently using a quantum computer. It thus forms a natural quantum version
of the classical complexity class NP (and its probabilistic variant MA,
Merlin-Arthur games), where the verifier has only classical computational
resources. In this paper, we study what happens when we restrict the quantum
resources of the verifier to the bare minimum: individual measurements on
single qubits received as they come, one-by-one. We find that despite this
grave restriction, it is still possible to soundly verify any problem in QMA
for the verifier with the minimum quantum resources possible, without using any
quantum memory or multiqubit operations. We provide two independent proofs of
this fact, based on measurement based quantum computation and the local
Hamiltonian problem, respectively. The former construction also applies to
QMA, i.e., QMA with one-sided error.Comment: 7 pages, 1 figur
Hybrid quantum information processing
The development of quantum information processing has traditionally followed
two separate and not immediately connected lines of study. The main line has
focused on the implementation of quantum bit (qubit) based protocols whereas
the other line has been devoted to implementations based on high-dimensional
Gaussian states (such as coherent and squeezed states). The separation has been
driven by the experimental difficulty in interconnecting the standard
technologies of the two lines. However, in recent years, there has been a
significant experimental progress in refining and connecting the technologies
of the two fields which has resulted in the development and experimental
realization of numerous new hybrid protocols. In this Review, we summarize
these recent efforts on hybridizing the two types of schemes based on discrete
and continuous variables.Comment: 13 pages, 6 figure
What is a quantum computer, and how do we build one?
The DiVincenzo criteria for implementing a quantum computer have been seminal
in focussing both experimental and theoretical research in quantum information
processing. These criteria were formulated specifically for the circuit model
of quantum computing. However, several new models for quantum computing
(paradigms) have been proposed that do not seem to fit the criteria well. The
question is therefore what are the general criteria for implementing quantum
computers. To this end, a formal operational definition of a quantum computer
is introduced. It is then shown that according to this definition a device is a
quantum computer if it obeys the following four criteria: Any quantum computer
must (1) have a quantum memory; (2) facilitate a controlled quantum evolution
of the quantum memory; (3) include a method for cooling the quantum memory; and
(4) provide a readout mechanism for subsets of the quantum memory. The criteria
are met when the device is scalable and operates fault-tolerantly. We discuss
various existing quantum computing paradigms, and how they fit within this
framework. Finally, we lay out a roadmap for selecting an avenue towards
building a quantum computer. This is summarized in a decision tree intended to
help experimentalists determine the most natural paradigm given a particular
physical implementation
- …