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

Bulletin of the American Physical Society

Hard-core lattice bosons: new insights from algebraic graph theory

Randall W. Squires, David L. Feder

Published Mar 7, 2014• 0 citations
OpenAlex

Related papers

Ground State of Hard-Core Lattice Bosons from Algebraic Graph Theory

David L. Feder, Sebastian Garcia

Bulletin of the American Physical Society•Mar 7, 2018•0 citations

Hard Core Bosons on a Triangular Lattice

Massimo Boninsegni

Journal of Low Temperature Physics•Jun 6, 2003•23 citations

Exact numerical approach to hard-core bosons on one-dimensional lattices

Marcos Rigol, Alejandro Muramatsu

Computer Physics Communications•Apr 11, 2005•1 citation

Hard-core Bosons and Spinless Fermions Trapped on 1D Lattices

Marcos Rigol, Alejandro Muramatsu

Journal of Low Temperature Physics•Feb 1, 2005•4 citations

Perfect quantum state transfer of hard-core bosons on weighted path graphs

Steven J. Large, Michael S. Underwood, David L. Feder

The ability to accurately transfer quantum information through networks is an important primitive in distributed quantum systems. While perfect quantum state transfer (PST) can be effected by a single particle undergoing continuous-time quantum walks on a variety of graphs, it is not known if PST persists for many particles in the presence of interactions. We show that if single-particle PST occurs on one-dimensional weighted path graphs, then systems of hard-core bosons undergoing quantum walks on these paths also undergo PST. The analysis extends the Tonks-Girardeau ansatz to weighted graphs using techniques in algebraic graph theory. The results suggest that hard-core bosons do not generically undergo PST, even on graphs which exhibit single-particle PST.

arXiv:1412.1022•Physical Review A•Mar 24, 2015•4 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
The ability to accurately transfer quantum information through networks is an important primitive in distributed quantum systems. While perfect quantum state transfer (PST) can be effected by a single particle undergoing continuous-time quantum walks on a variety of graphs, it is not known if PST persists for many particles in the presence of interactions. We show that if single-particle PST occurs on one-dimensional weighted path graphs, then systems of hard-core bosons undergoing quantum walks on these paths also undergo PST. The analysis extends the Tonks-Girardeau ansatz to weighted graphs using techniques in algebraic graph theory. The results suggest that hard-core bosons do not generically undergo PST, even on graphs which exhibit single-particle PST.
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.