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:2311.11698

An Efficient Quantum Circuit Construction Method for Mutually Unbiased Bases in $n$-Qubit Systems

Wang Yu, Dongsheng Wu

Published Nov 20, 2023• 8 citations
arXivHTMLPDF

Abstract

Mutually unbiased bases (MUBs) play a crucial role in numerous applications within quantum information science, such as quantum state tomography, error correction, entanglement detection, and quantum cryptography. Utilizing \(2^n + 1\) MUB circuits provides a minimal and optimal measurement strategy for reconstructing all \(n\)-qubit unknown states. It significantly reduces the number of measurements compared to the traditional \(4^n\) Pauli observables, also enhancing the robustness of quantum key distribution (QKD) protocols. Previous circuit designs that rely on a single generator can result in exponential gate costs for some MUB circuits. In this work, we present an efficient algorithm to generate each of the \(2^n + 1\) quantum MUB circuits on \(n\)-qubit systems within \(O(n^3)\) time. The algorithm features a three-stage structure, and we have calculated the average number of different gates for random sampling. Additionally, we have identified two linear properties: the entanglement part can be directly defined into \(2n - 3\) fixed sub-parts, and the knowledge of \(n\) special MUB circuits is sufficient to construct all \(2^n + 1\) MUB circuits. This new efficient and simple circuit construction paves the way for the implementation of a complete set of MUBs in diverse quantum information processing tasks on high-dimensional quantum systems.

DOI
10.48550/arxiv.2311.11698

Related papers

Practical implementation of mutually unbiased bases using quantum circuits

Ulrich Seyfarth, Luis Lorenzo Sánchez-Soto, Gerd Leuchs

The number of measurements necessary to perform the quantum state reconstruction of a system of qubits grows exponentially with the number of constituents, creating a major obstacle for the design of scalable tomographic schemes. We work out a simple and efficient method based on cyclic generation of mutually unbiased bases. The basic generator requires only Hadamard and controlled-phase gates, which are available in most practical realizations of these systems. We show how complete sets of mutually unbiased bases with different entanglement structures can be realized for three and four qubits. We also analyze the quantum circuits implementing the various entanglement classes.

arXiv:1412.4358•Physical Review A•Mar 2, 2015•2 citations

Characterization of High-Dimensional Entangled Systems via Mutually Unbiased Measurements

Daniel Giovannini, Jacquiline Romero, Jonathan Leach +3 more

Mutually unbiased bases (MUBs) play a key role in many protocols in quantum science, such as quantum key distribution. However, defining MUBs for arbitrary high-dimensional systems is theoretically difficult, and measurements in such bases can be hard to implement. We show experimentally that efficient quantum state reconstruction of a high-dimensional multipartite quantum system can be performed by considering only the MUBs of the individual parts. The state spaces of the individual subsystems are always smaller than the state space of the composite system. Thus, the benefit of this method is that MUBs need to be defined for the small Hilbert spaces of the subsystems rather than for the large space of the overall system. This becomes especially relevant where the definition or measurement of MUBs for the overall system is challenging. We illustrate this approach by implementing measurements for a high-dimensional system consisting of two photons entangled in the orbital angular momentum degree of freedom, and we reconstruct the state of this system for dimensions of the individual photons from d = 2 to 5.

arXiv:1212.5825•Physical Review Letters•Apr 2, 2013•111 citations

Classical shadow tomography with mutually unbiased bases

Yu Wang, Wei Cui

Classical shadow tomography, harnessing randomized informationally complete (IC) measurements, provides an effective avenue for predicting many properties of unknown quantum states. In $n$-qubit systems, projections onto ${2}^{n}+1$ mutually unbiased bases (MUBs) are widely recognized as minimal and optimal IC measurements for full-state tomography. Mutually unbiased base circuits, structured as $\text{\ensuremath{-}}\mathrm{CZ}\text{\ensuremath{-}}S\text{\ensuremath{-}}H\text{\ensuremath{-}}$, form the minimal subset of the whole ${2}^{{n}^{2}+2n}{\ensuremath{\prod}}_{j=1}^{n}({4}^{j}\ensuremath{-}1)$ Clifford circuit ensemble. Each of them can be generated by $n$ special MUB circuits. We study how to use MUB circuits as the ensemble in classical shadow tomography. For general observables, the variance to predict their expectation value is shown to be exponential to the number of qubits $n$. However, for a special class referred to as appropriate MUB-average (AMA) observables, the variance decreases to $\text{poly}(n)$. Additionally, we find that through biased sampling of MUB circuits, the variance for non-AMA observables can again be reduced to $\text{poly}(n)$ with the MUB-sparse condition. The performance and complexity of using the MUB and Clifford circuits as the ensemble in the classical shadow tomography are compared.

arXiv:2310.09644•Physical Review A•Jun 3, 2024•12 citations

Minimal-Clifford shadow estimation by mutually unbiased bases

Qingyue Zhang, Qing Liu, You Zhou

