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

Self-testing mutually unbiased bases in the prepare-and-measure scenario

Máté Farkas, Jędrzej Kaniewski

Published Mar 12, 2019• 84 citations
arXivHTMLPDF

Abstract

Mutually unbiased bases (MUBs) constitute the canonical example of incompatible quantum measurements. One standard application of MUBs is the task known as quantum random access code (QRAC), in which classical information is encoded in a quantum system, and later part of it is recovered by performing a quantum measurement. We analyze a specific class of QRACs, known as the ${2}^{d}\ensuremath{\rightarrow}1$ QRAC, in which two classical dits are encoded in a $d$-dimensional quantum system. It is known that among rank-1 projective measurements MUBs give the best performance. We show (for every $d$) that this cannot be improved by employing nonprojective measurements. Moreover, we show that the optimal performance can only be achieved by measurements which are rank-1 projective and mutually unbiased. In other words, the ${2}^{d}\ensuremath{\rightarrow}1$ QRAC is a self-test for a pair of MUBs in the prepare-and-measure scenario. To make the self-testing statement robust we propose measures which characterize how well a pair of (not necessarily projective) measurements satisfies the MUB conditions and show how to estimate these measures from the observed performance. Similarly, we derive explicit bounds on operational quantities like the incompatibility robustness or the amount of uncertainty generated by the uncharacterized measurements. For low dimensions the robustness of our bounds is comparable to that of currently available technology, which makes them relevant for existing experiments. Last, our results provide essential support for a recently proposed method for solving the long-standing existence problem of MUBs.

DOI
10.1103/physreva.99.032316

Related papers

Self-Testing Mutually Unbiased Bases in Higher Dimensions with Space-Division Multiplexing Optical Fiber Technology

Máté Farkas, Nayda Guerrero, Jaime Cariñe +2 more

In the device-independent quantum-information approach, the implementation of a given task can be self-tested solely from the recorded statistics and without detailed models for the employed devices. Even though experimentally demanding, it provides appealing verification schemes for advanced quantum technologies that naturally fulfil the associated requirements. In this work, we experimentally study whether self-testing protocols can be adopted to certify the proper functioning of quantum devices built with modern space-division multiplexing optical fiber technology. Specifically, we consider the prepare-and-measure protocol of Farkas and Kaniewski [Phys. Rev. A 99, 032316 (2019)] for self-testing measurements corresponding to mutually unbiased bases (MUBs) in a dimension $d>2$. In our scheme, the state preparation and measurement stages are implemented using a multiarm interferometer built with multicore optical fibers and related components. Due to the high overlap of the interferometer's optical modes achieved with this technology, we are able to reach the required visibilities for self-testing the implementation of two four-dimensional MUBs. We also quantify two operational quantities of the measurements: (i) the incompatibility robustness, connected to Bell violations, and (ii) the randomness extractable from the outcomes. Since MUBs lie at the core of several quantum-information protocols, our results are of practical interest for future quantum works relying on space-division multiplexing optical fibers.

arXiv:2006.06784•Physical Review Applied•Jan 15, 2021•14 citations

Measurement Geometry for Quantum Random Access Codes: Beyond Nayak Bound and Toward Optimality

Seiseki Akibue, Rudy Raymond, Suguru Tamaki +1 more

Quantum random access codes (QRACs) ask how well N classical bits can be encoded into M qubits while allowing any single bit to be recovered. Although the Nayak bound remains the standard general upper bound on the decoding probability, numerical evidence suggests a stronger upper bound in the small-qubit regime. In this work, we formulate the optimal decoding probability in terms of decoding measurements, reformulating QRAC design as a spectral problem for noncommuting measurements. Using this formulation, we give an elementary proof of the Nayak bound by simplifying the Chernoff-bound argument. Moreover, we refine the argument to obtain upper bounds that improve over Nayak's bound in the entire finite-size regime. The equality conditions of our bounds justify defining mutually unbiased projector-valued measurements (MUPVMs), a generalization of mutually unbiased bases. We show that decoding measurement of any two-qubit QRAC attaining the conjectured bound must form MUPVMs. We also show that any MUPVM, assisted by one ancillary qubit, yields a QRAC with optimal N-scaling decoding probability. Finally, we propose a new MUPVM-based construction for the (M+2,M)-QRAC family attaining the conjectured bound.

