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:quant-ph/0602084 · Physical Review A

Optimality of programmable quantum measurements

David Pérez-García

Published May 24, 2006• 15 citations
arXivHTMLPDF

Abstract

We prove that for a programmable measurement device that approximates every POVM with an error $\ensuremath{\leqslant}\ensuremath{\delta}$, the dimension of the program space has to grow at least polynomially with $\frac{1}{\ensuremath{\delta}}$. In the case of qubits we can improve the general result by showing a linear growth. This proves the optimality of the programmable measurement devices recently designed in G. M. D'Ariano and P. Perinotti, Phys. Rev. Lett. 94, 090401 (2005).

DOI
10.1103/physreva.73.052315

Related papers

Programmable quantum channels and measurements

Giacomo Mauro D’Ariano, Paolo Perinotti

We review some partial results for two strictly related problems. The first problem consists in finding the optimal joint unitary transformation on system and ancilla which is the most efficient in programming any desired channel on the system by changing the state of the ancilla. In this respect we present a solution for dimension two for both system and ancilla. The second problem consists in finding the optimal universal programmable detector, namely a device that can be tuned to perform any desired measurement on a given quantum system, by changing the state of an ancilla. With a finite dimension for the ancilla only approximate universal programmability is possible, with minimal dimension increasing function versus the precision of the approximation. We show that one can achieve a dimension growing polynomially versus the precision, and even linearly in specific cases.

arXiv:quant-ph/0510033•Oct 5, 2005•15 citations

Programmable quantum measurement device that approximates all projective measurements on a qubit

Jaromír Fiurášek, Miloslav Dušek, Radim Filip

Abstract A “universal” quantum measurement device is proposed. It can approximate any projective measurement on a qubit. The measurement basis is selected by the quantum state of a “program register''. The device is optimized with respect to maximal average fidelity. A contra‐intuitive result is that if two qubits in the same state are used as a program the average fidelity is higher than if the second program qubit is in the respective orthogonal state.

Fortschritte der Physik•Feb 26, 2003•3 citations

Efficient Universal Programmable Quantum Measurements

Giacomo Mauro D’Ariano, Paolo Perinotti

A universal programmable detector is a device that can be tuned to perform any desired measurement on a given quantum system, by changing the state of an ancilla. With a finite dimension d for the ancilla only approximate universal programmability is possible, with size d=f(epsilon(-1)) increasing the function of the "accuracy" epsilon(-1). In this Letter we show that, much better than the exponential size known in the literature, one can achieve polynomial size. An explicit example with linear size is also presented. Finally, we show that for covariant measurements exact programmability is feasible.

arXiv:quant-ph/0410169•Physical Review Letters•Mar 8, 2005•43 citations

Quantum-controlled measurement device for quantum-state discrimination

Miloslav Dušek, Vladimír Bužek

We propose a ``programmable'' quantum device that is able to perform a specific generalized measurement from a certain set of measurements depending on a quantum state of a ``program register.'' In particular, we study a situation when the programmable measurement device serves for the unambiguous discrimination between nonorthogonal states. The particular pair of states that can be unambiguously discriminated is specified by the state of a program qubit. The probability of successful discrimination is not optimal for all admissible pairs. However, for some subsets it can be very close to the optimal value.

arXiv:quant-ph/0201097•Physical Review A•Aug 20, 2002•84 citations

On quantum detection and the square-root measurement

Yonina C. Eldar, G. David Forney

We consider the problem of constructing measurements optimized to distinguish between a collection of possibly nonorthogonal quantum states. We consider a collection of pure states and seek a positive operator-valued measure (POVM) consisting of rank-one operators with measurement vectors closest in squared norm to the given states. We compare our results to previous measurements suggested by Peres and Wootters (1991) and Hausladen et al. (1996), where we refer to the latter as the square-root measurement (SRM). We obtain a new characterization of the SRM, and prove that it is optimal in a least-squares sense. In addition, we show that for a geometrically uniform state set the SRM minimizes the probability of a detection error. This generalizes a similar result of Ban et al. (see Int. J. Theor. Phys., vol.36, p.1269-88, 1997).

arXiv:quant-ph/0005132•IEEE Transactions on Information Theory•Mar 1, 2001•241 citations

