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

Journal of Modern Optics

Encoding and decoding in complementary bases with quantum gates

Časlav Brukner, Anton Zeilinger

Published Oct 1, 2000• 7 citations
Publisher

Abstract

The total information content of a composite system consisting of k qubits can either be completely encoded in a specific computational basis, or alternatively it can be partially encoded in a number of different bases. In that case the information encoded in a complete set of mutually complementary bases is again k bits. Using only two single-qubit gates and the controlled-NOT gate, one can implement coding and decoding in such a complete set. The total information content is then invariant under the particular choice of a complete set of mutually complementary bases. For maximally entangled states the k bits of information are not encoded into the k qubits separately but only into their joint properties.

DOI
10.1080/09500340008235145

Related papers

Quantum information processing

Stephen Mark Barnett

We have seen how information can be encoded onto a quantum system by selecting the state in which it is prepared. Retrieving the information is achieved by performing a measurement, and the optimal measurement in any given situation is usually a generalized measurement. In between preparation and measurement, the information resides in the quantum state of the system, which evolves in a manner determined by the Hamiltonian. The associated unitary transformation may usefully be viewed as quantum information processing; if we can engineer an appropriate Hamiltonian then we can use the quantum evolution to assist in performing computational tasks. Our objective in quantum information processing is to implement a desired unitary transformation. Typically this will mean coupling together a number, perhaps a large number, of qubits and thereby generating highly entangled states. It is fortunate, although by no means obvious, that we can realize any desired multiqubit unitary transformation as a product of a small selection of simple transformations and, moreover, that each of these need only act on a single qubit or on a pair of qubits. The situation is reminiscent of digital electronics, in which logic operations are decomposed into actions on a small number of bits. If we can realize and control a very large number of such operations in a single device then we have a computer. Similar control of a large number of qubits will constitute a quantum computer. It is the revolutionary potential of quantum computers, more than any other single factor, that has fuelled the recent explosion of interest in our subject. We shall examine the remarkable properties of quantum computers in the next chapter. In digital electronics, we represent bit values by voltages: the logical value 1 is a high voltage (typically +5 V) and 0 is the ground voltage (0 V). The voltage bits are coupled and manipulated by transistor-based devices, or gates. The simplest gates act on only one bit or combine two bits to generate a single new bit, the value of which is determined by the two input bits. For a single bit, with value 0 or 1, the only possible operations are the identity (which does not require a gate) and the bit flip.

Oxford University Press eBooks•May 28, 2009•11 citations

Quantum bits and quantum gates

Joachim Stolze, Dieter Suter

This chapter contains sections titled: Single-qubit gates Two-qubit gates Universal sets of gates

Wiley eBooks•May 26, 2004•0 citations

Mutually unbiased bases and trinary operator sets for N qutrits

Jay Lawrence

