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

Hard-core Bosons in Action: Applications to Quantum Circuits

da Costa, David, Epping, Michael

Published Jan 1, 2025• 0 citations
OpenAlex

Abstract

The use of algebraic frameworks based on complex Clifford algebras for the representation and simulation of quantum circuits has been discussed in the literature. Recently, an alternative algebraic approach employing hard- core bosons has been proposed. Hard-core bosons provide a natural representation of multi-qubit systems, in which the tensor-product structure is realized directly and no sign corrections are required, in contrast to realizations based on complex Clifford algebras. Although both approaches are formally equivalent, the hard-core boson formulation exhibits computational advantages. This work reviews and extends the hard-core boson algebra for circuit simulation and presents an efficient implementation. A performance comparison with IBM Qiskit shows substantially improved execution times for simulations. Moreover, a new application is introduced in which the hard-core boson formalism is combined with genetic algorithms for quantum circuit synthesis.

Related papers

Hard-core Bosons in Action: Applications to Quantum Circuits

David Emmanuel-Costa, Michael Epping

The use of algebraic frameworks based on complex Clifford algebras for the representation and simulation of quantum circuits has been discussed in the literature. Recently, an alternative algebraic approach employing hard-core bosons has been proposed. Hard-core bosons provide a natural representation of multi-qubit systems, in which the tensor-product structure is realized directly and no sign corrections are required, in contrast to realizations based on complex Clifford algebras. Although both approaches are formally equivalent, the hard-core boson formulation exhibits computational advantages. This work reviews and extends the hard-core boson algebra for circuit simulation and presents an efficient implementation. A performance comparison with IBM Qiskit shows substantially improved execution times for simulations. Moreover, a new application is introduced in which the hard-core boson formalism is combined with genetic algorithms for quantum circuit synthesis.

quant-pharXiv:2606.28004•Jun 29, 2026•0 citations

Simulating Quantum Circuits with Hard-Core Bosons

Emmanuel-Costa, David

Simulating quantum systems without the exponential overhead characteristic of classical simulations is a challenging task. Complex Clifford algebras can unify all components of a quantum circuit, with only elements of the algebra together with the geometric product. However, due to its non-Abelian nature, the geometric product realizes the tensor product by constantly correcting the sign of the expressions. In this work, hard-core bosons are shown as the most natural way to fully represent multiqubit systems and the tensor product is naturally realized without the need of any sign correction. It is proved that the two approaches are strictly equivalent up to a Jordan-Wigner transformation. Multiqubit gates in terms of annihilation and creation operators are described. Finally, a method to simulate a quantum circuit is developed.

•Aug 19, 2025•0 citations

Designing Quantum Circuits with Hard-Core Bosons

da Costa, David

Simulating quantum systems without the exponential overhead characteristic of classical simulations is a challenging task. Complex Clifford algebras can unify all components of a quantum circuit, with only elements of the algebra together with the geometric product. However, due to its non-Abelian nature, the geometric product realizes the tensor product by constantly correcting the sign of the expressions. In this work, hard-core bosons are shown as the most natural way to fully represent multiqubit systems and the tensor product is naturally realized without the need of any sign correction. It is proved that the two approaches are strictly equivalent up to a Jordan-Wigner transformation. Multiqubit gates in terms of annihilation and creation operators are described.

•Mar 13, 2025•0 citations

A Unified Clifford Algebra Framework for Quantum Computation: From Specific Spinor Realizations to General Operator Representations

Luciano Silva

