REVIEW 5 cited by
Quantum Circuits with Mixed States
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We define the model of quantum circuits with density matrices, where non-unitary gates are allowed. Measurements in the middle of the computation, noise and decoherence are implemented in a natural way in this model, which is shown to be equivalent in computational power to standard quantum circuits. The main result in this paper is a solution for the subroutine problem: The general function that a quantum circuit outputs is a probabilistic function, but using pure state language, such a function can not be used as a black box in other computations. We give a natural definition of using general subroutines, and analyze their computational power. We suggest convenient metrics for quantum computing with mixed states. For density matrices we analyze the so called ``trace metric'', and using this metric, we define and discuss the ``diamond metric'' on superoperators. These metrics enable a formal discussion of errors in the computation. Using a ``causality'' lemma for density matrices, we also prove a simple lower bound for probabilistic functions.
Forward citations
Cited by 5 Pith papers
-
Quantum channel learning with limited parallel access
For qudit channels, learning is exponentially hard with c < d parallel copies and becomes efficient at c = d with tight ε^(-2d) scaling; access to the complex-conjugate channel gives tight ε^(-4) bounds, and bosonic c...
-
Unbiased Hamiltonian Simulation by Reversing Trotter Error Dynamics
PTER removes Trotter errors in quantum Hamiltonian simulation via quasi-probabilistic reversal of the error dynamics, producing unbiased results with constant overhead.
-
Entanglement groups for mixed states
For mixed quantum states, entanglement can be characterized by a quotient group of local unitary stabilizers of the density matrix, and any nontriviality for separable states must come from multipartite entanglement w...
-
Shallow Unitary Circuits for Kramers-Wannier Dualities
Log-depth nonlocal unitary circuits realize exact Z2 and Zn KW dualities that map arbitrary SRE states to LRE duals in the symmetric sector.
-
Noise-Aware Mixed-State Quantum Computation via Parameterized Quantum Channels
The paper frames parameterized quantum channels as a noise-aware computing resource and shows that optimizing a mixture of two noisy CNOT implementations improves channel fidelity in a simple emulator test.
Discussion (0). Continue with ORCID to comment.