A compete orthonormal basis of $N$-qutrit unitary operators drawn from the Pauli group consists of the identity and ${9}^{N}\ensuremath{-}1$ traceless operators. The traceless ones partition into ${3}^{N}+1$ maximally commuting subsets (MCS's) of ${3}^{N}\ensuremath{-}1$ operators each, whose joint eigenbases are mutually unbiased. We prove that Pauli factor groups of order ${3}^{N}$ are isomorphic to all MCS's and show how this result applies in specific cases. For two qutrits, the 80 traceless operators partition into 10 MCS's. We prove that 4 of the corresponding basis sets must be separable, while 6 must be totally entangled (and Bell-like). For three qutrits, 728 operators partition into 28 MCS's with less rigid structure, allowing for the coexistence of separable, partially entangled, and totally entangled (GHZ-like) bases. However a minimum of $16\phantom{\rule{0.3em}{0ex}}\mathrm{GHZ}$-like bases must occur. Every basis state is described by an $N$-digit trinary number consisting of the eigenvalues of $N$ observables constructed from the corresponding MCS.

arXiv:quant-ph/0403095•Physical Review A•Jul 2, 2004•49 citations

Mutually complementary and compatible binary measurements on N qubits

W. E. Lawrence, Časlav Brukner, Anton Zeilinger

We define mutually complementary observable sets for N qubits via the operational requirement that a state with a definite outcome for one set of (commuting) binary observables must give completely random results in all other sets. The bases formed by the eigenvectors of such complementary sets are mutually unbiased. We prove that the full set of 4^N-1 Pauli operator products may be partitioned into 2^N+1 distinct sets, each set consisting of 2^N-1 internally commuting observables. Furthermore we prove that each such partitioning defines a unique choice of 2^N+1 mutually unbiased bases. Examples for 2 and 3 qubit systems are discussed with emphasis on the nature and amount of entanglement that occurs within these basis sets.

•Apr 2, 2001•2 citations

General Quantum Protocol for Communication via nnn--Qubit GHZ States

Saba Arife Bozpolat

This study presents a generalized $n$--bit superdense coding protocol that enables the transmission of n classical bits of information using an entangled $n$--qubit quantum system and the transmission of $n-1$ qubits. The protocol involves creating a maximally entangled $n$--qubit GHZ state, encoding the classical message with Pauli--Z and Pauli--X gates, and then transmitting and decoding the message via quantum communication, quantum operations, and measurements. The key novelty of this work is an explicit, scalable $n$--bit encoding routine, realized on the GHZ channel with a low--depth encoding layer using only single--qubit Pauli--X and Pauli--Z operations. The protocol was tested on real quantum hardware using Qiskit 2.0 and the IBM--Fez quantum computer for message lengths of 4, 6, 8, and 10 bits, as a circuit--level proof of concept on a single processor; the physical transmission of qubits between the parties was not implemented. Results show that success rates decrease as message length, transpiled circuit depth and gate count increase; the latter two are set mainly by transpilation rather than by the encoding itself. A mutual information analysis shows that the transmitted information exceeds the classical bound of $n-1$ bits only for short messages. Strategies to improve performance include sending messages in shorter segments and advances in qubit coherence and gate fidelity. This work offers a practical and easily scalable quantum communication protocol with potential applications in quantum networks and communication systems.

quant-pharXiv:2512.14280•Dec 17, 2025•1 citation

Efficient Decomposition of Quantum Gates

Juha J. Vartiainen, Mikko Möttönen, Martti M. Salomaa

Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit which is optimal in the sense of fully controlled single-qubit gates and yet is equivalent with the multiqubit gate. In the second step of the optimization, superfluous control bits are eliminated, which eventually results in a smaller total number of the elementary gates. In our scheme the number of controlled NOT gates is O(4(n)) which coincides with the theoretical lower bound.

arXiv:quant-ph/0312218•Physical Review Letters•Apr 29, 2004•256 citations
The total information content of a composite system consisting of k qubits can either be completely encoded in a specific computational basis, or alternatively it can be partially encoded in a number of different bases. In that case the information encoded in a complete set of mutually complementary bases is again k bits. Using only two single-qubit gates and the controlled-NOT gate, one can implement coding and decoding in such a complete set. The total information content is then invariant under the particular choice of a complete set of mutually complementary bases. For maximally entangled states the k bits of information are not encoded into the k qubits separately but only into their joint properties.
We have seen how information can be encoded onto a quantum system by selecting the state in which it is prepared. Retrieving the information is achieved by performing a measurement, and the optimal measurement in any given situation is usually a generalized measurement. In between preparation and measurement, the information resides in the quantum state of the system, which evolves in a manner determined by the Hamiltonian. The associated unitary transformation may usefully be viewed as quantum information processing; if we can engineer an appropriate Hamiltonian then we can use the quantum evolution to assist in performing computational tasks. Our objective in quantum information processing is to implement a desired unitary transformation. Typically this will mean coupling together a number, perhaps a large number, of qubits and thereby generating highly entangled states. It is fortunate, although by no means obvious, that we can realize any desired multiqubit unitary transformation as a product of a small selection of simple transformations and, moreover, that each of these need only act on a single qubit or on a pair of qubits. The situation is reminiscent of digital electronics, in which logic operations are decomposed into actions on a small number of bits. If we can realize and control a very large number of such operations in a single device then we have a computer. Similar control of a large number of qubits will constitute a quantum computer. It is the revolutionary potential of quantum computers, more than any other single factor, that has fuelled the recent explosion of interest in our subject. We shall examine the remarkable properties of quantum computers in the next chapter. In digital electronics, we represent bit values by voltages: the logical value 1 is a high voltage (typically +5 V) and 0 is the ground voltage (0 V). The voltage bits are coupled and manipulated by transistor-based devices, or gates. The simplest gates act on only one bit or combine two bits to generate a single new bit, the value of which is determined by the two input bits. For a single bit, with value 0 or 1, the only possible operations are the identity (which does not require a gate) and the bit flip.
A compete orthonormal basis of NNN-qutrit unitary operators drawn from the Pauli group consists of the identity and ${9}^{N}\ensuremath{-}1$ traceless operators. The traceless ones partition into 3N+1{3}^{N}+13N+1 maximally commuting subsets (MCS's) of ${3}^{N}\ensuremath{-}1$ operators each, whose joint eigenbases are mutually unbiased. We prove that Pauli factor groups of order 3N{3}^{N}3N are isomorphic to all MCS's and show how this result applies in specific cases. For two qutrits, the 80 traceless operators partition into 10 MCS's. We prove that 4 of the corresponding basis sets must be separable, while 6 must be totally entangled (and Bell-like). For three qutrits, 728 operators partition into 28 MCS's with less rigid structure, allowing for the coexistence of separable, partially entangled, and totally entangled (GHZ-like) bases. However a minimum of 16GHZ16\phantom{\rule{0.3em}{0ex}}\mathrm{GHZ}16GHZ-like bases must occur. Every basis state is described by an NNN-digit trinary number consisting of the eigenvalues of NNN observables constructed from the corresponding MCS.
We define mutually complementary observable sets for N qubits via the operational requirement that a state with a definite outcome for one set of (commuting) binary observables must give completely random results in all other sets. The bases formed by the eigenvectors of such complementary sets are mutually unbiased. We prove that the full set of 4^N-1 Pauli operator products may be partitioned into 2^N+1 distinct sets, each set consisting of 2^N-1 internally commuting observables. Furthermore we prove that each such partitioning defines a unique choice of 2^N+1 mutually unbiased bases. Examples for 2 and 3 qubit systems are discussed with emphasis on the nature and amount of entanglement that occurs within these basis sets.
This study presents a generalized nnn--bit superdense coding protocol that enables the transmission of n classical bits of information using an entangled nnn--qubit quantum system and the transmission of n−1n-1n−1 qubits. The protocol involves creating a maximally entangled nnn--qubit GHZ state, encoding the classical message with Pauli--Z and Pauli--X gates, and then transmitting and decoding the message via quantum communication, quantum operations, and measurements. The key novelty of this work is an explicit, scalable nnn--bit encoding routine, realized on the GHZ channel with a low--depth encoding layer using only single--qubit Pauli--X and Pauli--Z operations. The protocol was tested on real quantum hardware using Qiskit 2.0 and the IBM--Fez quantum computer for message lengths of 4, 6, 8, and 10 bits, as a circuit--level proof of concept on a single processor; the physical transmission of qubits between the parties was not implemented. Results show that success rates decrease as message length, transpiled circuit depth and gate count increase; the latter two are set mainly by transpilation rather than by the encoding itself. A mutual information analysis shows that the transmitted information exceeds the classical bound of n−1n-1n−1 bits only for short messages. Strategies to improve performance include sending messages in shorter segments and advances in qubit coherence and gate fidelity. This work offers a practical and easily scalable quantum communication protocol with potential applications in quantum networks and communication systems.
Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit which is optimal in the sense of fully controlled single-qubit gates and yet is equivalent with the multiqubit gate. In the second step of the optimization, superfluous control bits are eliminated, which eventually results in a smaller total number of the elementary gates. In our scheme the number of controlled NOT gates is O(4(n)) which coincides with the theoretical lower bound.