Power of Quantum Computation with Few Clean Qubits

  title={Power of Quantum Computation with Few Clean Qubits},
  author={Keisuke Fujii and Hirotada Kobayashi and Tomoyuki Morimae and Harumichi Nishimura and Shuhei Tamate and Seiichiro Tani},
  booktitle={International Colloquium on Automata, Languages and Programming},
This paper investigates the power of polynomial-time quantum computation in which only a very limited number of qubits are initially clean in the |0> state, and all the remaining qubits are initially in the totally mixed state. No initializations of qubits are allowed during the computation, nor intermediate measurements. The main results of this paper are unexpectedly strong error-reducible properties of such quantum computations. It is proved that any problem solvable by a polynomial-time… 

Figures from this paper

Power of one nonclean qubit

The one-clean qubit model (or the DQC1 model) is a restricted model of quantum computing where only a single qubit of the initial state is pure and others are maximally mixed. Although the model is

The Power of One Clean Qubit in Communication Complexity

There is a quantum protocol using one clean qubit only and using $O(\log n)$ qubits of communication, such that any classical protocol simulating the acceptance behaviour of the quantum protocol within additive error needs communication $\Omega(n)$.

Hardness of classically sampling one clean qubit model with constant total variation distance error

It is shown that it is indeed possible to improve the multiplicative error hardness result to a constant total variation distance error one like other sub-universal quantum computing models such as the IQP model, the Boson Sampled model, and the Fourier Sampling model if the authors accept a modified version of the average case hardness conjecture.

Verification of Many-Qubit States

This paper shows that a variety of many-qubit quantum states can be verified with only sequential single-qu bit measurements of Pauli operators, and introduces a protocol for verifying ground states of Hamiltonians and proposes an adaptive test of stabilizers.

How many qubits are needed for quantum computational supremacy?

A quantum computational supremacy argument is refined and it is concluded that Instantaneous Quantum Polynomial-Time circuits with 208 qubits and 500 gates, Quantum Approximate Optimization Algorithm circuits with 420 qu bits and 500 constraints and boson sampling circuits are large enough for the task of producing samples from their output distributions up to constant multiplicative error to be intractable on current technology.

The battle of clean and dirty qubits in the era of partial error correction

When error correction becomes possible it will be necessary to dedicate a large number of physical qubits to each logical qubit. Error correction allows for deeper circuits to be run, but each

The one clean qubit model without entanglement is classically simulable

Entanglement has been shown to be necessary for pure state quantum computation to have an advantage over classical computation. However, it remains open whether entanglement is necessary for quantum

Space-Bounded Unitary Quantum Computation with Postselection

Space-bounded computation has been a central topic in classical and quantum complexity theory. In the quantum case, every elementary gate must be unitary. This restriction makes it unclear whether

Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy

A promise problem to decide whether output probability distributions of two quantum circuits are far apart or close is defined, and it is shown that PDD-Max is BQP-complete, but if the two circuits are restricted to some types in the second level of the Fourier hierarchy, such as the HC1Q model or the IQP model, PDd-Max has a Merlin-Arthur system with quantum polynomial-time Merlin and classical probabilistic polyn coefficients.

Additive-error fine-grained quantum supremacy

The additive-error fine-grained quantum supremacy result can be shown for additive- error sampling and should hold for other sub-universal models.



On the hardness of classically simulating the one clean qubit model

This Letter introduces a slightly modified version of DQC1, which it is shown that DZC1(k) cannot be classically efficiently simulated for any k≥3 unless the polynomial hierarchy collapses at the third level.

Estimating Jones polynomials is a complete problem for one clean qubit

It is shown that evaluating a certain approximation to the Jones polynomial at a fifth root of unity for the trace closure of a braid is a complete problem for the one clean qubit complexity class.

Hardness of classically simulating quantum circuits with unbounded Toffoli and fan-out gates

This work shows that there exists a constant-depth quantum circuit with only two unbounded fan-out gates that is not strongly simulatable, unless P = PP, which is in contrast to the fact that any constant- depth quantum circuit without additional gates on an unbounded number of qubits is strongly and weakly simulatable.

Computing with highly mixed states

It is shown that unless m∈O(k + log n), oblivious (gate-by-gate) simulation of an ideal m-qubit quantum circuit by an n-qu bit circuit with k clean qubits is impossible, this indicates that there is no avoiding physical initialization of a quantity of qubits proportional to that required by the best ideal quantum circuit.

Commuting quantum circuits with few outputs are unlikely to be classically simulatable

This work shows for the first formal evidence that a commuting quantum circuit is not classically simulatable even when the number of output qubits is exponentially small, and applies the argument for the above evidence to Clifford circuits in a similar setting and provides evidence that such a circuit augmented by a depth-1 non-Clifford layer is notClassical simulatable.

Space-Efficient Error Reduction for Unitary Quantum Computations

This paper presents error-reduction methods for unitary quantum computations that require extra workspace of just ${O \bigl( p}{c-s} \bigr)}$ qubits, and gives the first methods of strong amplification for logarithmic-space unitaryquantum computations with two-sided bounded error.

Power of One Bit of Quantum Information

In standard quantum computation, the initial state is pure and the answer is determined by making a measurement of some of the bits in the computational basis. What can be accomplished if the initial

Quantum Computability

It is shown that when quantum Turing machines are restricted to have transition amplitudes which are algebraic numbers, BQP, EQP, and nondeterministic quantum polynomial time (NQP) are all contained in PP, hence in P and PSPACE.

Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy

  • M. BremnerR. JozsaD. Shepherd
  • Computer Science, Mathematics
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2010
The class post-IQP of languages decided with bounded error by uniform families of IQP circuits with post-selection is introduced, and it is proved first that post- IQP equals the classical class PP, and that if the output distributions of uniform IQP circuit families could be classically efficiently sampled, then the infinite tower of classical complexity classes known as the polynomial hierarchy would collapse to its third level.

Elementary gates for quantum computation.

U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.