Minimal computational-space implementation of multi-round quantum protocols
arXiv:1006.1780 · doi:10.1103/PhysRevA.83.022325
Abstract
A single-party strategy in a multi-round quantum protocol can be implemented by sequential networks of quantum operations connected by internal memories. Here provide the most efficient realization in terms of computational-space resources.
4 pages, 4 figures, revtex4
References in corpus (10)
- Synthesis of Quantum Logic Circuits
- Complete Characterization of a Quantum Process: the Two-Bit Quantum Gate
- Theoretical framework for quantum networks
- Quantum Circuits Architecture
- Measuring measurement
- Tomography of Quantum Operations
- Efficient decomposition of quantum gates
- A fidelity measure for quantum channels
- Optimal cloning of unitary transformations
- Realization schemes for quantum instruments in finite dimensions
Cited by in corpus (16)
- Non-Markovian quantum processes: complete framework and efficient characterisation
- Optimal Strategies of Quantum Metrology with a Strict Hierarchy
- Dynamics of quantum causal structures
- Optimal networks for Quantum Metrology: semidefinite programs and product rules
- Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly
- Extremal quantum protocols
- Quantum conditional operations
- Consequences of preserving reversibility in quantum superchannels
- Quantum superpositions of "common-cause" and "direct-cause" causal structures
- Optimal processing of reversible quantum channels
- Fully-Optimized Quantum Metrology: Framework, Tools, and Applications
- Strict hierarchy of optimal strategies for global estimations: Linking global estimations with local ones
- Quantum Network Discrimination
- No-iteration of unknown quantum gates
- Memory cost of quantum protocols
- How to Suppress Dark States in Quantum Networks and Bio-Engineered Structures