Computing with highly mixed states

DOI10.1145/1147954.1147962zbMATH Open1315.81032arXivquant-ph/0003136OpenAlexW2062374336MaRDI QIDQ3546320FDOQ3546320

Authors: Leonard J. Schulman, Umesh V. Vazirani, Andris Ambainis 

Publication date: 21 December 2008

Published in: Journal of the ACM (Search for Journal in Brave)

Abstract: We consider quantum computing in the k-qubit model where the starting state of a quantum computer consists of k qubits in a pure state and n-k qubits in a maximally mixed state. We ask the following question: is there a general method for simulating an arbitrary m-qubit pure state quantum computation by a quantum computation in the k-qubit model? We show that, under certain constraints, this is impossible, unless m=O(k+ log n).

Full work available at URL: https://arxiv.org/abs/quant-ph/0003136

Recommendations

• Computing with highly mixed states (extended abstract)
• Power of quantum computation with few clean qubits
• scientific article; zbMATH DE number 1775384
• Control aspects of quantum computing using pure and mixed states
• Quantum programming with mixed states

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Cited In (7)

• Power of quantum computation with few clean qubits
• On the role of dealing with quantum coherence in amplitude amplification
• Approximating the Turaev-Viro Invariant of Mapping Tori is Complete for One Clean Qubit
• Power of uninitialized qubits in shallow quantum circuits
• Quantum encoding of dynamic directed graphs
• Title not available (Why is that?)
• Computing with highly mixed states (extended abstract)

This page was built for publication: Computing with highly mixed states

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546320)