This paper presents a unified algebraic framework for $n$-qubit quantum computation rooted in the complex Clifford algebra $Cl(2n, \mathbb{C})$. We leverage the fundamental isomorphism $Cl(2n, \mathbb{C}) \cong M(2^n, \mathbb{C})$ to directly identify the algebra of all $n$-qubit quantum operators (including states, gates, and observables) with elements of $Cl(2n, \mathbb{C})$. This operator-centric perspective treats quantum states, whether pure or mixed, as density multivectors $\rho \in Cl(2n, \mathbb{C})$ satisfying standard physical constraints ($\rho^\dagger = \rho$, $2^n \langle \rho \rangle_0 = 1$, positivity), and unitary gates $U$ as multivectors obeying $U^\dagger U = I$. Quantum evolution $\rho' = U\rho U^\dagger$ and measurements $p(m) = 2^n \langle P_m \rho \rangle_0$ are thus described by intrinsic Clifford algebraic operations. This contrasts with, yet encompasses, specific realizations like spinor representations based on Witt ideals ($S = Cl(2n, \mathbb{C})\prod_j f_j f_j^\dagger$), which are shown to be particular constructions within this universal algebra. By analyzing Deutsch's algorithm through these different lenses, we demonstrate the generality and unifying power of the operator-centric multivector approach. This formulation not only provides a comprehensive algebraic language that naturally handles mixed states and general quantum processes but also opens avenues for applying the rich geometric and structural tools of Clifford algebras—such as grade decomposition and invariant theory—to gain deeper insights into quantum information, entanglement, and dynamics.

•May 23, 2025•0 citations

Low-rank tensor decompositions of quantum circuits

Patrick Gelß, Stefan Klus, Knebel, Sebastian +2 more

Quantum computing is arguably one of the most revolutionary and disruptive technologies of this century. Due to the ever-increasing number of potential applications as well as the continuing rise in complexity, the development, simulation, optimization, and physical realization of quantum circuits is of utmost importance for designing novel algorithms. We show how matrix product states (MPSs) and matrix product operators (MPOs) can be used to express certain quantum states, quantum gates, and entire quantum circuits as low-rank tensors. This enables the analysis and simulation of complex quantum circuits on classical computers and to gain insight into the underlying structure of the system. We present different examples to demonstrate the advantages of MPO formulations and show that they are more efficient than conventional techniques if the bond dimensions of the wave function representation can be kept small throughout the simulation.

arXiv:2205.09882•May 19, 2022•6 citations

A general formulation based on algebraic spinors for the quantum computation

Marco A. S. Trindade, Sérgio Floquet, J. David M. Vianna

In this work, we explore the structure of Clifford algebras and the representations of the algebraic spinors in quantum information theory. Initially, we present a general formulation through elements of minimal left ideals in tensor products of Clifford algebras. Posteriorly, we perform some applications in quantum computation: qubits, entangled states, quantum gates, representations of the braid group, quantum teleportation, Majorana operators and supersymmetry. Finally, we discuss advantages compared to standard Hilbert space formulation.

