Connections Between Mutually Unbiased Bases and Quantum Random Access Codes
arXiv:1709.04898 · doi:10.1103/PhysRevLett.121.050501
Abstract
We present a new quantum communication complexity protocol, the promise--Quantum Random Access Code, which allows us to introduce a new measure of unbiasedness for bases of Hilbert spaces. The proposed measure possesses a clear operational meaning and can be used to investigate whether a specific number of mutually unbiased bases exist in a given dimension by employing Semi--Definite Programming techniques.
5+5 pages; new SDP method added
References in corpus (13)
- On mutually unbiased bases
- Almost quantum correlations
- Maximal violation of the I3322 inequality using infinite dimensional quantum systems
- On SIC-POVMs and MUBs in Dimension 6
- Quantum Random Access Codes using Single -level Systems
- Mubs and Hadamards of Order Six
- Bounding the set of finite dimensional quantum correlations
- Self-testing mutually unbiased bases in the prepare-and-measure scenario
- A generalized Pauli problem and an infinite family of MUB-triplets in dimension 6
- Mutually unbiased bases in dimension six: The four most distant bases
- Numerical evidence for the maximum number of mutually unbiased bases in dimension six
- Characterizing finite-dimensional quantum behavior
- Mutually Unbiased Bases and Semi-definite Programming
Cited by in corpus (33)
- Self-testing mutually unbiased bases in the prepare-and-measure scenario
- Mutually unbiased bases and symmetric informationally complete measurements in Bell experiments
- Kirkwood-Dirac nonclassicality, support uncertainty and complete incompatibility
- Enabling computation of correlation bounds for finite-dimensional quantum systems via symmetrisation
- Semidefinite programming relaxations for quantum correlations
- Quantum random access codes and incompatibility of measurements
- Entanglement in prepare-and-measure scenarios: many questions, a few answers
- Semi-definite programming and quantum information
- Quantum Advantage in Information Retrieval
- Detecting Entanglement can be More Effective with Inequivalent Mutually Unbiased Bases
- Quantum-Inspired Hierarchy for Rank-Constrained Optimization
- How many mutually unbiased bases are needed to detect bound entangled states?
- Complete hierarchy for high-dimensional steering certification
- Operational foundations of complementarity and uncertainty relations
- Device independent witness of arbitrary dimensional quantum systems employing binary outcome measurements
- Adaptive advantage in entanglement-assisted communications
- Three numerical approaches to find mutually unbiased bases using Bell inequalities
- Unbounded quantum advantage in communication complexity measured by distinguishability
- A general bound for the dimension of quantum behaviours in the prepare-and-measure scenario
- Quantum Random Access Code in Noisy Channels
- Simple and general bounds on quantum random access codes
- Random access test as an identifier of nonclassicality
- A new break near 10 TeV in the energy spectrum of protons according to data from space-based instruments: astrophysical interpretation
- Multiparty quantum random access codes
- Robust certification of quantum instruments through a sequential communication game
- Choice of mutually unbiased bases and outcome labelling affects measurement outcome secrecy
- Mutually unbiased bases: polynomial optimization and symmetry
- Quantum Random Access Codes Implementation for Resource Allocation and Coexistence with Classical Telecommunication
- Limits of Classical correlations and Quantum advantages under (Anti-)Distinguishability constraints in Multipartite Communication
- Designing generalized elegant Bell inequalities in higher dimensions from a Tsirelson bound
- Quantifying incompatibility of quantum measurements through non-commutativity
- The Interplay between Quantum Contextuality and Wigner Negativity
- High-dimensional multi-input quantum random access codes and mutually unbiased bases