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

Implementation of a general single-qubit positive operator-valued measure on a circuit-based quantum computer

Yordan S. Yordanov, C. H. W. Barnes

Published Dec 13, 2019• 26 citations
arXivHTMLPDF

Abstract

We derive a deterministic protocol to implement a general single-qubit positive operator-valued measure (POVM) on near-term circuit-based quantum computers. The protocol has a modular structure such that an $n$-element POVM is implemented as a sequence of $(n\ensuremath{-}1)$ circuit modules. Each module performs a two-element POVM. Two variations of the protocol are suggested---one optimal in terms of number of ancilla qubits, the other optimal in terms of number of qubit gate operations and quantum circuit depth. We use the protocol to implement two- and three-element POVMs on two publicly available quantum computing devices. The results we obtain suggest that implementing nontrivial POVMs could be within the reach of the current noisy quantum computing devices.

DOI
10.1103/physreva.100.062317

Related papers

Realization of Arbitrary Positive-Operator-Value Measurement of Single Atomic Qubit via Cavity QED

Han Yang, Wei Wu, Chun-Wang Wu +2 more

Positive-operator-value measurement (POVM) is the most general class of quantum measurement. We propose a scheme to deterministically implement arbitrary POVMs of single atomic qubit via cavity QED catalysed by only one ancilla atomic qubit. By appropriately entangling two atomic qubits and sequentially measuring the ancilla qubit, any POVM can be implemented step by step. As an application of our scheme, the realization of a specific POVM for optimal unambiguous discrimination (OUD) between two nonorthogonal states is given.

Chinese Physics Letters•Dec 1, 2008•4 citations

Saving resources through repeat-until-success positive-operator-valued-measure measurements in quantum computation

Hefeng Wang, Sixia Yu, Hua Xiang

We present a quantum computation approach in which computation is guided by positive-operator-valuedmeasure (POVM) measurements following a given computation path in multisteps. In this approach, one ancillary qubit is coupled to a register of working qubits, and a POVM measurement is implemented effectively on the working qubits by applying a unitary operation on the whole system followed by a projective measurement performed on the ancillary qubit. Each step of the computation is a repeat-until-success procedure such that the desired state of the step is obtained deterministically on the working qubits via POVM measurements. The principle of deferred measurement states that measurements can always be moved from an intermediate stage of a quantum circuit to the end of the circuit without affecting the efficiency of the computation.We demonstrate that in our approach, by introducing intermediate measurements on the ancillary qubit in the computation process, both the number of qubits and unitary operations can be reduced polynomially, compared to the case where the intermediate measurements are deferred to the end of the computation. We also provide a method for implementation of the approach.

quant-pharXiv:2609.08168•Physical Review A•Sep 9, 2026•0 citations

Ancilla-free implementation of generalized measurements for qubits embedded in a qudit space

Laurin E. Fischer, Daniel Miller, Francesco Tacchino +3 more

Informationally complete (IC) positive operator-valued measures (POVMs) are generalized quantum measurements that offer advantages over the standard computational basis readout of qubits. For instance, IC-POVMs enable efficient extraction of operator expectation values, a crucial step in many quantum algorithms. POVM measurements are typically implemented by coupling one additional ancilla qubit to each logical qubit, thus imposing high demands on the device size and connectivity. Here, we show how to implement a general class of IC-POVMs without ancilla qubits. We exploit the higher-dimensional Hilbert space of a qudit in which qubits are often encoded. POVMs can then be realized by coupling each qubit to two of the available qudit states, followed by a projective measurement. We develop the required control pulse sequences and numerically establish their feasibility for superconducting transmon qubits through pulse-level simulations. Finally, we present an experimental demonstration of a qudit-space POVM measurement on IBM Quantum hardware. This paves the way to making POVM measurements broadly available to quantum computing applications.

arXiv:2203.07369•Physical Review Research•Jul 11, 2022•52 citations

Adaptive POVM implementations and measurement error mitigation strategies for near-term quantum devices

Adam Glos, Anton Nykänen, Elsi-Mari Borrelli +4 more