quant-pharXiv:2606.12700•Jun 12, 2026•0 citations

High-dimensional multi-input quantum random access codes and mutually unbiased bases

Rui-Heng Miao, Zhao‐Di Liu, Yong-Nan Sun +3 more

Quantum random access codes (QRACs) provide a basic tool for demonstrating the advantages of quantum resources and protocols, which have a wide range of applications in quantum information processing tasks. However, the investigation and application of high-dimensional $(d)$ multi-input $(n)\phantom{\rule{4pt}{0ex}}{n}^{(d)}\ensuremath{\rightarrow}1$ QRACs are still lacking. Here, we present a general method to find the maximum success probability of ${n}^{(d)}\ensuremath{\rightarrow}1$ QRACs. In particular, we give the analytical solution for maximum success probability of ${3}^{(d)}\ensuremath{\rightarrow}1$ QRACs when measurement bases are mutually unbiased bases (MUBs). Based on the analytical solution, we show the relationship between MUBs and ${n}^{(d)}\ensuremath{\rightarrow}1$ QRACs. First, we provide a systematic method of searching for the operational inequivalence of MUBs (OI-MUBs) when the dimension $d$ is a prime power. Second, we theoretically prove that, surprisingly, the commonly used Galois MUBs are not the optimal measurement bases to obtain the maximum success probability of ${n}^{(d)}\ensuremath{\rightarrow}1$ QRACs, which indicates a breakthrough according to the traditional conjecture regarding the optimal measurement bases. Furthermore, based on high-fidelity high-dimensional quantum states of orbital angular momentum, we experimentally achieve two-input and three-input QRACs up to dimension 11. We experimentally confirm the OI-MUBs when $d=5$. Our results open alternative avenues for investigating the foundational properties of quantum mechanics and quantum network coding.

arXiv:2111.08890•Physical Review A•Oct 14, 2022•6 citations

Quantifying Measurement Incompatibility of Mutually Unbiased Bases

Sébastien Designolle, Paul Skrzypczyk, Florian Fröwis +1 more

Quantum measurements based on mutually unbiased bases are commonly used in quantum information processing, as they are generally viewed as being maximally incompatible and complementary. Here we quantify precisely the degree of incompatibility of mutually unbiased bases (MUB) using the notion of noise robustness. Specifically, for sets of k MUB in dimension d, we provide upper and lower bounds on this quantity. Notably, we get a tight bound in several cases, in particular for complete sets of k=d+1 MUB (using the standard construction for d being a prime power). On the way, we also derive a general upper bound on the noise robustness for an arbitrary set of quantum measurements. Moreover, we prove the existence of sets of k MUB that are operationally inequivalent, as they feature different noise robustness, and we provide a lower bound on the number of such inequivalent sets up to dimension 32. Finally, we discuss applications of our results for Einstein-Podolsky-Rosen steering.

arXiv:1805.09609•Physical Review Letters•Feb 6, 2019•77 citations

Measures to characterise Approximate Mutually Unbiased Bases

Ajeet Kumar, Uditanshu Sadual

Mutually Unbiased bases has various application in quantum information procession and coding theory. There can be maximum d + 1 MUBs in C^d and d/2 +1 MUBs in R^d. But , over R^d MUBs are known to be non existent when d is odd and for most of the other even d there are mostly 3 Real MUBs. In case of C^d the construction for complete set of MUBs are known for only Prime Power dimension. Thus in general large set of MUBs are not known, particularly for composite dimensions which are not of the form of prime powers. Because of this, there are many constructions of Approximate version of MUBs. In this paper we make an attempt to define certain measures to characterise the AMUBs. Our construction of measures derives its inspiration from the applications of MUBs, and based on them, we define certain quantifiable measures, which are can be computed and gives estimates of how close the Approximate MUBs are to the MUBs. We use geometric interpretation, projective design features of MUBs and applications like Optimal State determination and Entropic Uncertainty of MUBs. We show generic relationship between these measures and show that it can be evaluated for APMUBs without known the exact construction details, thereby showing that definition of APMUB is sufficient completely characterise it. We also evaluate these measure for an interesting class of AMUBs called Weak MUBs and certain AMUBs constructed using RBDs.