The compatibility dimension of quantum measurements

Faedi Loulidi, Ion Nechita

We introduce the notion of compatibility dimension for a set of quantum measurements: it is the largest dimension of a Hilbert space on which the given measurements are compatible. In the Schrödinger picture, this notion corresponds to testing compatibility with ensembles of quantum states supported on a subspace, using the incompatibility witnesses of Carmeli, Heinosaari, and Toigo [Phys. Rev. A 98,012126 (2018) and Phys. Rev. Lett. 122, 130402 (2019).]. We provide several bounds for the compatibility dimension using approximate quantum cloning or algebraic techniques inspired by quantum error correction. We analyze in detail the case of two orthonormal bases and, in particular, that of mutually unbiased bases.

arXiv:2008.10317•Journal of Mathematical Physics•Apr 1, 2021•12 citations
We prove that for a programmable measurement device that approximates every POVM with an error \ensuremath⩽\ensuremathδ\ensuremath{\leqslant}\ensuremath{\delta}\ensuremath⩽\ensuremathδ, the dimension of the program space has to grow at least polynomially with 1\ensuremathδ\frac{1}{\ensuremath{\delta}}\ensuremathδ1​. In the case of qubits we can improve the general result by showing a linear growth. This proves the optimality of the programmable measurement devices recently designed in G. M. D'Ariano and P. Perinotti, Phys. Rev. Lett. 94, 090401 (2005).
We review some partial results for two strictly related problems. The first problem consists in finding the optimal joint unitary transformation on system and ancilla which is the most efficient in programming any desired channel on the system by changing the state of the ancilla. In this respect we present a solution for dimension two for both system and ancilla. The second problem consists in finding the optimal universal programmable detector, namely a device that can be tuned to perform any desired measurement on a given quantum system, by changing the state of an ancilla. With a finite dimension for the ancilla only approximate universal programmability is possible, with minimal dimension increasing function versus the precision of the approximation. We show that one can achieve a dimension growing polynomially versus the precision, and even linearly in specific cases.
A universal programmable detector is a device that can be tuned to perform any desired measurement on a given quantum system, by changing the state of an ancilla. With a finite dimension d for the ancilla only approximate universal programmability is possible, with size d=f(epsilon(-1)) increasing the function of the "accuracy" epsilon(-1). In this Letter we show that, much better than the exponential size known in the literature, one can achieve polynomial size. An explicit example with linear size is also presented. Finally, we show that for covariant measurements exact programmability is feasible.
We propose a ``programmable'' quantum device that is able to perform a specific generalized measurement from a certain set of measurements depending on a quantum state of a ``program register.'' In particular, we study a situation when the programmable measurement device serves for the unambiguous discrimination between nonorthogonal states. The particular pair of states that can be unambiguously discriminated is specified by the state of a program qubit. The probability of successful discrimination is not optimal for all admissible pairs. However, for some subsets it can be very close to the optimal value.
We consider the problem of constructing measurements optimized to distinguish between a collection of possibly nonorthogonal quantum states. We consider a collection of pure states and seek a positive operator-valued measure (POVM) consisting of rank-one operators with measurement vectors closest in squared norm to the given states. We compare our results to previous measurements suggested by Peres and Wootters (1991) and Hausladen et al. (1996), where we refer to the latter as the square-root measurement (SRM). We obtain a new characterization of the SRM, and prove that it is optimal in a least-squares sense. In addition, we show that for a geometrically uniform state set the SRM minimizes the probability of a detection error. This generalizes a similar result of Ban et al. (see Int. J. Theor. Phys., vol.36, p.1269-88, 1997).
We introduce the notion of compatibility dimension for a set of quantum measurements: it is the largest dimension of a Hilbert space on which the given measurements are compatible. In the Schrödinger picture, this notion corresponds to testing compatibility with ensembles of quantum states supported on a subspace, using the incompatibility witnesses of Carmeli, Heinosaari, and Toigo [Phys. Rev. A 98,012126 (2018) and Phys. Rev. Lett. 122, 130402 (2019).]. We provide several bounds for the compatibility dimension using approximate quantum cloning or algebraic techniques inspired by quantum error correction. We analyze in detail the case of two orthonormal bases and, in particular, that of mutually unbiased bases.