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

Simulating Quantum Circuits with Hard-Core Bosons

Emmanuel-Costa, David

Published Aug 19, 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. Finally, a method to simulate a quantum circuit is developed.

Related papers

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

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

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

Symbolic Simulation of Quantum Circuits with Tensor Networks

Jincheng Zhang

The accurate simulation of quantum circuits remains a significant challenge due to the exponential scaling of computational resources with circuit size. This work explores the application of tensor network methods, specifically Matrix Product States (MPS), to provide a scalable approach for simulating quantum circuits. We demonstrate how tensor networks can efficiently represent and manipulate the states of quantum circuits, reducing the computational burden associated with traditional methods. The core claim of this research is that tensor networks offer a viable path to accurately simulating larger and more complex quantum systems. This research introduces a novel framework for symbolic simulation, leveraging the power of tensor network representations to overcome the limitations of conventional simulation techniques. The effectiveness of this approach is illustrated through theoretical analysis and conceptual examples.

•Sep 5, 2026•0 citations

Classical simulability of Clifford + T circuits with Clifford-augmented matrix product states

Zejun Liu, Bryan K. Clark

Determining the quantum-classical boundary between quantum circuits that can be efficiently simulated classically and those that cannot remains a fundamental question. One approach to classical simulation is to represent the output of a quantum circuit as a Clifford-augmented matrix product state (CAMPS), which, via a disentangling algorithm, decomposes the wave function into Clifford and MPS components, and from which Pauli expectation values can be computed in time polynomial in the MPS bond dimension. In this work, we develop an optimization-free disentangling (OFD) algorithm for Clifford circuits either doped with T gates or, equivalently, preceded by multiqubit gates of the form α I + β P . We give a simple and easily computed algebraic criterion that characterizes the individual quantum circuits for which OFD generates an efficient CAMPS—the bond dimension is exponential in the null space of a Galois binary field GF(2) matrix induced by a tableau of the twisted Pauli strings P . This significantly increases the number of circuits with rigorous polynomial-time classical simulations. We also give evidence that the typical N qubit random Clifford circuit doped with N uniformly distributed T gates of polylogarithmic depth or greater has a CAMPS with polynomial bond dimension. In addition, we compare OFD against disentangling by optimization. We further explore the representability of CAMPS for random Clifford circuits doped with more than N T gates. We also propose algorithms for sampling, probability, and amplitude estimation of bitstrings, and evaluation of entanglement Rényi entropy from CAMPS, which, though still having exponential complexity, are more efficient than standard MPS simulations. This work establishes a versatile framework for understanding classical simulatability of Clifford + T circuits and explores the interplay between quantum entanglement and quantum magic in quantum systems.

arXiv:2412.17209•Physical Review Research•Apr 18, 2026•18 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. 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.
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.
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.
The accurate simulation of quantum circuits remains a significant challenge due to the exponential scaling of computational resources with circuit size. This work explores the application of tensor network methods, specifically Matrix Product States (MPS), to provide a scalable approach for simulating quantum circuits. We demonstrate how tensor networks can efficiently represent and manipulate the states of quantum circuits, reducing the computational burden associated with traditional methods. The core claim of this research is that tensor networks offer a viable path to accurately simulating larger and more complex quantum systems. This research introduces a novel framework for symbolic simulation, leveraging the power of tensor network representations to overcome the limitations of conventional simulation techniques. The effectiveness of this approach is illustrated through theoretical analysis and conceptual examples.
Determining the quantum-classical boundary between quantum circuits that can be efficiently simulated classically and those that cannot remains a fundamental question. One approach to classical simulation is to represent the output of a quantum circuit as a Clifford-augmented matrix product state (CAMPS), which, via a disentangling algorithm, decomposes the wave function into Clifford and MPS components, and from which Pauli expectation values can be computed in time polynomial in the MPS bond dimension. In this work, we develop an optimization-free disentangling (OFD) algorithm for Clifford circuits either doped with T gates or, equivalently, preceded by multiqubit gates of the form α I + β P . We give a simple and easily computed algebraic criterion that characterizes the individual quantum circuits for which OFD generates an efficient CAMPS—the bond dimension is exponential in the null space of a Galois binary field GF(2) matrix induced by a tableau of the twisted Pauli strings P . This significantly increases the number of circuits with rigorous polynomial-time classical simulations. We also give evidence that the typical N qubit random Clifford circuit doped with N uniformly distributed T gates of polylogarithmic depth or greater has a CAMPS with polynomial bond dimension. In addition, we compare OFD against disentangling by optimization. We further explore the representability of CAMPS for random Clifford circuits doped with more than N T gates. We also propose algorithms for sampling, probability, and amplitude estimation of bitstrings, and evaluation of entanglement Rényi entropy from CAMPS, which, though still having exponential complexity, are more efficient than standard MPS simulations. This work establishes a versatile framework for understanding classical simulatability of Clifford + T circuits and explores the interplay between quantum entanglement and quantum magic in quantum systems.