We present adaptive measurement techniques tailored for variational quantum algorithms on near-term small and noisy devices. In particular, we generalise earlier "learning to measure" strategies in two ways. First, by considering a class of adaptive positive operator valued measures (POVMs) that can be simulated with simple projective measurements without ancillary qubits, we decrease the amount of required qubits and two-qubit gates. Second, by introducing a method based on Quantum Detector Tomography to mitigate the effect of noise, we are able to optimise the POVMs as well as to infer expectation values reliably in the currently available noisy quantum devices. Our numerical simulations clearly indicate that the presented strategies can significantly reduce the number of needed shots to achieve chemical accuracy in variational quantum eigensolvers, thus helping to solve one of the bottlenecks of near-term quantum computing.

arXiv:2208.07817•Aug 16, 2022•31 citations

Quantum Walk as a Generalized Measuring Device

Paweł Kurzyński, Antoni Wójcik

We show that a one-dimensional discrete time quantum walk can be used to implement a generalized measurement in terms of a positive operator value measure (POVM) on a single qubit. More precisely, we show that for a single qubit any set of rank 1 and rank 2 POVM elements can be generated by a properly engineered quantum walk. In such a scenario the measurement of a particle at a position x=i corresponds to a measurement of a POVM element E_{i} on a qubit. Since the idea of quantum walks originates from the von Neumann model of measurement, in which the change of the position of the pointer depends on the state of the system that is being measured, we argue that von Neumann measurements can be naturally extended to POVMs if one includes the internal evolution of the system in the model.

arXiv:1208.1800•Physical Review Letters•May 14, 2013•75 citations

Implementing arbitrary quantum operations via quantum walks on a cycle graph

Jia-Yi Lin, Xinyu Li, Yu-Hao Shao +2 more

The quantum circuit model is the most commonly used model for implementing quantum computers and quantum neural networks whose essential tasks are to realize certain unitary operations. The circuit model usually implements a desired unitary operation $U(N)$ by a sequence of single-qubit and two-qubit unitary gates from a universal set. Although this certainly facilitates the experimentalists as they only need to prepare several different kinds of universal gates, the number of gates required to implement an arbitrary desired unitary operation is usually large. Hence, the efficiency in terms of the circuit depth or running time is not guaranteed. Here we propose an alternative approach; we use a simple discrete-time quantum walk (DTQW) on a cycle graph to model an arbitrary unitary operation $U(N)$ without the need to decompose it into a sequence of gates of smaller sizes. Our model is essentially a quantum neural network based on DTQW. Firstly, it is universal as we show that any unitary operation $U(N)$ can be realized via an appropriate choice of coin operators. Secondly, our DTQW-based neural network can be updated efficiently via a learning algorithm, i.e., a modified stochastic gradient descent algorithm adapted to our network. By training this network, one can promisingly find approximations to arbitrary desired unitary operations. With an additional measurement on the output, the DTQW-based neural network can also implement general positive-operator-valued measure (POVM) measurements. We show its capacity in implementing arbitrary two-outcome POVMs via numeric simulation. We further demonstrate that the network can be simplified and can overcome device noises during the training so that it becomes more friendly for laboratory implementations. Our work shows the capability of the DTQW-based neural network in quantum computation and its potential in laboratory implementations.

