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

Designing Quantum Circuits with Hard-Core Bosons

da Costa, David

Published Mar 13, 2025• 0 citations
OpenAlex

Abstract

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.

Related papers

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

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

Hard-core Bosons in Action: Applications to Quantum Circuits

da Costa, David, Epping, Michael

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.

•Jan 1, 2025•0 citations

Geometric Algebra Quantum Gate Decomposition

Youssef Amraoui, Zeno Toffano

Quantum gates are usually described through matrix and tensor-product formalisms that often obscure their geometric structure. In this work, we formulate the Pauli and Clifford groups within the complex Geometric Algebra (GA) framework. We show that the Pauli group is naturally identified with the group of blades up to a global phase, thereby providing a geometric interpretation of Pauli operators and their commutation relations in terms of oriented subspaces. We further prove that Clifford operators are generated by products of π/4-Pauli rotors and introduce a greedy Pauli rotor decomposition algorithm whose empirical behavior suggests unexpectedly compact decompositions for Clifford operators. Finally, we show that Clifford+T universality admits a natural geometric interpretation through π/8-rotors within this framework.

quant-pharXiv:2606.12480•Axioms•Jun 11, 2026•0 citations

Simulating physical phenomena by quantum networks

Rolando D. Somma, Gerardo Ortíz, James E. Gubernatis +2 more

Physical systems, characterized by an ensemble of interacting constituents, can be represented and studied by different algebras of operators (observables). For example, a fully polarized electronic system can be studied by means of the algebra generated by the usual fermionic creation and annihilation operators or by the algebra of Pauli (spin-1/2) operators. The Jordan-Wigner isomorphism gives the correspondence between the two algebras. As we previously noted, similar isomorphisms enable one to represent any physical system in a quantum computer. In this paper we evolve and exploit this fundamental observation to simulate generic physical phenomena by quantum networks. We give quantum circuits useful for the efficient evaluation of the physical properties (e.g., the spectrum of observables or relevant correlation functions) of an arbitrary system with Hamiltonian H.

arXiv:quant-ph/0108146•Physical Review A•Apr 9, 2002•372 citations

Geometric Algebra Jordan–Wigner Transformation for Quantum Simulation

Grégoire Veyrac, Zeno Toffano

Quantum simulation qubit models of electronic Hamiltonians rely on specific transformations in order to take into account the fermionic permutation properties of electrons. These transformations (principally the Jordan-Wigner transformation (JWT) and the Bravyi-Kitaev transformation) correspond in a quantum circuit to the introduction of a supplementary circuit level. In order to include the fermionic properties in a more straightforward way in quantum computations, we propose to use methods issued from Geometric Algebra (GA), which, due to its commutation properties, are well adapted for fermionic systems. First, we apply the Witt basis method in GA to reformulate the JWT in this framework and use this formulation to express various quantum gates. We then rewrite the general one and two-electron Hamiltonian and use it for building a quantum simulation circuit for the Hydrogen molecule. Finally, the quantum Ising Hamiltonian, widely used in quantum simulation, is reformulated in this framework.

Entropy•May 8, 2024•6 citations
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.
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.
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.
Quantum gates are usually described through matrix and tensor-product formalisms that often obscure their geometric structure. In this work, we formulate the Pauli and Clifford groups within the complex Geometric Algebra (GA) framework. We show that the Pauli group is naturally identified with the group of blades up to a global phase, thereby providing a geometric interpretation of Pauli operators and their commutation relations in terms of oriented subspaces. We further prove that Clifford operators are generated by products of π/4-Pauli rotors and introduce a greedy Pauli rotor decomposition algorithm whose empirical behavior suggests unexpectedly compact decompositions for Clifford operators. Finally, we show that Clifford+T universality admits a natural geometric interpretation through π/8-rotors within this framework.
Physical systems, characterized by an ensemble of interacting constituents, can be represented and studied by different algebras of operators (observables). For example, a fully polarized electronic system can be studied by means of the algebra generated by the usual fermionic creation and annihilation operators or by the algebra of Pauli (spin-1/2) operators. The Jordan-Wigner isomorphism gives the correspondence between the two algebras. As we previously noted, similar isomorphisms enable one to represent any physical system in a quantum computer. In this paper we evolve and exploit this fundamental observation to simulate generic physical phenomena by quantum networks. We give quantum circuits useful for the efficient evaluation of the physical properties (e.g., the spectrum of observables or relevant correlation functions) of an arbitrary system with Hamiltonian H.
Quantum simulation qubit models of electronic Hamiltonians rely on specific transformations in order to take into account the fermionic permutation properties of electrons. These transformations (principally the Jordan-Wigner transformation (JWT) and the Bravyi-Kitaev transformation) correspond in a quantum circuit to the introduction of a supplementary circuit level. In order to include the fermionic properties in a more straightforward way in quantum computations, we propose to use methods issued from Geometric Algebra (GA), which, due to its commutation properties, are well adapted for fermionic systems. First, we apply the Witt basis method in GA to reformulate the JWT in this framework and use this formulation to express various quantum gates. We then rewrite the general one and two-electron Hamiltonian and use it for building a quantum simulation circuit for the Hydrogen molecule. Finally, the quantum Ising Hamiltonian, widely used in quantum simulation, is reformulated in this framework.