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:2211.16267 · Physical Review A

Simulation of positive operator-valued measures and quantum instruments via quantum state-preparation algorithms

Douglas F. Pinto, Marcelo Serrano Zanetti, Marcos L. W. Basso, Jonas Maziero

Published Feb 9, 2023• 10 citations
arXivHTMLPDF

Abstract

In Phys. Rev. A 100, 062317 (2019), the authors reported an algorithm to implement, in a circuit-based quantum computer, a general quantum measurement (GQM) of a two-level quantum system, a qubit. Even though their algorithm seems right, its application involves the solution of an intricate nonlinear system of equations to obtain the angles determining the quantum circuit to be implemented for the simulation. In this article, we identify and discuss a simple way to circumvent this issue and implement GQMs on any $d$-level quantum system through quantum state preparation algorithms. Using some examples for one qubit, one qutrit, and two qubits, we illustrate the easy of application of our protocol. In addition, we show how one can utilize our protocol for simulating quantum instruments, for which we also give an example. All our examples are demonstrated using IBM's quantum processors.

DOI
10.1103/physreva.107.022411

Related papers

Simulating noisy quantum channels via quantum state preparation algorithms

Marcelo Serrano Zanetti, Douglas F. Pinto, Marcos L. W. Basso +1 more

Abstract In Xin et al (2017 Phys. Rev. A 96 062303) and Wei et al (2018 Sci. China Phys. Mech. Astron. 61 70311), the authors reported an algorithm to simulate, in a circuit-based quantum computer, a general quantum channel (QC). However, the application of their algorithm is limited because it entails the solution of intricate non-linear systems of equations in order to obtain the quantum circuit to be implemented for the simulation. Motivated by this issue, in this article we identify and discuss a simple way to implement the simulation of QCs on any d -level quantum system through quantum state preparation algorithms, that have received much attention in the quantum information science literature lately. We exemplify the versatility of our protocol applying it to most well known qubit QCs, to some qudit QCs, and to simulate the effect of Lorentz transformations on spin states. We also regard the application of our protocol for initial mixed states. Most of the given application examples are demonstrated using IBM’s quantum computers.

arXiv:2212.13834•Journal of Physics B Atomic Molecular and Optical Physics•Apr 7, 2023•13 citations

Simulation of quantum channels and general measurements via state preparation algorithms

Marcelo Serrano Zanetti

This work presents a new protocol for simulating quantum systems based on quantum state preparation, with various applications such as the simulation of quantum channels and the implementation of general measurements. In general, these applications are modeled by quantum operations and involve completely positive trace-preserving (CPTP) maps. These maps correspond to sets of operators known as Kraus operators, when applied to the simulation of quantum channels, and general measurement operators, when applied to the implementation of non-selective measurements. In the literature, especially when the experimental platform is circuit-based quantum computing, these operators are employed to adjust the parameters of unitary matrices, which are the ones that actually operate in the experiment. To do this, it is necessary to solve a system of nonlinear equations numerically. The new protocol avoids these complications by applying the operators directly over the analytical description of the quantum systems to be simulated. Through the use of isometries and purifications, it models the quantum operations of interest to the experimentalist, whether they are quantum channels or general measurements, enabling the use of software libraries for symbolic algebra to perform exact and automated manipulation of the state vector, with complex amplitudes, to be prepared for simulation. The algebraic manipulation of the state vector provides greater flexibility in experimental planning, as it can be used on any quantum simulation platform. More specifically, it is not restricted to circuit-based quantum computing. Finally, the use of the new protocol is illustrated in the simulation of one-qubit channels, qudits, Lorentz transformations, mixed-state simulations, POVM implementation, and the certification of quantum contextuality via POVMs.

•Oct 7, 2024•0 citations

Preparing general mixed quantum states on quantum computers

Lucas Friedrich, Douglas F. Pinto, Diego S. S. Chrysosthemos +1 more

Abstract The preparation of quantum states is a fundamental subroutine for a broad class of quantum information protocols and is critical for both quantum communication and quantum computation. Building upon the quantum algorithms introduced in previous works [M. B. Pozzobom and J. Maziero, Quantum Inf. Process. 18, 142 (2019)] and [E. R. Gårding et al., Entropy 23, 797 (2021)], the authors of [F. Shahbeigi, M. Karimi and V. Karimipour, Phys. Scr. 97, 025101 (2022)] demonstrated the capability to prepare mixed two-qubit X-real states on quantum computers by extending the methodology originally devised for mixed two-qubit Bell-diagonal states. In this article, we delve into an overlooked pattern within these quantum circuits, allowing us to present a modular algorithm for the preparation of general d -dimensional mixed quantum states using quantum information processors. Our general algorithm has a modular structure, encompassing eigenvalue encoding, entropy injection, and eigenvector preparation. To validate our algorithm, we conduct tests on quantum computers utilizing both X- and non-X-states for two mixed-state qubits, two-ququart Bell-diagonal states, as well as arbitrary random density matrices spanning one, two, and three qubits.

