Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1505.02879 · Physical Review A

Experimental quantum channel simulation

He Lu, Chang Liu, Dongsheng Wang, Luo-Kan Chen, Zheng-Da Li, Xing-Can Yao, Li Li, Nai-Le Liu, Cheng-Zhi Peng, Barry C. Sanders, Yu-Ao Chen, Jian-Wei Pan

Published Apr 10, 2017• 34 citations
arXivHTMLPDF

Abstract

Quantum simulation is of great importance in quantum information science. Here, we report an experimental quantum channel simulator imbued with an algorithm for imitating the behavior of a general class of quantum systems. The reported quantum channel simulator consists of four single-qubit gates and one controlled-not gate. All types of quantum channels can be decomposed by the algorithm and implemented on this device. We deploy our system to simulate various quantum channels, such as quantum-noise channels and weak quantum measurement. Our results advance experimental quantum channel simulation, which is integral to the goal of quantum information processing.

DOI
10.1103/physreva.95.042310

Related papers

Universal digital photonic single-qubit quantum channel simulator

Lu He, Chang Liu, Dongsheng Wang +9 more

Quantum simulators, which exploit quantum effects to reveal unknown or difficult-to-compute properties of a model of interest, play a significant role in quantum information science. Quantum simulation of the dynamics of many-body system has been widely studied for various quantum computing systems, including cold atoms, trapped ions and photons. However, simulation of quantum channels, which describes one of the most general quantum processes in realistic systems, has not yet been fully explored, even for single-qubit channels. Here we report the first experimental digital quantum simulator of arbitrary single-qubit channels. We built this simulator with a set of single-qubit gates together with a single two-qubit entangling gate. We show that any single-qubit channel can be efficiently and accurately programmed and compiled by our simulator. Our scheme generalizes Hamiltonian-based simulators to channel-based digital quantum simulators, which could have important applications in quantum computation and quantum simulation.

•May 12, 2015•3 citations

Universal Quantum Channel Simulation in Duality Quantum Computing

Shi-jie Wei, Tao Xin, Gui‐Lu Long

Quantum channels describe general transformations of the state of a physical system and play a fundamental role in many fields. It promises wide range of applications, because any physical process can be represented as a quantum channel transforming an initial state into a final state. The evolution of system undergoing a quantum channel is not necessary unitary which makes it unrealisable without ancillary system. Inspired by the method performing non-unitary operator by the linear combination of unitary operations, we proposed a quantum algorithm for the simulation of universal single-qubit channel, described by a convex combination of two generalized extreme channels corresponding to four Kraus operators, and is scalable to arbitrary higher dimension. We demonstrate the whole algorithm experimentally using the universal IBM cloud quantum computer and study properties of different qubit quantum channels. We illustrate the quantum capacity of the general qubit quantum channels, which quantifies the amount of quantum information that can be protected. There is a general agreement between the theoretical predictions and the experiments, which strongly supported our method. By realizing arbitrary qubit channel, this work provides a universal way to explore various properties of quantum channel and novel prospect of quantum communication.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2017•1 citation

Quantum circuits for quantum channels

Raban Iten, Roger Colbeck, Matthias Christandl

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.

arXiv:1609.08103•Physical Review A•May 9, 2017•33 citations

Digital Simulation of Single Qubit Markovian Open Quantum Systems: A Tutorial

I. J. David, Ilya Sinayskiy, Francesco Petruccione

One of the first proposals for the use of quantum computers was the simulation of quantum systems. Over the past three decades, great strides have been made in the development of algorithms for simulating closed quantum systems and the more complex open quantum systems. In this tutorial, we introduce the methods used in the simulation of single qubit Markovian open quantum systems. It combines various existing notations into a common framework that can be extended to more complex open system simulation problems. The only currently available algorithm for the digital simulation of single qubit open quantum systems is discussed in detail. A modification to the implementation of the simpler channels is made that removes the need for classical random sampling, thus making the modified algorithm a strictly quantum algorithm. The modified algorithm makes use of quantum forking to implement the simpler channels that approximate the total channel. This circumvents the need for quantum circuits with a large number of CNOT gates. Quanta 2023; 12: 131–163.

arXiv:2302.02953•Quanta•Sep 18, 2023•2 citations

