Quantum Circuits for Quantum Channels
arXiv:1609.08103 · doi:10.1103/PhysRevA.95.052316
Abstract
We study the implementation of quantum channels with quantum computers while minimizing the experimental cost, measured in terms of the number of Controlled-NOT (C-NOT) gates required (single-qubit gates are free). We consider three different models. In the first, the Quantum Circuit Model (QCM), we consider sequences of single-qubit and C-NOT gates and allow qubits to be traced out at the end of the gate sequence. In the second (RandomQCM), we also allow external classical randomness. In the third (MeasuredQCM) we also allow measurements followed by operations that are classically controlled on the outcomes. We prove lower bounds on the number of C-NOT gates required and give near-optimal decompositions in almost all cases. Our main result is a MeasuredQCM circuit for any channel from m qubits to n qubits that uses at most one ancilla and has a low C-NOT count. We give explicit examples for small numbers of qubits that provide the lowest known C-NOT counts.
arXiv comment6(+4) pages
References in corpus (20)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Elementary gates for quantum computation
- An Open-System Quantum Simulator with Trapped Ions
- High-fidelity two-qubit quantum logic gates using trapped calcium-43 ions
- High-fidelity quantum logic gates using trapped-ion hyperfine qubits
- Synthesis of Quantum Logic Circuits
- High-Fidelity Universal Gate Set for Be Ion Qubits
- Quantum Circuits for General Multiqubit Gates
- Quantum-state preparation with universal gate decompositions
- Minimal Universal Two-qubit Quantum Circuits
- Quantum Circuit Simplification and Level Compaction
- Efficient decomposition of quantum gates
- Quantum Circuits for Isometries
- Quantum circuits with uniformly controlled one-qubit gates
- Compiling quantum algorithms for architectures with multi-qubit gates
- Binary search trees for generalized measurement
- Quantum Channel Construction with Circuit Quantum Electrodynamics
- Solovay-Kitaev Decomposition Strategy for Single-Qubit Channels
- Quantum circuit design for accurate simulation of qudit channels
- Convex decomposition of dimension-altering quantum channels
Cited by in corpus (20)
- Quantum control of bosonic modes with superconducting circuits
- Theory for Equivariant Quantum Neural Networks
- Universal discriminative quantum neural networks
- Pair-cat codes: autonomous error-correction with low-order nonlinearity
- Quantum simulation of quantum channels in nuclear magnetic resonance
- Quantum Circuits for Sparse Isometries
- Measurement-driven navigation in many-body Hilbert space: Active-decision steering
- Designing calibration and expressivity-efficient instruction sets for quantum computing
- Quantum and classical resources for unitary design of open-system evolutions
- The Near-optimal Performance of Quantum Error Correction Codes
- Introduction to UniversalQCompiler
- Variational quantum state discriminator for supervised machine learning
- Simulating noisy quantum channels via quantum state preparation algorithms
- Experimental demonstration of a measurement-based realisation of a quantum channel
- Group-covariant extreme and quasi-extreme channels
- Convex decomposition of dimension-altering quantum channels
- Quantum circuit simulation of superchannels
- Quantum Logspace Algorithm for Powering Matrices with Bounded Norm
- Weighted Quantum Channel Compiling through Proximal Policy Optimization
- Smooth manifold structure for extreme channels