arXiv:2402.04212•Quantum Information Processing•Aug 7, 2026•3 citations

Quantum Simulation of Quantum Channels and Applications

Lúcio Souza Fassarella

We review the basic theory of quantum channels and develop a strategy for simulating them on digital quantum computers, drawing upon the Choi-Kraus operator-sum representation and Stinespring dilation to provide a unified approach for various applications. We discuss three types of applications, offering explicit examples for each: the preparation of mixed states, measurements described by positive operator-valued measures (POVMs), and the simulation of the evolution of Markovian quantum systems. We recover fundamental concepts from quantum theory, such as the purification of a mixed state and the Naimark dilation associated with a POVM. Regarding the simulation of the evolution of a Markovian quantum system, we introduce an operator, termed the residual operator, to construct, from the system's Liouvillian, a quantum channel that serves as a first-order approximation of the quantum dynamical semigroup. This allows the simulation of quantum dynamics to be performed in a manner analogous to the Euler method for ordinary differential equations, avoiding Trotterization. We prove all the theoretical results mentioned, with the exception of the fundamental Choi-Kraus theorem concerning the operator-sum representation of quantum channels, for which we provide the appropriate references. The explicit simulations discussed were implemented using the AerSimulator from IBM's Qiskit SDK, with the corresponding code available on GitHub.

arXiv:2611.12784•Nov 9, 2026•0 citations

State Preparation on Quantum Computers via Quantum Steering

Daniel Volya, Prabhat Mishra

Quantum computers present a compelling platform for the study of open quantum systems, namely the non-unitary dynamics of a system. Here, we investigate and report digital simulations of Markovian, non-unitary dynamics that converge to a unique steady state. The steady state is programmed as a desired target state, yielding semblance to a quantum state preparation protocol. By delegating ancilla qubits and systems qubits, the system state is driven to the target state by repeatedly performing the following steps: (1) executing a designated system-ancilla entangling circuit, (2) measuring the ancilla qubits, and (3) re-initializing ancilla qubits to known states through active reset. While the ancilla qubits are measured and reinitialized to known states, the system qubits undergo a non-unitary evolution and are steered from arbitrary initial states to desired target states. We show results of the method by preparing arbitrary qubit states and qutrit (three-level) states on contemporary quantum computers. We also demonstrate that the state convergence can be accelerated by utilizing the readouts of the ancilla qubits to guide the protocol in a non-blind manner. Our work serves as a nontrivial example that incorporates and characterizes essential operations such as qubit reuse (qubit reset), entangling circuits, and measurement. These operations are not only vital for near-term noisy intermediate-scale quantum (NISQ) applications but are also crucial for realizing future error-correcting codes.

arXiv:2302.13518•IEEE Transactions on Quantum Engineering•Jan 1, 2024•48 citations

Universal Algorithm for Optimal Estimation of Quantum States from Finite Ensembles via Realizable Generalized Measurement

R. Derka, Vladimír Bužek, ARTUR K. EKERT

We present a universal algorithm for the optimal quantum state estimation of an arbitrary finite dimensional system. The algorithm specifies a physically realizable (i.e., finite) positive operator valued measurement on a finite number of identically prepared systems. We illustrate the general formalism by applying it to different scenarios of the state estimation of $N$ independent and identically prepared two-level systems (qubits).