Predicting properties of large-scale quantum systems is crucial for the development of quantum science and technology. Shadow estimation is an efficient method for this task based on randomized measurements, where many-qubit random Clifford circuits are used for estimating global properties like quantum fidelity. Here we introduce the minimal Clifford measurement (MCM) to reduce the number of possible random circuits to the minimum, while keeping the effective postprocessing channel in shadow estimation. In particular, we show that MCM requires ${2}^{n}+1$ distinct Clifford circuits, and it can be realized by mutually unbiased bases, with $n$ as the total qubit number. By applying the $Z$-tableau formalism, this ensemble of circuits can be synthesized to the $\ensuremath{-}\mathrm{S}\ensuremath{-}\mathrm{CZ}\ensuremath{-}\mathrm{H}\ensuremath{-}$ structure, which can be decomposed to $2n\ensuremath{-}1$ fixed circuit modules, and the total circuit depth is at most $n+1$. Compared to the original Clifford measurements, our MCM reduces the circuit complexity and the compilation costs. In addition, we find the sampling advantage of MCM on estimating off-diagonal operators, and extend this observation to the biased-MCM scheme to enhance the sampling improvement further.

arXiv:2310.18749•Physical Review Applied•Jun 3, 2024•14 citations

Construction of mutually unbiased bases with cyclic symmetry for qubit systems

Ulrich Seyfarth, Kedar S. Ranade

For the complete estimation of arbitrary unknown quantum states by measurements, the use of mutually unbiased bases has been well established in theory and experiment for the past 20 years. However, most constructions of these bases make heavy use of abstract algebra and the mathematical theory of finite rings and fields, and no simple and generally accessible construction is available. This is particularly true in the case of a system composed of several qubits, which is arguably the most important case in quantum information science and quantum computation. In this paper, we close this gap by providing a simple and straightforward method for the construction of mutually unbiased bases in the case of a qubit register. We show that our construction is also accessible to experiments, since only Hadamard and controlled-phase gates are needed, which are available in most practical realizations of a quantum computer. Moreover, our scheme possesses the optimal scaling possible, i.e., the number of gates scales only linearly in the number of qubits.

arXiv:1106.3515•Physical Review A•Oct 17, 2011•20 citations

How many mutually unbiased bases are needed to detect bound entangled states?

Joonwoo Bae, Anindita Bera, Dariusz Chruściński +2 more

Abstract From a practical perspective it is advantageous to develop methods that verify entanglement in quantum states with as few measurements as possible. In this paper we investigate the minimal number of mutually unbiased bases (MUBs) needed to detect bound entanglement in bipartite ( d × d ) -dimensional states, i.e. entangled states that are positive under partial transposition. In particular, we show that a class of entanglement witnesses (EWs) composed of MUBs can detect bound entanglement if the number of measurements is greater than d / 2 + 1 . This is a substantial improvement over other detection methods, requiring significantly fewer resources than either full quantum state tomography or measuring a complete set of d + 1 MUBs. Our approach is based on a partial characterisation of the (non-)decomposability of EWs. We show that non-decomposability is a universal property of MUBs, which holds regardless of the choice of complementary observables, and we find that both the number of measurements and the structure of the witness play an important role in the detection of bound entanglement.

