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:quant-ph/0109078 · Journal of Mathematical Physics

Qubits as parafermions

Lian-Ao Wu, Daniel A. Lidar

Published Sep 1, 2002• 63 citations
arXivHTMLPDF

Abstract

Qubits are neither fermions nor bosons. A Fock space description of qubits leads to a mapping from qubits to parafermions: particles with a hybrid boson-fermion quantum statistics. We study this mapping in detail, and use it to provide a classification of the algebras of operators acting on qubits. These algebras in turn classify the universality of different classes of physically relevant qubit-qubit interaction Hamiltonians. The mapping is further used to elucidate the connections between qubits, bosons, and fermions. These connections allow us to share universality results between the different particle types. Finally, we use the mapping to study the quantum computational power of certain anisotropic exchange Hamiltonians. In particular, we prove that the XY model with nearest-neighbor interactions only is not computationally universal. We also generalize previous results about universal quantum computation with encoded qubits to codes with higher rates.

DOI
10.1063/1.1499208

Related papers

Power of anisotropic exchange interactions: Universality and efficient codes for quantum computing

Lian-Ao Wu, Daniel A. Lidar

We study the quantum computational power of a generic class of anisotropic solid-state Hamiltonians. A universal set of encoded logic operations are found, which do away with difficult-to-implement single-qubit gates in a number of quantum-computer proposals, e.g., quantum dots and donor atom spins with anisotropic exchange coupling, quantum Hall systems, and electrons floating on helium. We show how to make the corresponding Hamiltonians universal by encoding one qubit into two physical qubits, and by controlling nearest-neighbor interactions.

arXiv:quant-ph/0103039•Physical Review A•Apr 4, 2002•34 citations

Parafermionic Quantum Computation

L. A. Wu, Daniel A. Lidar

By mapping qubits to parafermions we study the quantum computational power of a generic class of solid state Hamiltonians. We present encoded logic operations which do away with difficult-to-implement single-qubit gates in a number of quantum computer proposals, e.g., quantum dots and donor atom spins with anisotropic exchange coupling, and electrons floating on helium.

•Mar 8, 2001•1 citation

The Computational Power of Non-interacting Particles

Daniel J. Brod

Shortened abstract: In this thesis, I study two restricted models of quantum computing related to free identical particles. Free fermions correspond to a set of two-qubit gates known as matchgates. Matchgates are classically simulable when acting on nearest neighbors on a path, but universal for quantum computing when acting on distant qubits or when SWAP gates are available. I generalize these results in two ways. First, I show that SWAP is only one in a large family of gates that uplift matchgates to quantum universality. In fact, I show that the set of all matchgates plus any nonmatchgate parity-preserving two-qubit gate is universal, and interpret this fact in terms of local invariants of two-qubit gates. Second, I investigate the power of matchgates in arbitrary connectivity graphs, showing they are universal on any connected graph other than a path or a cycle, and classically simulable on a cycle. I also prove the same dichotomy for the XY interaction. Free bosons give rise to a model known as BosonSampling. BosonSampling consists of (i) preparing a Fock state of n photons, (ii) interfering these photons in an m-mode linear interferometer, and (iii) measuring the output in the Fock basis. Sampling approximately from the resulting distribution should be classically hard, under reasonable complexity assumptions. Here I show that exact BosonSampling remains hard even if the linear-optical circuit has constant depth. I also report several experiments where three-photon interference was observed in integrated interferometers of various sizes, providing some of the first implementations of BosonSampling in this regime. The experiments also focus on the bosonic bunching behavior and on validation of BosonSampling devices. This thesis contains descriptions of the numerical analyses done on the experimental data, omitted from the corresponding publications.

arXiv:1412.7637•Dec 24, 2014•0 citations

Encoded universality from a single physical interaction

Julia Kempe, Dave Bacon, David Peter Divincenzo +1 more

We present a theoretical analysis of the paradigm of encoded universality, using a Lie algebraic analysis to derive specific conditions under which physical interactions can provide universality. We discuss the significance of the tensor product structure in the quantum circuit model and use this to define the conjoining of encoded qudits. The construction of encoded gates between conjoined qudits is discussed in detail. We illustrate the general procedures with several examples from exchange-only quantum computation. In particular, we extend our earlier results showing universality with the isotropic exchange interaction to the derivation of encoded universality with the anisotropic exchange interaction, i.e., to the XY model. In this case the minimal encoding for universality is into qutrits rather than into qubits as was the case for isotropic (Heisenberg) exchange. We also address issues of fault-tolerance, leakage and correction of encoded qudits.

•Dec 1, 2001•44 citations

Encoded Universality from a Single Physical Interaction

Julia Kempe, Dave Bacon, David Peter Divincenzo +1 more

We present a theoretical analysis of the paradigm of encoded universality, using a Lie algebraic analysis to derive specific conditions under which physical interactions can provide universality. We discuss the significance of the tensor product structure in the quantum circuit model and use this to define the conjoining of encoded qudits. The construction of encoded gates between conjoined qudits is discussed in detail. We illustrate the general procedures with several examples from exchange-only quantum computation. In particular, we extend our earlier results showing universality with the isotropic exchange interaction to the derivation of encoded universality with the anisotropic exchange interaction, i.e., to the XY model. In this case the minimal encoding for universality is into qutrits rather than into qubits as was the case for isotropic (Heisenberg) exchange. We also address issues of fault-tolerance, leakage and correction of encoded qudits.

arXiv:quant-ph/0112013•Dec 3, 2001•0 citations

Quantum computation with hybrid parafermion-spin qubits