Simulations on/of various types of quantum computers

Kristel F. L. Michielsen

A quantum computer (QC) is a device that performs operations according to the rules of quantum theory. There are various types of QCs of which nowadays the two most important ones considered for practical realization are the gate-based QC and the quantum annealer (QA). Practical realizations of gate-based QCs consist of less than 100 qubits while QAs with more than 2000 qubits are commercially available.In the gate model QC, a universal QC, a computation (or quantum algorithm) consists of a sequence of quantum gate operations (unitary transformations) that changes the internal state of the QC. Quantum annealing is a technique for finding the global minimum of a quadratic function of binary variables by exploiting quantum fluctuations. Its main potential targets are combinatorial optimization problems featuring a discrete search space with many local minima.We present results of simulating on the IBM Quantum Experience devices and on the D-Wave 2X QA with more than 1000 qubits. Simulations of both types of QCs are performed by first modeling them as zero-temperature quantum systems of interacting spin-1/2 particles and then emulating their dynamics by solving the time-dependent Schrödinger equation. Our software allows for the simulation of a 48-qubit gate-based QC on the Sunway TaihuLight supercomputer.We also briefly report about EQUIPE, a user group, established by Forschungszentrum Jülich, to Enable QUantum Information Processing in Europe and about JUNIQ, a Jülich User Infrastructure for Research and Development in Quantum Computing, offering European users from science and industry user support and access to various QC simulators and eventually technologies on various stages of maturity (D-Wave QA, multi-qubit devices for QC without error correction from e.g. IBM, Google, Rigetti Computing, …, and experimental devices).

•Jan 1, 2018•0 citations

Simulation of single-qubit open quantum systems

Ryan Sweke, Ilya Sinayskiy, Francesco Petruccione

A quantum algorithm is presented for the simulation of arbitrary Markovian dynamics of a qubit, described by a semigroup of single-qubit quantum channels ${{T}_{t}}$ specified by a generator $\mathcal{L}$. This algorithm requires only single-qubit and controlled-not gates and approximates the channel ${T}_{t}={e}^{t\mathcal{L}}$ up to the chosen accuracy $\ensuremath{\epsilon}$, with a slightly superlinear cost ${O((\ensuremath{\parallel}\mathcal{L}\ensuremath{\parallel}}_{(1\ensuremath{\rightarrow}1)}t{)}^{1+1/2k}/{\ensuremath{\epsilon}}^{1/2k})$ for any integer $k$. Inspired by developments in Hamiltonian simulation, a decomposition and recombination technique is utilized which allows for the exploitation of recently developed methods for the approximation of arbitrary single-qubit channels. In particular, as a result of these methods the algorithm requires only a single ancilla qubit, the minimal possible dilation for a nonunitary single-qubit quantum channel.

