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

Physical Review A

Probabilistic quantum multimeters (13 pages)

Jaromı́r Fiurášek

Published Jan 1, 2004• 0 citations
OpenAlex

Related papers

Experimental quantum multimeter and one-qubit fingerprinting (4 pages)

Jianying Du, Ping Zou, Xi Peng +1 more

Physical Review A•Jan 1, 2006•0 citations

Probabilistic quantum control via indirect measurement (6 pages)

J. W. Clark, Aikaterini Mandilara

Physical Review A•Jan 1, 2005•4 citations

Probabilistic coding of quantum states (5 pages)

Antoni Wójcik, Mikołaj Czechlewski, Andrzej Grudka

Physical Review A•Jan 1, 2006•0 citations

Testing the bounds on quantum probabilities (6 pages)

Stefan Filipp, Karl Svozil

Physical Review A•Jan 1, 2004•0 citations

Probabilistic quantum multimeters

Jaromı́r Fiurášek, Miloslav Dušek

We propose quantum devices that can realize probabilistically different projective measurements on a qubit. The desired measurement basis is selected by the quantum state of a program register. First we analyze the phase-covariant multimeters for a large class of program states and then the universal multimeters for a special choice of program. In both cases we start with deterministic but error-prone devices and then proceed to devices that never make a mistake but from time to time give an inconclusive result. These multimeters are optimized (for a given type of program) with respect to the minimum probability of an inconclusive result. This concept is further generalized to multimeters that minimize the error rate for a given probability of an inconclusive result (or vice versa). Finally, we propose a generalization for qudits.

arXiv:quant-ph/0308111•Physical Review A•Mar 8, 2004•26 citations

Quantum Bayesian methods and subsequent measurements (6 pages)

Filippo Neri

Physical Review A•Jan 1, 2005•0 citations
We propose quantum devices that can realize probabilistically different projective measurements on a qubit. The desired measurement basis is selected by the quantum state of a program register. First we analyze the phase-covariant multimeters for a large class of program states and then the universal multimeters for a special choice of program. In both cases we start with deterministic but error-prone devices and then proceed to devices that never make a mistake but from time to time give an inconclusive result. These multimeters are optimized (for a given type of program) with respect to the minimum probability of an inconclusive result. This concept is further generalized to multimeters that minimize the error rate for a given probability of an inconclusive result (or vice versa). Finally, we propose a generalization for qudits.