quant-pharXiv:2512.12828•Dec 16, 2025•0 citations

Quantum Random Access Codes with Mutually Unbiased Bases in Three-Dimensional Hilbert Space

Qian-Kun Yao, Yuqian Zhou, Ya-Qi Dong

Quantum random access codes (QRACs) are key tools for a variety of protocols in quantum information theory. This paper gives an upper bound on the guessing success probability in the classical case of random access codes using mutually unbiased bases as measurement bases in a 3-dimensional Hilbert space and gives an encoding strategy capable of exceeding the classical bound. This encoding strategy holds for both 3-1 and 4-1 QRACs. This result is useful in areas such as random number expansion.

IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)•Dec 1, 2022•0 citations
Mutually unbiased bases (MUBs) constitute the canonical example of incompatible quantum measurements. One standard application of MUBs is the task known as quantum random access code (QRAC), in which classical information is encoded in a quantum system, and later part of it is recovered by performing a quantum measurement. We analyze a specific class of QRACs, known as the 2d\ensuremath→1{2}^{d}\ensuremath{\rightarrow}12d\ensuremath→1 QRAC, in which two classical dits are encoded in a ddd-dimensional quantum system. It is known that among rank-1 projective measurements MUBs give the best performance. We show (for every ddd) that this cannot be improved by employing nonprojective measurements. Moreover, we show that the optimal performance can only be achieved by measurements which are rank-1 projective and mutually unbiased. In other words, the 2d\ensuremath→1{2}^{d}\ensuremath{\rightarrow}12d\ensuremath→1 QRAC is a self-test for a pair of MUBs in the prepare-and-measure scenario. To make the self-testing statement robust we propose measures which characterize how well a pair of (not necessarily projective) measurements satisfies the MUB conditions and show how to estimate these measures from the observed performance. Similarly, we derive explicit bounds on operational quantities like the incompatibility robustness or the amount of uncertainty generated by the uncharacterized measurements. For low dimensions the robustness of our bounds is comparable to that of currently available technology, which makes them relevant for existing experiments. Last, our results provide essential support for a recently proposed method for solving the long-standing existence problem of MUBs.
In the device-independent quantum-information approach, the implementation of a given task can be self-tested solely from the recorded statistics and without detailed models for the employed devices. Even though experimentally demanding, it provides appealing verification schemes for advanced quantum technologies that naturally fulfil the associated requirements. In this work, we experimentally study whether self-testing protocols can be adopted to certify the proper functioning of quantum devices built with modern space-division multiplexing optical fiber technology. Specifically, we consider the prepare-and-measure protocol of Farkas and Kaniewski [Phys. Rev. A 99, 032316 (2019)] for self-testing measurements corresponding to mutually unbiased bases (MUBs) in a dimension d>2d>2d>2. In our scheme, the state preparation and measurement stages are implemented using a multiarm interferometer built with multicore optical fibers and related components. Due to the high overlap of the interferometer's optical modes achieved with this technology, we are able to reach the required visibilities for self-testing the implementation of two four-dimensional MUBs. We also quantify two operational quantities of the measurements: (i) the incompatibility robustness, connected to Bell violations, and (ii) the randomness extractable from the outcomes. Since MUBs lie at the core of several quantum-information protocols, our results are of practical interest for future quantum works relying on space-division multiplexing optical fibers.
Quantum random access codes (QRACs) ask how well N classical bits can be encoded into M qubits while allowing any single bit to be recovered. Although the Nayak bound remains the standard general upper bound on the decoding probability, numerical evidence suggests a stronger upper bound in the small-qubit regime. In this work, we formulate the optimal decoding probability in terms of decoding measurements, reformulating QRAC design as a spectral problem for noncommuting measurements. Using this formulation, we give an elementary proof of the Nayak bound by simplifying the Chernoff-bound argument. Moreover, we refine the argument to obtain upper bounds that improve over Nayak's bound in the entire finite-size regime. The equality conditions of our bounds justify defining mutually unbiased projector-valued measurements (MUPVMs), a generalization of mutually unbiased bases. We show that decoding measurement of any two-qubit QRAC attaining the conjectured bound must form MUPVMs. We also show that any MUPVM, assisted by one ancillary qubit, yields a QRAC with optimal N-scaling decoding probability. Finally, we propose a new MUPVM-based construction for the (M+2,M)-QRAC family attaining the conjectured bound.
Quantum random access codes (QRACs) provide a basic tool for demonstrating the advantages of quantum resources and protocols, which have a wide range of applications in quantum information processing tasks. However, the investigation and application of high-dimensional (d)(d)(d) multi-input $(n)\phantom{\rule{4pt}{0ex}}{n}^{(d)}\ensuremath{\rightarrow}1$ QRACs are still lacking. Here, we present a general method to find the maximum success probability of ${n}^{(d)}\ensuremath{\rightarrow}1$ QRACs. In particular, we give the analytical solution for maximum success probability of ${3}^{(d)}\ensuremath{\rightarrow}1$ QRACs when measurement bases are mutually unbiased bases (MUBs). Based on the analytical solution, we show the relationship between MUBs and ${n}^{(d)}\ensuremath{\rightarrow}1$ QRACs. First, we provide a systematic method of searching for the operational inequivalence of MUBs (OI-MUBs) when the dimension ddd is a prime power. Second, we theoretically prove that, surprisingly, the commonly used Galois MUBs are not the optimal measurement bases to obtain the maximum success probability of ${n}^{(d)}\ensuremath{\rightarrow}1$ QRACs, which indicates a breakthrough according to the traditional conjecture regarding the optimal measurement bases. Furthermore, based on high-fidelity high-dimensional quantum states of orbital angular momentum, we experimentally achieve two-input and three-input QRACs up to dimension 11. We experimentally confirm the OI-MUBs when d=5d=5d=5. Our results open alternative avenues for investigating the foundational properties of quantum mechanics and quantum network coding.
Quantum measurements based on mutually unbiased bases are commonly used in quantum information processing, as they are generally viewed as being maximally incompatible and complementary. Here we quantify precisely the degree of incompatibility of mutually unbiased bases (MUB) using the notion of noise robustness. Specifically, for sets of k MUB in dimension d, we provide upper and lower bounds on this quantity. Notably, we get a tight bound in several cases, in particular for complete sets of k=d+1 MUB (using the standard construction for d being a prime power). On the way, we also derive a general upper bound on the noise robustness for an arbitrary set of quantum measurements. Moreover, we prove the existence of sets of k MUB that are operationally inequivalent, as they feature different noise robustness, and we provide a lower bound on the number of such inequivalent sets up to dimension 32. Finally, we discuss applications of our results for Einstein-Podolsky-Rosen steering.
Mutually Unbiased bases has various application in quantum information procession and coding theory. There can be maximum d + 1 MUBs in C^d and d/2 +1 MUBs in R^d. But , over R^d MUBs are known to be non existent when d is odd and for most of the other even d there are mostly 3 Real MUBs. In case of C^d the construction for complete set of MUBs are known for only Prime Power dimension. Thus in general large set of MUBs are not known, particularly for composite dimensions which are not of the form of prime powers. Because of this, there are many constructions of Approximate version of MUBs. In this paper we make an attempt to define certain measures to characterise the AMUBs. Our construction of measures derives its inspiration from the applications of MUBs, and based on them, we define certain quantifiable measures, which are can be computed and gives estimates of how close the Approximate MUBs are to the MUBs. We use geometric interpretation, projective design features of MUBs and applications like Optimal State determination and Entropic Uncertainty of MUBs. We show generic relationship between these measures and show that it can be evaluated for APMUBs without known the exact construction details, thereby showing that definition of APMUB is sufficient completely characterise it. We also evaluate these measure for an interesting class of AMUBs called Weak MUBs and certain AMUBs constructed using RBDs.