arXiv:1405.6049•Physical Review A•Aug 27, 2014•34 citations
Quantum simulation is of great importance in quantum information science. Here, we report an experimental quantum channel simulator imbued with an algorithm for imitating the behavior of a general class of quantum systems. The reported quantum channel simulator consists of four single-qubit gates and one controlled-not gate. All types of quantum channels can be decomposed by the algorithm and implemented on this device. We deploy our system to simulate various quantum channels, such as quantum-noise channels and weak quantum measurement. Our results advance experimental quantum channel simulation, which is integral to the goal of quantum information processing.
Quantum simulators, which exploit quantum effects to reveal unknown or difficult-to-compute properties of a model of interest, play a significant role in quantum information science. Quantum simulation of the dynamics of many-body system has been widely studied for various quantum computing systems, including cold atoms, trapped ions and photons. However, simulation of quantum channels, which describes one of the most general quantum processes in realistic systems, has not yet been fully explored, even for single-qubit channels. Here we report the first experimental digital quantum simulator of arbitrary single-qubit channels. We built this simulator with a set of single-qubit gates together with a single two-qubit entangling gate. We show that any single-qubit channel can be efficiently and accurately programmed and compiled by our simulator. Our scheme generalizes Hamiltonian-based simulators to channel-based digital quantum simulators, which could have important applications in quantum computation and quantum simulation.
Quantum channels describe general transformations of the state of a physical system and play a fundamental role in many fields. It promises wide range of applications, because any physical process can be represented as a quantum channel transforming an initial state into a final state. The evolution of system undergoing a quantum channel is not necessary unitary which makes it unrealisable without ancillary system. Inspired by the method performing non-unitary operator by the linear combination of unitary operations, we proposed a quantum algorithm for the simulation of universal single-qubit channel, described by a convex combination of two generalized extreme channels corresponding to four Kraus operators, and is scalable to arbitrary higher dimension. We demonstrate the whole algorithm experimentally using the universal IBM cloud quantum computer and study properties of different qubit quantum channels. We illustrate the quantum capacity of the general qubit quantum channels, which quantifies the amount of quantum information that can be protected. There is a general agreement between the theoretical predictions and the experiments, which strongly supported our method. By realizing arbitrary qubit channel, this work provides a universal way to explore various properties of quantum channel and novel prospect of quantum communication.
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 mmm qubits to nnn 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.
One of the first proposals for the use of quantum computers was the simulation of quantum systems. Over the past three decades, great strides have been made in the development of algorithms for simulating closed quantum systems and the more complex open quantum systems. In this tutorial, we introduce the methods used in the simulation of single qubit Markovian open quantum systems. It combines various existing notations into a common framework that can be extended to more complex open system simulation problems. The only currently available algorithm for the digital simulation of single qubit open quantum systems is discussed in detail. A modification to the implementation of the simpler channels is made that removes the need for classical random sampling, thus making the modified algorithm a strictly quantum algorithm. The modified algorithm makes use of quantum forking to implement the simpler channels that approximate the total channel. This circumvents the need for quantum circuits with a large number of CNOT gates. Quanta 2023; 12: 131–163.
A quantum computer (QC) is a device that performs operations according to the rules of quantum theory. There are various types of QCs of which nowadays the two most important ones considered for practical realization are the gate-based QC and the quantum annealer (QA). Practical realizations of gate-based QCs consist of less than 100 qubits while QAs with more than 2000 qubits are commercially available.In the gate model QC, a universal QC, a computation (or quantum algorithm) consists of a sequence of quantum gate operations (unitary transformations) that changes the internal state of the QC. Quantum annealing is a technique for finding the global minimum of a quadratic function of binary variables by exploiting quantum fluctuations. Its main potential targets are combinatorial optimization problems featuring a discrete search space with many local minima.We present results of simulating on the IBM Quantum Experience devices and on the D-Wave 2X QA with more than 1000 qubits. Simulations of both types of QCs are performed by first modeling them as zero-temperature quantum systems of interacting spin-1/2 particles and then emulating their dynamics by solving the time-dependent Schrödinger equation. Our software allows for the simulation of a 48-qubit gate-based QC on the Sunway TaihuLight supercomputer.We also briefly report about EQUIPE, a user group, established by Forschungszentrum Jülich, to Enable QUantum Information Processing in Europe and about JUNIQ, a Jülich User Infrastructure for Research and Development in Quantum Computing, offering European users from science and industry user support and access to various QC simulators and eventually technologies on various stages of maturity (D-Wave QA, multi-qubit devices for QC without error correction from e.g. IBM, Google, Rigetti Computing, …, and experimental devices).
A quantum algorithm is presented for the simulation of arbitrary Markovian dynamics of a qubit, described by a semigroup of single-qubit quantum channels Tt{{T}_{t}}Tt​ specified by a generator L\mathcal{L}L. This algorithm requires only single-qubit and controlled-not gates and approximates the channel Tt=etL{T}_{t}={e}^{t\mathcal{L}}Tt​=etL up to the chosen accuracy $\ensuremath{\epsilon}$, with a slightly superlinear cost ${O((\ensuremath{\parallel}\mathcal{L}\ensuremath{\parallel}}_{(1\ensuremath{\rightarrow}1)}t{)}^{1+1/2k}/{\ensuremath{\epsilon}}^{1/2k})$ for any integer kkk. Inspired by developments in Hamiltonian simulation, a decomposition and recombination technique is utilized which allows for the exploitation of recently developed methods for the approximation of arbitrary single-qubit channels. In particular, as a result of these methods the algorithm requires only a single ancilla qubit, the minimal possible dilation for a nonunitary single-qubit quantum channel.