arXiv:quant-ph/9707028•Physical Review Letters•Feb 23, 1998•255 citations
In Phys. Rev. A 100, 062317 (2019), the authors reported an algorithm to implement, in a circuit-based quantum computer, a general quantum measurement (GQM) of a two-level quantum system, a qubit. Even though their algorithm seems right, its application involves the solution of an intricate nonlinear system of equations to obtain the angles determining the quantum circuit to be implemented for the simulation. In this article, we identify and discuss a simple way to circumvent this issue and implement GQMs on any ddd-level quantum system through quantum state preparation algorithms. Using some examples for one qubit, one qutrit, and two qubits, we illustrate the easy of application of our protocol. In addition, we show how one can utilize our protocol for simulating quantum instruments, for which we also give an example. All our examples are demonstrated using IBM's quantum processors.
Abstract In Xin et al (2017 Phys. Rev. A 96 062303) and Wei et al (2018 Sci. China Phys. Mech. Astron. 61 70311), the authors reported an algorithm to simulate, in a circuit-based quantum computer, a general quantum channel (QC). However, the application of their algorithm is limited because it entails the solution of intricate non-linear systems of equations in order to obtain the quantum circuit to be implemented for the simulation. Motivated by this issue, in this article we identify and discuss a simple way to implement the simulation of QCs on any d -level quantum system through quantum state preparation algorithms, that have received much attention in the quantum information science literature lately. We exemplify the versatility of our protocol applying it to most well known qubit QCs, to some qudit QCs, and to simulate the effect of Lorentz transformations on spin states. We also regard the application of our protocol for initial mixed states. Most of the given application examples are demonstrated using IBM’s quantum computers.
This work presents a new protocol for simulating quantum systems based on quantum state preparation, with various applications such as the simulation of quantum channels and the implementation of general measurements. In general, these applications are modeled by quantum operations and involve completely positive trace-preserving (CPTP) maps. These maps correspond to sets of operators known as Kraus operators, when applied to the simulation of quantum channels, and general measurement operators, when applied to the implementation of non-selective measurements. In the literature, especially when the experimental platform is circuit-based quantum computing, these operators are employed to adjust the parameters of unitary matrices, which are the ones that actually operate in the experiment. To do this, it is necessary to solve a system of nonlinear equations numerically. The new protocol avoids these complications by applying the operators directly over the analytical description of the quantum systems to be simulated. Through the use of isometries and purifications, it models the quantum operations of interest to the experimentalist, whether they are quantum channels or general measurements, enabling the use of software libraries for symbolic algebra to perform exact and automated manipulation of the state vector, with complex amplitudes, to be prepared for simulation. The algebraic manipulation of the state vector provides greater flexibility in experimental planning, as it can be used on any quantum simulation platform. More specifically, it is not restricted to circuit-based quantum computing. Finally, the use of the new protocol is illustrated in the simulation of one-qubit channels, qudits, Lorentz transformations, mixed-state simulations, POVM implementation, and the certification of quantum contextuality via POVMs.
Abstract The preparation of quantum states is a fundamental subroutine for a broad class of quantum information protocols and is critical for both quantum communication and quantum computation. Building upon the quantum algorithms introduced in previous works [M. B. Pozzobom and J. Maziero, Quantum Inf. Process. 18, 142 (2019)] and [E. R. Gårding et al., Entropy 23, 797 (2021)], the authors of [F. Shahbeigi, M. Karimi and V. Karimipour, Phys. Scr. 97, 025101 (2022)] demonstrated the capability to prepare mixed two-qubit X-real states on quantum computers by extending the methodology originally devised for mixed two-qubit Bell-diagonal states. In this article, we delve into an overlooked pattern within these quantum circuits, allowing us to present a modular algorithm for the preparation of general d -dimensional mixed quantum states using quantum information processors. Our general algorithm has a modular structure, encompassing eigenvalue encoding, entropy injection, and eigenvector preparation. To validate our algorithm, we conduct tests on quantum computers utilizing both X- and non-X-states for two mixed-state qubits, two-ququart Bell-diagonal states, as well as arbitrary random density matrices spanning one, two, and three qubits.
We review the basic theory of quantum channels and develop a strategy for simulating them on digital quantum computers, drawing upon the Choi-Kraus operator-sum representation and Stinespring dilation to provide a unified approach for various applications. We discuss three types of applications, offering explicit examples for each: the preparation of mixed states, measurements described by positive operator-valued measures (POVMs), and the simulation of the evolution of Markovian quantum systems. We recover fundamental concepts from quantum theory, such as the purification of a mixed state and the Naimark dilation associated with a POVM. Regarding the simulation of the evolution of a Markovian quantum system, we introduce an operator, termed the residual operator, to construct, from the system's Liouvillian, a quantum channel that serves as a first-order approximation of the quantum dynamical semigroup. This allows the simulation of quantum dynamics to be performed in a manner analogous to the Euler method for ordinary differential equations, avoiding Trotterization. We prove all the theoretical results mentioned, with the exception of the fundamental Choi-Kraus theorem concerning the operator-sum representation of quantum channels, for which we provide the appropriate references. The explicit simulations discussed were implemented using the AerSimulator from IBM's Qiskit SDK, with the corresponding code available on GitHub.
Quantum computers present a compelling platform for the study of open quantum systems, namely the non-unitary dynamics of a system. Here, we investigate and report digital simulations of Markovian, non-unitary dynamics that converge to a unique steady state. The steady state is programmed as a desired target state, yielding semblance to a quantum state preparation protocol. By delegating ancilla qubits and systems qubits, the system state is driven to the target state by repeatedly performing the following steps: (1) executing a designated system-ancilla entangling circuit, (2) measuring the ancilla qubits, and (3) re-initializing ancilla qubits to known states through active reset. While the ancilla qubits are measured and reinitialized to known states, the system qubits undergo a non-unitary evolution and are steered from arbitrary initial states to desired target states. We show results of the method by preparing arbitrary qubit states and qutrit (three-level) states on contemporary quantum computers. We also demonstrate that the state convergence can be accelerated by utilizing the readouts of the ancilla qubits to guide the protocol in a non-blind manner. Our work serves as a nontrivial example that incorporates and characterizes essential operations such as qubit reuse (qubit reset), entangling circuits, and measurement. These operations are not only vital for near-term noisy intermediate-scale quantum (NISQ) applications but are also crucial for realizing future error-correcting codes.
We present a universal algorithm for the optimal quantum state estimation of an arbitrary finite dimensional system. The algorithm specifies a physically realizable (i.e., finite) positive operator valued measurement on a finite number of identically prepared systems. We illustrate the general formalism by applying it to different scenarios of the state estimation of NNN independent and identically prepared two-level systems (qubits).