Computing with highly mixed states

  title={Computing with highly mixed states},
  author={Andris Ambainis and Leonard J. Schulman and Umesh V. Vazirani},
  journal={J. ACM},
Device initialization is a difficult challenge in some proposed realizations of quantum computers, and as such, must be treated as a computational resource. The degree of initialization can be quantified by k, the number of clean qubits in the initial state of the register. In this article, we show that unless m∈O(k + log n), oblivious (gate-by-gate) simulation of an ideal m-qubit quantum circuit by an n-qubit circuit with k clean qubits is impossible. Effectively, this indicates that there is… 

Figures from this paper

Quantum computing without entanglement

Quantum computing under real-world constraints: efficiency of an ensemble quantum algorithm and fighting decoherence by gate design

A simple approach to reduce errors in the quantum search algorithm due to a collective decoherence model is investigated, which takes advantage of the freedom inherent in compiling the search algorithm into fundamental gates.

Power of Quantum Computation with Few Clean Qubits

It is proved that the TRACE ESTIMATION problem defined with fixed constant threshold parameters is complete for the classes of problems solvable by polynomial-time quantum computations with completeness 2/3 and soundness 1/3 using logarithmically many clean qubits and just one clean qubit.

Physical Limits of Heat-Bath Algorithmic Cooling

A new, efficient initialization procedure for open systems of n-qubit devices that is originally maximally mixed, but is in contact with a heat bath of bias epsilon>>2(-n), can be almost perfectly initialized.

Normalizer Circuits and Quantum Computation

An efficient formalism for simulating families of quantum circuits, that are non-universal but comprise important quantum gates such as QFT or CNOT, is developed and used to design new algorithms that provide quantum speedups.

Studies on the Role of Entanglement in Mixed-state Quantum Computation

In this thesis, I look at the role of quantum entanglement in mixed-state quantum computation. The model we consider is the DQC1 or `power of one qubit' model. I show that there is minimal bipartite

Some Theory and Applications of Probability in Quantum Mechanics

It is proved that quantum states are more difficult to estimate than their classical counterparts by finding optimal estimation strategies, requiring the solution to a difficult optimization problem, are difficult to implement in practise.

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.

On the hardness of distinguishing mixed-state quantum computations

  • Bill Rosgen
  • Computer Science
    20th Annual IEEE Conference on Computational Complexity (CCC'05)
  • 2005
It is proved that the promise problem is complete for the class QIP of problems having quantum interactive proof systems, and is therefore PSPACE-hard.

Projective Measurement-Based Logic Synthesis of Quantum Circuits

  • M. LukacM. Perkowski
  • Computer Science
    38th International Symposium on Multiple Valued Logic (ismvl 2008)
  • 2008
The method to synthesize quantum circuits from examples such that the synthesis process converts the don't knows to the entangled quantum output values which are measurement dependent is demonstrated.



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

Experimental realization of a quantum algorithm

Quantum computers can in principle exploit quantum-mechanical effects to perform computations (such as factoring large numbers or searching an unsorted database) more rapidly than classical

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.

Parallel Quantum Computation and Quantum Codes

While it is noted the exact quantum Fourier transform can be parallelized to linear depth, it is conjecture that neither it nor a simpler "staircase" circuit can be Parallelized to less than this.

Bulk Spin-Resonance Quantum Computation

A new approach to quantum computing is introduced based on the use of multiple-pulse resonance techniques to manipulate the small deviation from equilibrium of the density matrix of a macroscopic ensemble so that it appears to be the density Matrix of a much lower dimensional pure state.

Ensemble quantum computing by NMR spectroscopy

A new computational model is presented, which differs from a QC only in that the result of a measurement is the expectation value of the observable, rather than a random eigenvalue thereof, which can solve nondeterministic polynomial-time complete problems inPolynomial time.

Molecular scale heat engines and scalable quantum computation

N procedure that extracts the asymptotically optimal fraction of purified bits is given, and a quasi-linear time implementation of the procedure is given in a model motivated by NMR quantum computing.

On the power of quantum computation

  • Daniel R. Simon
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
This work presents here a problem of distinguishing between two fairly natural classes of function, which can provably be solved exponentially faster in the quantum model than in the classical probabilistic one, when the function is given as an oracle drawn equiprobably from the uniform distribution on either class.

Ensemble Quantum Computing by Nuclear Magnetic Resonance Spectroscopy

A new computational model is presented, which differs from a quantum computer only in that the result of measuring an observable is the expectation value of the observable, rather than a random eigenvalue thereof, and it is shown that such an expectation value quantum computer can solve NP-complete problems in polynomial time.

Quantum computation and quantum information

This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.