Computing with highly mixed states
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:PY27JIGPrecord.jsonopen to challenge →
classification
quant-ph
keywords
quantumstatecomputationcomputingk-qubitmixedmodelpure
read the original 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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.