Quantum circuits for quantum channels

Raban Iten; Roger Colbeck; Matthias Christandl

doi:10.1103/PhysRevA.95.052316

Quantum circuits for quantum channels

Raban Iten, Roger Colbeck, Matthias Christandl

Department of Mathematical Sciences

9 Citations (Scopus)

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 (cnot) 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 cnot 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 cnot 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 cnot count. We give explicit examples for small numbers of qubits that provide the lowest known cnot counts.

Original language	English
Article number	052316
Journal	Physical Review A
Volume	95
Issue number	5
Number of pages	9
ISSN	2469-9926
DOIs	https://doi.org/10.1103/PhysRevA.95.052316
Publication status	Published - 9 May 2017

Access to Document

10.1103/PhysRevA.95.052316

Cite this

@article{e9e91a7d010a4f7fbfd897f80832a7ad,

title = "Quantum circuits for quantum channels",

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 (cnot) 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 cnot 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 cnot 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 cnot count. We give explicit examples for small numbers of qubits that provide the lowest known cnot counts.",

author = "Raban Iten and Roger Colbeck and Matthias Christandl",

year = "2017",

month = may,

day = "9",

doi = "10.1103/PhysRevA.95.052316",

language = "English",

volume = "95",

journal = "Physical Review A - Atomic, Molecular, and Optical Physics",

issn = "2469-9926",

publisher = "American Physical Society",

number = "5",

}

TY - JOUR

T1 - Quantum circuits for quantum channels

AU - Iten, Raban

AU - Colbeck, Roger

AU - Christandl, Matthias

PY - 2017/5/9

Y1 - 2017/5/9

N2 - We study the implementation of quantum channels with quantum computers while minimizing the experimental cost, measured in terms of the number of controlled-not (cnot) 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 cnot 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 cnot 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 cnot count. We give explicit examples for small numbers of qubits that provide the lowest known cnot counts.

AB - We study the implementation of quantum channels with quantum computers while minimizing the experimental cost, measured in terms of the number of controlled-not (cnot) 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 cnot 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 cnot 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 cnot count. We give explicit examples for small numbers of qubits that provide the lowest known cnot counts.

U2 - 10.1103/PhysRevA.95.052316

DO - 10.1103/PhysRevA.95.052316

M3 - Journal article

SN - 2469-9926

VL - 95

JO - Physical Review A - Atomic, Molecular, and Optical Physics

JF - Physical Review A - Atomic, Molecular, and Optical Physics

IS - 5

M1 - 052316

ER -

Quantum circuits for quantum channels

Abstract

Access to Document

Fingerprint

Cite this