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

AIP conference proceedings

Symmetry considerations in quantum computing

A. Nepomuk Otte

Published Jan 1, 2000• 0 citations
Publisher

Abstract

A quantum computer is, if realized, the ultimate machine for completely controlling a quantum-mechanical system. This control enables one to prepare any arbitrary state of the Hilbert space and to determine by will its time evolution. From this point of view, the realization of quantum states with unusual symmetries seems to be possible by the use of such quantum information processing devices. On the other hand, symmetry arguments can be used to gain more insight in such a quantum network consisting of identical qubits and they can even further lead to error prevention codes by identifying decoherence free subspaces. By introducing a collective operator description for quantum networks, we show how to describe ensemble systems using a reduced set of parameters. Further we want to point out some connections between quantum computers and symmetry considerations.

DOI
10.1063/1.1337719

Related papers

Prospects and challenges for the realization of quantum computers

Eric Donkor, Patrick D. Kumavor

A quantum computer is an information processing systems that utilizes invertible logic elements to perform reversible logic operations. It can also perform irreversible logic operations. Thus, in principle, it can compute the information transformation rule of any physical system for which the rules are known. A quantum computer can be designed to perform parallel computation on a massive scale, and therefore can have fast execution time. The basic structure of a quantum computer includes 1) a quantum register, or a configuration of quantum-mechanical energy states to store quantum bits (qubits) of information, 2) a quantum processor designed to induce quantum mechanical interactions between any arbitrary pair of qubits to perform a specified logic operations. 3) a quantum bus or network for transferring qubits from the registers to the processor and vice versa, and 4) a physical mechanisms for non-destructive measurements on the qubits. Quantum mechanical systems with the potential for realizing quantum computers include ion-trap quantum computers, cavity quantum electrodynamics quantum computers, photon-trap quantum computers, nuclear magnetic resonance quantum computers, and superconducting quantum computers. Decoherence [1 ,2] possesses the greatest challenge to the practical realization of quantum computers, because it causes the collapse of the quantum superposition states that contain the vital results of qubit manipulations. Decoherence processes are measurement-induced, noise-induced, and environment-induced [3] . Schemes to correct or circumvent the detrimental effects of decoherence in quantum processors fall into active error-correction schemes, and passive error-correction schemes [4]. Active error-correction schemes are designed to detect and correct for errors during computation. Algorithmic fault-tolerant computing [5, 6] is the most promising active-error correction scheme. In fault-tolerant computing, ancillary qubits are encoded into data blocks of the quantum registers. They are then used to detect errors. Once detected appropriate error-correction algorithms are then employed to rectify the errors. The implementation of fault-tolerant quantum computing has been hampered by the lack of practical universal set of quantum gates that can process an encoded data without propagating or introducing additional errors. Passive-error correction schemes [7] attempt to finding Hilbert subspaces that are intrinsically free of decoherence effects [8]. The key to quantum computing in such a decoherence-free subspace is the identification of mechanisms that can effect quantum mechanical interactions between the decoherence-free states without taking the system out of the decoherence-free environment. The challenge is to identify and employ physical processes that can achieve these goals.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 31, 2002•2 citations

Decoherence, Control, and Symmetry in Quantum Computers

Dave Bacon

In this thesis we describe methods for avoiding the detrimental effects of decoherence while at the same time still allowing for computation of the quantum information. The philosophy of the method discussed in the first part of this thesis is to use a symmetry of the decoherence mechanism to find robust encodings of the quantum information. Stability, control, and methods for using decoherence-free information in a quantum computer are presented with a specific emphasis on decoherence due to a collective coupling between the system and its environment. Universal quantum computation on such collective decoherence decoherence-free encodings is demonstrated. Rigorous definitions of control and the use of encoded universality in quantum computers are addressed. Explicit gate constructions for encoded universality on ion trap and exchange based quantum computers are given. In the second part of the thesis we examine physical systems with error correcting properties. We examine systems that can store quantum information in their ground state such that decoherence processes are prohibited via energetics. We present the theory of supercoherent systems whose ground states are quantum error detecting codes and describe a spin ladder whose ground state has both the error detecting and correcting properties. We conclude by discussing naturally fault-tolerant quantum computation.

arXiv:quant-ph/0305025•May 5, 2003•55 citations

Symmetry breaking/symmetry preserving circuits and symmetry restoration on quantum computers: A quantum many-body perspective

Denis Lacroix A, Edgar Andres Ruiz Guzman, Pooja Siwach