arXiv:2003.05089•International Journal of Geometric Methods in Modern Physics•Sep 25, 2020•2 citations
The use of algebraic frameworks based on complex Clifford algebras for the representation and simulation of quantum circuits has been discussed in the literature. Recently, an alternative algebraic approach employing hard- core bosons has been proposed. Hard-core bosons provide a natural representation of multi-qubit systems, in which the tensor-product structure is realized directly and no sign corrections are required, in contrast to realizations based on complex Clifford algebras. Although both approaches are formally equivalent, the hard-core boson formulation exhibits computational advantages. This work reviews and extends the hard-core boson algebra for circuit simulation and presents an efficient implementation. A performance comparison with IBM Qiskit shows substantially improved execution times for simulations. Moreover, a new application is introduced in which the hard-core boson formalism is combined with genetic algorithms for quantum circuit synthesis.
The use of algebraic frameworks based on complex Clifford algebras for the representation and simulation of quantum circuits has been discussed in the literature. Recently, an alternative algebraic approach employing hard-core bosons has been proposed. Hard-core bosons provide a natural representation of multi-qubit systems, in which the tensor-product structure is realized directly and no sign corrections are required, in contrast to realizations based on complex Clifford algebras. Although both approaches are formally equivalent, the hard-core boson formulation exhibits computational advantages. This work reviews and extends the hard-core boson algebra for circuit simulation and presents an efficient implementation. A performance comparison with IBM Qiskit shows substantially improved execution times for simulations. Moreover, a new application is introduced in which the hard-core boson formalism is combined with genetic algorithms for quantum circuit synthesis.
Simulating quantum systems without the exponential overhead characteristic of classical simulations is a challenging task. Complex Clifford algebras can unify all components of a quantum circuit, with only elements of the algebra together with the geometric product. However, due to its non-Abelian nature, the geometric product realizes the tensor product by constantly correcting the sign of the expressions. In this work, hard-core bosons are shown as the most natural way to fully represent multiqubit systems and the tensor product is naturally realized without the need of any sign correction. It is proved that the two approaches are strictly equivalent up to a Jordan-Wigner transformation. Multiqubit gates in terms of annihilation and creation operators are described. Finally, a method to simulate a quantum circuit is developed.
Simulating quantum systems without the exponential overhead characteristic of classical simulations is a challenging task. Complex Clifford algebras can unify all components of a quantum circuit, with only elements of the algebra together with the geometric product. However, due to its non-Abelian nature, the geometric product realizes the tensor product by constantly correcting the sign of the expressions. In this work, hard-core bosons are shown as the most natural way to fully represent multiqubit systems and the tensor product is naturally realized without the need of any sign correction. It is proved that the two approaches are strictly equivalent up to a Jordan-Wigner transformation. Multiqubit gates in terms of annihilation and creation operators are described.
This paper presents a unified algebraic framework for nnn-qubit quantum computation rooted in the complex Clifford algebra Cl(2n,C)Cl(2n, \mathbb{C})Cl(2n,C). We leverage the fundamental isomorphism Cl(2n,C)≅M(2n,C)Cl(2n, \mathbb{C}) \cong M(2^n, \mathbb{C})Cl(2n,C)≅M(2n,C) to directly identify the algebra of all nnn-qubit quantum operators (including states, gates, and observables) with elements of Cl(2n,C)Cl(2n, \mathbb{C})Cl(2n,C). This operator-centric perspective treats quantum states, whether pure or mixed, as density multivectors ρ∈Cl(2n,C)\rho \in Cl(2n, \mathbb{C})ρ∈Cl(2n,C) satisfying standard physical constraints (ρ†=ρ\rho^\dagger = \rhoρ†=ρ, 2n⟨ρ⟩0=12^n \langle \rho \rangle_0 = 12n⟨ρ⟩0​=1, positivity), and unitary gates UUU as multivectors obeying U†U=IU^\dagger U = IU†U=I. Quantum evolution ρ′=UρU†\rho' = U\rho U^\daggerρ′=UρU† and measurements p(m)=2n⟨Pmρ⟩0p(m) = 2^n \langle P_m \rho \rangle_0p(m)=2n⟨Pm​ρ⟩0​ are thus described by intrinsic Clifford algebraic operations. This contrasts with, yet encompasses, specific realizations like spinor representations based on Witt ideals (S=Cl(2n,C)∏jfjfj†S = Cl(2n, \mathbb{C})\prod_j f_j f_j^\daggerS=Cl(2n,C)∏j​fj​fj†​), which are shown to be particular constructions within this universal algebra. By analyzing Deutsch's algorithm through these different lenses, we demonstrate the generality and unifying power of the operator-centric multivector approach. This formulation not only provides a comprehensive algebraic language that naturally handles mixed states and general quantum processes but also opens avenues for applying the rich geometric and structural tools of Clifford algebras—such as grade decomposition and invariant theory—to gain deeper insights into quantum information, entanglement, and dynamics.
Quantum computing is arguably one of the most revolutionary and disruptive technologies of this century. Due to the ever-increasing number of potential applications as well as the continuing rise in complexity, the development, simulation, optimization, and physical realization of quantum circuits is of utmost importance for designing novel algorithms. We show how matrix product states (MPSs) and matrix product operators (MPOs) can be used to express certain quantum states, quantum gates, and entire quantum circuits as low-rank tensors. This enables the analysis and simulation of complex quantum circuits on classical computers and to gain insight into the underlying structure of the system. We present different examples to demonstrate the advantages of MPO formulations and show that they are more efficient than conventional techniques if the bond dimensions of the wave function representation can be kept small throughout the simulation.
In this work, we explore the structure of Clifford algebras and the representations of the algebraic spinors in quantum information theory. Initially, we present a general formulation through elements of minimal left ideals in tensor products of Clifford algebras. Posteriorly, we perform some applications in quantum computation: qubits, entangled states, quantum gates, representations of the braid group, quantum teleportation, Majorana operators and supersymmetry. Finally, we discuss advantages compared to standard Hilbert space formulation.