arXiv:2108.01109•Journal of Physics A Mathematical and Theoretical•Dec 8, 2022•24 citations
An Efficient Quantum Circuit Construction Method for Mutually Unbiased Bases in nnn-Qubit Systems
Mutually unbiased bases (MUBs) play a crucial role in numerous applications within quantum information science, such as quantum state tomography, error correction, entanglement detection, and quantum cryptography. Utilizing (2^n + 1) MUB circuits provides a minimal and optimal measurement strategy for reconstructing all (n)-qubit unknown states. It significantly reduces the number of measurements compared to the traditional (4^n) Pauli observables, also enhancing the robustness of quantum key distribution (QKD) protocols. Previous circuit designs that rely on a single generator can result in exponential gate costs for some MUB circuits. In this work, we present an efficient algorithm to generate each of the (2^n + 1) quantum MUB circuits on (n)-qubit systems within (O(n^3)) time. The algorithm features a three-stage structure, and we have calculated the average number of different gates for random sampling. Additionally, we have identified two linear properties: the entanglement part can be directly defined into (2n - 3) fixed sub-parts, and the knowledge of (n) special MUB circuits is sufficient to construct all (2^n + 1) MUB circuits. This new efficient and simple circuit construction paves the way for the implementation of a complete set of MUBs in diverse quantum information processing tasks on high-dimensional quantum systems.
The number of measurements necessary to perform the quantum state reconstruction of a system of qubits grows exponentially with the number of constituents, creating a major obstacle for the design of scalable tomographic schemes. We work out a simple and efficient method based on cyclic generation of mutually unbiased bases. The basic generator requires only Hadamard and controlled-phase gates, which are available in most practical realizations of these systems. We show how complete sets of mutually unbiased bases with different entanglement structures can be realized for three and four qubits. We also analyze the quantum circuits implementing the various entanglement classes.
Mutually unbiased bases (MUBs) play a key role in many protocols in quantum science, such as quantum key distribution. However, defining MUBs for arbitrary high-dimensional systems is theoretically difficult, and measurements in such bases can be hard to implement. We show experimentally that efficient quantum state reconstruction of a high-dimensional multipartite quantum system can be performed by considering only the MUBs of the individual parts. The state spaces of the individual subsystems are always smaller than the state space of the composite system. Thus, the benefit of this method is that MUBs need to be defined for the small Hilbert spaces of the subsystems rather than for the large space of the overall system. This becomes especially relevant where the definition or measurement of MUBs for the overall system is challenging. We illustrate this approach by implementing measurements for a high-dimensional system consisting of two photons entangled in the orbital angular momentum degree of freedom, and we reconstruct the state of this system for dimensions of the individual photons from d = 2 to 5.
Classical shadow tomography, harnessing randomized informationally complete (IC) measurements, provides an effective avenue for predicting many properties of unknown quantum states. In nnn-qubit systems, projections onto 2n+1{2}^{n}+12n+1 mutually unbiased bases (MUBs) are widely recognized as minimal and optimal IC measurements for full-state tomography. Mutually unbiased base circuits, structured as $\text{\ensuremath{-}}\mathrm{CZ}\text{\ensuremath{-}}S\text{\ensuremath{-}}H\text{\ensuremath{-}}$, form the minimal subset of the whole ${2}^{{n}^{2}+2n}{\ensuremath{\prod}}_{j=1}^{n}({4}^{j}\ensuremath{-}1)$ Clifford circuit ensemble. Each of them can be generated by nnn special MUB circuits. We study how to use MUB circuits as the ensemble in classical shadow tomography. For general observables, the variance to predict their expectation value is shown to be exponential to the number of qubits nnn. However, for a special class referred to as appropriate MUB-average (AMA) observables, the variance decreases to poly(n)\text{poly}(n)poly(n). Additionally, we find that through biased sampling of MUB circuits, the variance for non-AMA observables can again be reduced to poly(n)\text{poly}(n)poly(n) with the MUB-sparse condition. The performance and complexity of using the MUB and Clifford circuits as the ensemble in the classical shadow tomography are compared.
Predicting properties of large-scale quantum systems is crucial for the development of quantum science and technology. Shadow estimation is an efficient method for this task based on randomized measurements, where many-qubit random Clifford circuits are used for estimating global properties like quantum fidelity. Here we introduce the minimal Clifford measurement (MCM) to reduce the number of possible random circuits to the minimum, while keeping the effective postprocessing channel in shadow estimation. In particular, we show that MCM requires 2n+1{2}^{n}+12n+1 distinct Clifford circuits, and it can be realized by mutually unbiased bases, with nnn as the total qubit number. By applying the ZZZ-tableau formalism, this ensemble of circuits can be synthesized to the $\ensuremath{-}\mathrm{S}\ensuremath{-}\mathrm{CZ}\ensuremath{-}\mathrm{H}\ensuremath{-}$ structure, which can be decomposed to $2n\ensuremath{-}1$ fixed circuit modules, and the total circuit depth is at most n+1n+1n+1. Compared to the original Clifford measurements, our MCM reduces the circuit complexity and the compilation costs. In addition, we find the sampling advantage of MCM on estimating off-diagonal operators, and extend this observation to the biased-MCM scheme to enhance the sampling improvement further.
For the complete estimation of arbitrary unknown quantum states by measurements, the use of mutually unbiased bases has been well established in theory and experiment for the past 20 years. However, most constructions of these bases make heavy use of abstract algebra and the mathematical theory of finite rings and fields, and no simple and generally accessible construction is available. This is particularly true in the case of a system composed of several qubits, which is arguably the most important case in quantum information science and quantum computation. In this paper, we close this gap by providing a simple and straightforward method for the construction of mutually unbiased bases in the case of a qubit register. We show that our construction is also accessible to experiments, since only Hadamard and controlled-phase gates are needed, which are available in most practical realizations of a quantum computer. Moreover, our scheme possesses the optimal scaling possible, i.e., the number of gates scales only linearly in the number of qubits.
Abstract From a practical perspective it is advantageous to develop methods that verify entanglement in quantum states with as few measurements as possible. In this paper we investigate the minimal number of mutually unbiased bases (MUBs) needed to detect bound entanglement in bipartite ( d × d ) -dimensional states, i.e. entangled states that are positive under partial transposition. In particular, we show that a class of entanglement witnesses (EWs) composed of MUBs can detect bound entanglement if the number of measurements is greater than d / 2 + 1 . This is a substantial improvement over other detection methods, requiring significantly fewer resources than either full quantum state tomography or measuring a complete set of d + 1 MUBs. Our approach is based on a partial characterisation of the (non-)decomposability of EWs. We show that non-decomposability is a universal property of MUBs, which holds regardless of the choice of complementary observables, and we find that both the number of measurements and the structure of the witness play an important role in the detection of bound entanglement.