We discuss here some aspects related to the symmetries of a quantum many-body problem when trying to treat it on a quantum computer. Several features related to symmetry conservation, symmetry breaking, and possible symmetry restoration are reviewed. After briefly discussing some of the standard symmetries relevant for many-particle systems, we discuss the advantage of encoding some symmetries directly in quantum ansätze, especially to reduce the quantum register size. It is, however, well-known that the use of symmetry-breaking states can also be a unique way to incorporate specific internal correlations when a spontaneous symmetry breaking occurs. These aspects are discussed in the quantum computing context. Ultimately, an accurate description of quantum systems can be achieved only when the initially broken symmetries are properly restored. We review several methods explored previously to perform symmetry restoration on a quantum computer, for instance, the ones based on symmetry filtering by quantum phase estimation and by an iterative independent set of Hadamard tests. We propose novel methods that pave the new directions to perform symmetry restoration, like those based on the purification of the state employing the linear combination of unitaries (LCU) approach.

arXiv:2208.11567•Aug 24, 2022•7 citations

Efficient preparation of decoherence-free subspace basis states

Zi-Ming Li, Yu-xi Liu

Decoherence-free subspace (DFS) provides a crucial mechanism for passive error mitigation in quantum computation by encoding information within symmetry-protected subspaces of the Hilbert space, which are immune from collective decoherence. Constructing a complete set of orthogonal basis states for the DFS is essential to realize fault-tolerant quantum computation by using the DFS codes. However, existing methods for preparing these basis states are often non-scalable, platform-specific, or yield mixed states. Here, we propose a deterministic approach to prepare pure, orthogonal and complete DFS basis states for systems of arbitrary size composed of qubits. Our method employs projective measurements and quantum circuits with single-qubit, two-qubit and Toffoli gates. We provide a rigorous resource cost analysis both mathematically and numerically. Meanwhile, we demonstrate the realizability of our method on NISQ devices by discussing how to implement our method on a superconducting chip. The proposed method offers a universal solution for preparing the DFS basis states across diverse quantum computing platforms and system sizes, which is realizable in the NISQ era.

arXiv:2509.11544•Physical Review A•Dec 9, 2025•0 citations

Quantum Computing Systems: A Brief Overview

Waranont Anukool, Jongseok Lim, Yunheung Song +1 more

A classical simulation of quantum systems demands enormous computational resources. The dimension of underlying Hilbert space scales exponentially with the number of participating elements ( N ), requiring a 2 2N size of calculation matrix for a unitary operation, for example, 2 100 ≈ 10 30 for only N = 50. With the increase of N , the first obstacle to encounter is in fact the deficiency of computer memories. A straightforward resolution is to use a quantum computer, a calculating device that operates with the principle of quantum mechanics. During the last twenty years, quantum computing once considered as theoretical exercise has become an important field of research in modern physics. At the forefront of quantum information technology, quantum computing has emerged as a new engineering field with broad interest not only in physics but also in computer science, electronics engineering, and mathematics.

Journal of the Korean Physical Society•Sep 1, 2018•8 citations

Suppression of collective fluctuations and generation of entanglement in a spin ensemble

Yu Luo

Spin degrees of freedom have been extensively explored in the context of quantum information processing. Many proposals of quantum computation architectures use spins as carriers of quantum of information. A central problem is to efficiently generate quantum entanglement between spin qubits which proves to be a crucial resource for quantum information tasks. On the other hand, uncontrollable spin degrees of freedom in the environment of spin qubits are the major causes of errors at low temperature, for example, the lattice nuclear spins hyperfine coupled to single electron spin qubit localized in semiconductor nano-structures. An outstanding problem for scalable quantum computation is to suppress the collective fluctuations from such spin baths so that the coherence time of the spin qubit can be improved. With these two motivations, the problems of suppressing collective spin fluctuations and generating entanglement in various spin ensembles are addressed in this thesis.\n\n\n\nIn the first half of the thesis, two approaches are introduced for suppressing the collective fluctuations in the nuclear spin bath so that the quantum coherence time of electron spin qubit in semiconductor quantum dots can be improved. The first approach works for a coupled double dot system. A theory for the interaction with the nuclear spins is developed when the two-electron singlet state is in resonance with one of the triplet state in moderate external magnetic field. At this resonance condition, the nuclear-electron flip-flop process caused by the hyperfine interaction can lead to a feedback mechanism, which can be used to suppress the nuclear hyperfine field. The second approach works for a single dot system. It is shown that strong pumping of the nuclear spins in dynamic nuclear polarization processes can saturate the nuclear spin bath towards the collective “dark states”. In such dark states, the transverse nuclear field fluctuation can be substantially suppressed compared to the value at thermal equilibrium. Two physical schemes are proposed to realize the nuclear dark states for suppression of the nuclear field fluctuations.\n\n\n\nIn the second half of the thesis, schemes are presented for generating large scale quantum entanglement in two types of spin qubit systems. For atomic spin qubits in optical lattices, schemes are proposed on how to prepare pure spin coherent state (SCS) with low collective spin by incoherent pumping with collective spin raising and lowering operations. Such SCS realize networks of mutually entangled spins which can be idea resources for the quantum telecloning algorithm. For donor nuclear spin qubits in silicon architecture, proposals are shown on how to deterministic prepare Dicke states which constitute an important class of multipartite entangled states. Our scheme is capable of preparing both symmetric and asymmetric Dicke states which form a complete basis set of the spin Hilbert space. The required controls are in situ to the prototype Kane’s quantum computer. The preparation is robust because each desired Dicke state is the steady state under designed pumping process. The schemes presented here also make possible the construction of decoherence free subspaces where quantum information is protected from collective noises.