arXiv:2210.14450•Physical Review A•Apr 5, 2023•5 citations
We derive a deterministic protocol to implement a general single-qubit positive operator-valued measure (POVM) on near-term circuit-based quantum computers. The protocol has a modular structure such that an nnn-element POVM is implemented as a sequence of (n\ensuremath−1)(n\ensuremath{-}1)(n\ensuremath−1) circuit modules. Each module performs a two-element POVM. Two variations of the protocol are suggested---one optimal in terms of number of ancilla qubits, the other optimal in terms of number of qubit gate operations and quantum circuit depth. We use the protocol to implement two- and three-element POVMs on two publicly available quantum computing devices. The results we obtain suggest that implementing nontrivial POVMs could be within the reach of the current noisy quantum computing devices.
Positive-operator-value measurement (POVM) is the most general class of quantum measurement. We propose a scheme to deterministically implement arbitrary POVMs of single atomic qubit via cavity QED catalysed by only one ancilla atomic qubit. By appropriately entangling two atomic qubits and sequentially measuring the ancilla qubit, any POVM can be implemented step by step. As an application of our scheme, the realization of a specific POVM for optimal unambiguous discrimination (OUD) between two nonorthogonal states is given.
We present a quantum computation approach in which computation is guided by positive-operator-valuedmeasure (POVM) measurements following a given computation path in multisteps. In this approach, one ancillary qubit is coupled to a register of working qubits, and a POVM measurement is implemented effectively on the working qubits by applying a unitary operation on the whole system followed by a projective measurement performed on the ancillary qubit. Each step of the computation is a repeat-until-success procedure such that the desired state of the step is obtained deterministically on the working qubits via POVM measurements. The principle of deferred measurement states that measurements can always be moved from an intermediate stage of a quantum circuit to the end of the circuit without affecting the efficiency of the computation.We demonstrate that in our approach, by introducing intermediate measurements on the ancillary qubit in the computation process, both the number of qubits and unitary operations can be reduced polynomially, compared to the case where the intermediate measurements are deferred to the end of the computation. We also provide a method for implementation of the approach.
Informationally complete (IC) positive operator-valued measures (POVMs) are generalized quantum measurements that offer advantages over the standard computational basis readout of qubits. For instance, IC-POVMs enable efficient extraction of operator expectation values, a crucial step in many quantum algorithms. POVM measurements are typically implemented by coupling one additional ancilla qubit to each logical qubit, thus imposing high demands on the device size and connectivity. Here, we show how to implement a general class of IC-POVMs without ancilla qubits. We exploit the higher-dimensional Hilbert space of a qudit in which qubits are often encoded. POVMs can then be realized by coupling each qubit to two of the available qudit states, followed by a projective measurement. We develop the required control pulse sequences and numerically establish their feasibility for superconducting transmon qubits through pulse-level simulations. Finally, we present an experimental demonstration of a qudit-space POVM measurement on IBM Quantum hardware. This paves the way to making POVM measurements broadly available to quantum computing applications.
We present adaptive measurement techniques tailored for variational quantum algorithms on near-term small and noisy devices. In particular, we generalise earlier "learning to measure" strategies in two ways. First, by considering a class of adaptive positive operator valued measures (POVMs) that can be simulated with simple projective measurements without ancillary qubits, we decrease the amount of required qubits and two-qubit gates. Second, by introducing a method based on Quantum Detector Tomography to mitigate the effect of noise, we are able to optimise the POVMs as well as to infer expectation values reliably in the currently available noisy quantum devices. Our numerical simulations clearly indicate that the presented strategies can significantly reduce the number of needed shots to achieve chemical accuracy in variational quantum eigensolvers, thus helping to solve one of the bottlenecks of near-term quantum computing.
We show that a one-dimensional discrete time quantum walk can be used to implement a generalized measurement in terms of a positive operator value measure (POVM) on a single qubit. More precisely, we show that for a single qubit any set of rank 1 and rank 2 POVM elements can be generated by a properly engineered quantum walk. In such a scenario the measurement of a particle at a position x=i corresponds to a measurement of a POVM element E_{i} on a qubit. Since the idea of quantum walks originates from the von Neumann model of measurement, in which the change of the position of the pointer depends on the state of the system that is being measured, we argue that von Neumann measurements can be naturally extended to POVMs if one includes the internal evolution of the system in the model.
The quantum circuit model is the most commonly used model for implementing quantum computers and quantum neural networks whose essential tasks are to realize certain unitary operations. The circuit model usually implements a desired unitary operation U(N)U(N)U(N) by a sequence of single-qubit and two-qubit unitary gates from a universal set. Although this certainly facilitates the experimentalists as they only need to prepare several different kinds of universal gates, the number of gates required to implement an arbitrary desired unitary operation is usually large. Hence, the efficiency in terms of the circuit depth or running time is not guaranteed. Here we propose an alternative approach; we use a simple discrete-time quantum walk (DTQW) on a cycle graph to model an arbitrary unitary operation U(N)U(N)U(N) without the need to decompose it into a sequence of gates of smaller sizes. Our model is essentially a quantum neural network based on DTQW. Firstly, it is universal as we show that any unitary operation U(N)U(N)U(N) can be realized via an appropriate choice of coin operators. Secondly, our DTQW-based neural network can be updated efficiently via a learning algorithm, i.e., a modified stochastic gradient descent algorithm adapted to our network. By training this network, one can promisingly find approximations to arbitrary desired unitary operations. With an additional measurement on the output, the DTQW-based neural network can also implement general positive-operator-valued measure (POVM) measurements. We show its capacity in implementing arbitrary two-outcome POVMs via numeric simulation. We further demonstrate that the network can be simplified and can overcome device noises during the training so that it becomes more friendly for laboratory implementations. Our work shows the capability of the DTQW-based neural network in quantum computation and its potential in laboratory implementations.