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/0510033

Programmable quantum channels and measurements

Giacomo Mauro D’Ariano, Paolo Perinotti

Published Oct 5, 2005• 15 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.quant-ph/0510033

Related papers

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

ON THE MOST EFFICIENT UNITARY TRANSFORMATION FOR PROGRAMMING QUANTUM CHANNELS

Giacomo Mauro D’Ariano, Paolo Perinotti

We address the problem of finding the optimal joint unitary transformation on system + ancilla which is the most efficient in programming any desired channel on the system by changing the state of the ancilla. We present a solution to the problem for dim(H)=2 for both system and ancilla.

arXiv:quant-ph/0509183•Quantum Probability and Infinite Dimensional Analysis•Jul 1, 2007•4 citations

Optimality of programmable quantum measurements

David Pérez-García

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).

arXiv:quant-ph/0602084•Physical Review A•May 24, 2006•15 citations

Quantum Programmable Reflections

Eddie Schoute, Dmitry Grinko, Yiğit Subaşı +1 more

Similar to a classical processor, which is an algorithm for reading a program and executing its instructions on input data, a universal programmable quantum processor is a fixed quantum channel that reads a quantum program $\lvertψ_{U}\rangle$ that causes the processor to approximately apply an arbitrary unitary $U$ to a quantum data register. The present work focuses on a class of simple programmable quantum processors for implementing reflection operators, i.e. $U = e^{i π\lvertψ\rangle\langleψ\rvert}$ for an arbitrary pure state $\lvertψ\rangle$ of finite dimension $d$. Unlike quantum programs that assume query access to $U$, our program takes the form of independent copies of the state to be reflected about $\lvertψ_U\rangle = \lvertψ\rangle^{\otimes n}$. We then identify the worst-case optimal algorithm among all processors of the form $\text{tr}_{\text{Program}}[V (\lvertϕ\rangle\langleϕ\rvert \otimes (\lvertψ\rangle\langleψ\rvert)^{\otimes n}) V^\dagger]$ where the algorithm $V$ is a unitary linear combination of permutations. By generalizing these algorithms to processors for arbitrary-angle rotations, $e^{i α\lvertψ\rangle\langleψ\rvert}$ for $α\in \mathbb R$, we give a construction for a universal programmable processor with better scaling in $d$. For programming reflections, we obtain a tight analytical lower bound on the program dimension by bounding the Holevo information of an ensemble of reflections applied to an entangled probe state. The lower bound makes use of a block decomposition of the uniform ensemble of reflected states with respect to irreps of the partially transposed permutation matrix algebra, and two representation-theoretic conjectures based on extensive numerical evidence.

arXiv:2411.03648•Nov 6, 2024•7 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

Optimization of quantum universal detectors

Giacomo Mauro D’Ariano, Paolo Perinotti, Massimiliano Federico Sacchi

The expectation value of an arbitrary operator O can be obtained via a universal measuring apparatus that is independent of O, by changing only the data-processing of the outcomes. Such a ``universal detector'' performs a joint measurement on the system and on a suitable ancilla prepared in a fixed state, and is equivalent to a positive operator valued measure (POVM) for the system that is ``informationally complete''. The data processing functions generally are not unique, and we pose the problem of their optimization, providing some examples for covariant POVM's, in particular for SU(d) covariance group.

arXiv:quant-ph/0309161•Sep 22, 2003•5 citations
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 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).
Similar to a classical processor, which is an algorithm for reading a program and executing its instructions on input data, a universal programmable quantum processor is a fixed quantum channel that reads a quantum program ∣ψU⟩\lvertψ_{U}\rangle∣ψU​⟩ that causes the processor to approximately apply an arbitrary unitary UUU to a quantum data register. The present work focuses on a class of simple programmable quantum processors for implementing reflection operators, i.e. U=eiπ∣ψ⟩⟨ψ∣U = e^{i π\lvertψ\rangle\langleψ\rvert}U=eiπ∣ψ⟩⟨ψ∣ for an arbitrary pure state ∣ψ⟩\lvertψ\rangle∣ψ⟩ of finite dimension ddd. Unlike quantum programs that assume query access to UUU, our program takes the form of independent copies of the state to be reflected about ∣ψU⟩=∣ψ⟩⊗n\lvertψ_U\rangle = \lvertψ\rangle^{\otimes n}∣ψU​⟩=∣ψ⟩⊗n. We then identify the worst-case optimal algorithm among all processors of the form trProgram[V(∣ϕ⟩⟨ϕ∣⊗(∣ψ⟩⟨ψ∣)⊗n)V†]\text{tr}_{\text{Program}}[V (\lvertϕ\rangle\langleϕ\rvert \otimes (\lvertψ\rangle\langleψ\rvert)^{\otimes n}) V^\dagger]trProgram​[V(∣ϕ⟩⟨ϕ∣⊗(∣ψ⟩⟨ψ∣)⊗n)V†] where the algorithm VVV is a unitary linear combination of permutations. By generalizing these algorithms to processors for arbitrary-angle rotations, eiα∣ψ⟩⟨ψ∣e^{i α\lvertψ\rangle\langleψ\rvert}eiα∣ψ⟩⟨ψ∣ for α∈Rα\in \mathbb Rα∈R, we give a construction for a universal programmable processor with better scaling in ddd. For programming reflections, we obtain a tight analytical lower bound on the program dimension by bounding the Holevo information of an ensemble of reflections applied to an entangled probe state. The lower bound makes use of a block decomposition of the uniform ensemble of reflected states with respect to irreps of the partially transposed permutation matrix algebra, and two representation-theoretic conjectures based on extensive numerical evidence.
The expectation value of an arbitrary operator O can be obtained via a universal measuring apparatus that is independent of O, by changing only the data-processing of the outcomes. Such a ``universal detector'' performs a joint measurement on the system and on a suitable ancilla prepared in a fixed state, and is equivalent to a positive operator valued measure (POVM) for the system that is ``informationally complete''. The data processing functions generally are not unique, and we pose the problem of their optimization, providing some examples for covariant POVM's, in particular for SU(d) covariance group.