•Jan 1, 2012•0 citations
A quantum computer is, if realized, the ultimate machine for completely controlling a quantum-mechanical system. This control enables one to prepare any arbitrary state of the Hilbert space and to determine by will its time evolution. From this point of view, the realization of quantum states with unusual symmetries seems to be possible by the use of such quantum information processing devices. On the other hand, symmetry arguments can be used to gain more insight in such a quantum network consisting of identical qubits and they can even further lead to error prevention codes by identifying decoherence free subspaces. By introducing a collective operator description for quantum networks, we show how to describe ensemble systems using a reduced set of parameters. Further we want to point out some connections between quantum computers and symmetry considerations.
A quantum computer is an information processing systems that utilizes invertible logic elements to perform reversible logic operations. It can also perform irreversible logic operations. Thus, in principle, it can compute the information transformation rule of any physical system for which the rules are known. A quantum computer can be designed to perform parallel computation on a massive scale, and therefore can have fast execution time. The basic structure of a quantum computer includes 1) a quantum register, or a configuration of quantum-mechanical energy states to store quantum bits (qubits) of information, 2) a quantum processor designed to induce quantum mechanical interactions between any arbitrary pair of qubits to perform a specified logic operations. 3) a quantum bus or network for transferring qubits from the registers to the processor and vice versa, and 4) a physical mechanisms for non-destructive measurements on the qubits. Quantum mechanical systems with the potential for realizing quantum computers include ion-trap quantum computers, cavity quantum electrodynamics quantum computers, photon-trap quantum computers, nuclear magnetic resonance quantum computers, and superconducting quantum computers. Decoherence [1 ,2] possesses the greatest challenge to the practical realization of quantum computers, because it causes the collapse of the quantum superposition states that contain the vital results of qubit manipulations. Decoherence processes are measurement-induced, noise-induced, and environment-induced [3] . Schemes to correct or circumvent the detrimental effects of decoherence in quantum processors fall into active error-correction schemes, and passive error-correction schemes [4]. Active error-correction schemes are designed to detect and correct for errors during computation. Algorithmic fault-tolerant computing [5, 6] is the most promising active-error correction scheme. In fault-tolerant computing, ancillary qubits are encoded into data blocks of the quantum registers. They are then used to detect errors. Once detected appropriate error-correction algorithms are then employed to rectify the errors. The implementation of fault-tolerant quantum computing has been hampered by the lack of practical universal set of quantum gates that can process an encoded data without propagating or introducing additional errors. Passive-error correction schemes [7] attempt to finding Hilbert subspaces that are intrinsically free of decoherence effects [8]. The key to quantum computing in such a decoherence-free subspace is the identification of mechanisms that can effect quantum mechanical interactions between the decoherence-free states without taking the system out of the decoherence-free environment. The challenge is to identify and employ physical processes that can achieve these goals.
In this thesis we describe methods for avoiding the detrimental effects of decoherence while at the same time still allowing for computation of the quantum information. The philosophy of the method discussed in the first part of this thesis is to use a symmetry of the decoherence mechanism to find robust encodings of the quantum information. Stability, control, and methods for using decoherence-free information in a quantum computer are presented with a specific emphasis on decoherence due to a collective coupling between the system and its environment. Universal quantum computation on such collective decoherence decoherence-free encodings is demonstrated. Rigorous definitions of control and the use of encoded universality in quantum computers are addressed. Explicit gate constructions for encoded universality on ion trap and exchange based quantum computers are given. In the second part of the thesis we examine physical systems with error correcting properties. We examine systems that can store quantum information in their ground state such that decoherence processes are prohibited via energetics. We present the theory of supercoherent systems whose ground states are quantum error detecting codes and describe a spin ladder whose ground state has both the error detecting and correcting properties. We conclude by discussing naturally fault-tolerant quantum computation.
We discuss here some aspects related to the symmetries of a quantum many-body problem when trying to treat it on a quantum computer. Several features related to symmetry conservation, symmetry breaking, and possible symmetry restoration are reviewed. After briefly discussing some of the standard symmetries relevant for many-particle systems, we discuss the advantage of encoding some symmetries directly in quantum ansätze, especially to reduce the quantum register size. It is, however, well-known that the use of symmetry-breaking states can also be a unique way to incorporate specific internal correlations when a spontaneous symmetry breaking occurs. These aspects are discussed in the quantum computing context. Ultimately, an accurate description of quantum systems can be achieved only when the initially broken symmetries are properly restored. We review several methods explored previously to perform symmetry restoration on a quantum computer, for instance, the ones based on symmetry filtering by quantum phase estimation and by an iterative independent set of Hadamard tests. We propose novel methods that pave the new directions to perform symmetry restoration, like those based on the purification of the state employing the linear combination of unitaries (LCU) approach.
Decoherence-free subspace (DFS) provides a crucial mechanism for passive error mitigation in quantum computation by encoding information within symmetry-protected subspaces of the Hilbert space, which are immune from collective decoherence. Constructing a complete set of orthogonal basis states for the DFS is essential to realize fault-tolerant quantum computation by using the DFS codes. However, existing methods for preparing these basis states are often non-scalable, platform-specific, or yield mixed states. Here, we propose a deterministic approach to prepare pure, orthogonal and complete DFS basis states for systems of arbitrary size composed of qubits. Our method employs projective measurements and quantum circuits with single-qubit, two-qubit and Toffoli gates. We provide a rigorous resource cost analysis both mathematically and numerically. Meanwhile, we demonstrate the realizability of our method on NISQ devices by discussing how to implement our method on a superconducting chip. The proposed method offers a universal solution for preparing the DFS basis states across diverse quantum computing platforms and system sizes, which is realizable in the NISQ era.
A classical simulation of quantum systems demands enormous computational resources. The dimension of underlying Hilbert space scales exponentially with the number of participating elements ( N ), requiring a 2 2N size of calculation matrix for a unitary operation, for example, 2 100 ≈ 10 30 for only N = 50. With the increase of N , the first obstacle to encounter is in fact the deficiency of computer memories. A straightforward resolution is to use a quantum computer, a calculating device that operates with the principle of quantum mechanics. During the last twenty years, quantum computing once considered as theoretical exercise has become an important field of research in modern physics. At the forefront of quantum information technology, quantum computing has emerged as a new engineering field with broad interest not only in physics but also in computer science, electronics engineering, and mathematics.
Spin degrees of freedom have been extensively explored in the context of quantum information processing. Many proposals of quantum computation architectures use spins as carriers of quantum of information. A central problem is to efficiently generate quantum entanglement between spin qubits which proves to be a crucial resource for quantum information tasks. On the other hand, uncontrollable spin degrees of freedom in the environment of spin qubits are the major causes of errors at low temperature, for example, the lattice nuclear spins hyperfine coupled to single electron spin qubit localized in semiconductor nano-structures. An outstanding problem for scalable quantum computation is to suppress the collective fluctuations from such spin baths so that the coherence time of the spin qubit can be improved. With these two motivations, the problems of suppressing collective spin fluctuations and generating entanglement in various spin ensembles are addressed in this thesis.\n\n\n\nIn the first half of the thesis, two approaches are introduced for suppressing the collective fluctuations in the nuclear spin bath so that the quantum coherence time of electron spin qubit in semiconductor quantum dots can be improved. The first approach works for a coupled double dot system. A theory for the interaction with the nuclear spins is developed when the two-electron singlet state is in resonance with one of the triplet state in moderate external magnetic field. At this resonance condition, the nuclear-electron flip-flop process caused by the hyperfine interaction can lead to a feedback mechanism, which can be used to suppress the nuclear hyperfine field. The second approach works for a single dot system. It is shown that strong pumping of the nuclear spins in dynamic nuclear polarization processes can saturate the nuclear spin bath towards the collective “dark states”. In such dark states, the transverse nuclear field fluctuation can be substantially suppressed compared to the value at thermal equilibrium. Two physical schemes are proposed to realize the nuclear dark states for suppression of the nuclear field fluctuations.\n\n\n\nIn the second half of the thesis, schemes are presented for generating large scale quantum entanglement in two types of spin qubit systems. For atomic spin qubits in optical lattices, schemes are proposed on how to prepare pure spin coherent state (SCS) with low collective spin by incoherent pumping with collective spin raising and lowering operations. Such SCS realize networks of mutually entangled spins which can be idea resources for the quantum telecloning algorithm. For donor nuclear spin qubits in silicon architecture, proposals are shown on how to deterministic prepare Dicke states which constitute an important class of multipartite entangled states. Our scheme is capable of preparing both symmetric and asymmetric Dicke states which form a complete basis set of the spin Hilbert space. The required controls are in situ to the prototype Kane’s quantum computer. The preparation is robust because each desired Dicke state is the steady state under designed pumping process. The schemes presented here also make possible the construction of decoherence free subspaces where quantum information is protected from collective noises.