Denis V. Kurlov, Melina Luethi, Anatoliy I. Lotkov +3 more

We propose a universal set of single- and two-qubit quantum gates acting on a hybrid qubit formed by coupling a quantum dot spin qubit to a Z 2 m parafermion qubit with arbitrary integer m . The special case m = 1 reproduces the results previously derived for Majorana qubits. Our formalism utilizes Fock parafermions, facilitating a transparent treatment of hybrid parafermion-spin systems. Furthermore, we highlight the previously overlooked importance of particle-hole symmetry in these systems. We give concrete examples how the hybrid qubit system could be realized experimentally for Z 4 and Z 6 parafermions. In addition, we discuss a simple readout scheme for the fractional parafermion charge via the measurement of the spin-qubit resonant frequency.

arXiv:2405.20950•Physical Review Research•Jul 8, 2025•1 citation
Qubits are neither fermions nor bosons. A Fock space description of qubits leads to a mapping from qubits to parafermions: particles with a hybrid boson-fermion quantum statistics. We study this mapping in detail, and use it to provide a classification of the algebras of operators acting on qubits. These algebras in turn classify the universality of different classes of physically relevant qubit-qubit interaction Hamiltonians. The mapping is further used to elucidate the connections between qubits, bosons, and fermions. These connections allow us to share universality results between the different particle types. Finally, we use the mapping to study the quantum computational power of certain anisotropic exchange Hamiltonians. In particular, we prove that the XY model with nearest-neighbor interactions only is not computationally universal. We also generalize previous results about universal quantum computation with encoded qubits to codes with higher rates.
We study the quantum computational power of a generic class of anisotropic solid-state Hamiltonians. A universal set of encoded logic operations are found, which do away with difficult-to-implement single-qubit gates in a number of quantum-computer proposals, e.g., quantum dots and donor atom spins with anisotropic exchange coupling, quantum Hall systems, and electrons floating on helium. We show how to make the corresponding Hamiltonians universal by encoding one qubit into two physical qubits, and by controlling nearest-neighbor interactions.
Shortened abstract: In this thesis, I study two restricted models of quantum computing related to free identical particles. Free fermions correspond to a set of two-qubit gates known as matchgates. Matchgates are classically simulable when acting on nearest neighbors on a path, but universal for quantum computing when acting on distant qubits or when SWAP gates are available. I generalize these results in two ways. First, I show that SWAP is only one in a large family of gates that uplift matchgates to quantum universality. In fact, I show that the set of all matchgates plus any nonmatchgate parity-preserving two-qubit gate is universal, and interpret this fact in terms of local invariants of two-qubit gates. Second, I investigate the power of matchgates in arbitrary connectivity graphs, showing they are universal on any connected graph other than a path or a cycle, and classically simulable on a cycle. I also prove the same dichotomy for the XY interaction. Free bosons give rise to a model known as BosonSampling. BosonSampling consists of (i) preparing a Fock state of n photons, (ii) interfering these photons in an m-mode linear interferometer, and (iii) measuring the output in the Fock basis. Sampling approximately from the resulting distribution should be classically hard, under reasonable complexity assumptions. Here I show that exact BosonSampling remains hard even if the linear-optical circuit has constant depth. I also report several experiments where three-photon interference was observed in integrated interferometers of various sizes, providing some of the first implementations of BosonSampling in this regime. The experiments also focus on the bosonic bunching behavior and on validation of BosonSampling devices. This thesis contains descriptions of the numerical analyses done on the experimental data, omitted from the corresponding publications.
We present a theoretical analysis of the paradigm of encoded universality, using a Lie algebraic analysis to derive specific conditions under which physical interactions can provide universality. We discuss the significance of the tensor product structure in the quantum circuit model and use this to define the conjoining of encoded qudits. The construction of encoded gates between conjoined qudits is discussed in detail. We illustrate the general procedures with several examples from exchange-only quantum computation. In particular, we extend our earlier results showing universality with the isotropic exchange interaction to the derivation of encoded universality with the anisotropic exchange interaction, i.e., to the XY model. In this case the minimal encoding for universality is into qutrits rather than into qubits as was the case for isotropic (Heisenberg) exchange. We also address issues of fault-tolerance, leakage and correction of encoded qudits.
We present a theoretical analysis of the paradigm of encoded universality, using a Lie algebraic analysis to derive specific conditions under which physical interactions can provide universality. We discuss the significance of the tensor product structure in the quantum circuit model and use this to define the conjoining of encoded qudits. The construction of encoded gates between conjoined qudits is discussed in detail. We illustrate the general procedures with several examples from exchange-only quantum computation. In particular, we extend our earlier results showing universality with the isotropic exchange interaction to the derivation of encoded universality with the anisotropic exchange interaction, i.e., to the XY model. In this case the minimal encoding for universality is into qutrits rather than into qubits as was the case for isotropic (Heisenberg) exchange. We also address issues of fault-tolerance, leakage and correction of encoded qudits.
We propose a universal set of single- and two-qubit quantum gates acting on a hybrid qubit formed by coupling a quantum dot spin qubit to a Z 2 m parafermion qubit with arbitrary integer m . The special case m = 1 reproduces the results previously derived for Majorana qubits. Our formalism utilizes Fock parafermions, facilitating a transparent treatment of hybrid parafermion-spin systems. Furthermore, we highlight the previously overlooked importance of particle-hole symmetry in these systems. We give concrete examples how the hybrid qubit system could be realized experimentally for Z 4 and Z 6 parafermions. In addition, we discuss a simple readout scheme for the fractional parafermion charge via the measurement of the spin-qubit resonant frequency.