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:2412.07578

Ternary tree transformations are equivalent to linear encodings of the Fock basis

Mitchell Chiew, Brent Harrison, Sergii Strelchuk

Published Dec 10, 2024• 11 citations
arXivHTMLPDF

Abstract

We consider two approaches to designing fermion-qubit mappings: (1) ternary tree transformations, which use Pauli representations of the Majorana operators that correspond to root-to-leaf paths of a tree graph and (2) linear encodings of the Fock basis, such as the Jordan-Wigner and Bravyi-Kitaev transformations, which store linear binary transformations of the fermionic occupation number vectors in the computational basis of qubits. These approaches have emerged as distinct concepts, with little notational consistency between them. In this paper we propose a universal description of fermion-qubit mappings, which reveals the relationship between ternary tree transformations and linear encodings. Using our notation, we show that every product-preserving ternary tree transformation is equivalent to a linear encoding of the Fock basis.

DOI
10.48550/arxiv.2412.07578

Related papers

From Fermions to Qubits: A ZX-Calculus Perspective

Haytham McDowall-Rose, Razin Abdulrauf Shaikh, Yeh, Lia

Mapping fermionic systems to qubits on a quantum computer is often the first step for algorithms in quantum chemistry and condensed matter physics. However, it is difficult to reconcile the many different approaches that have been proposed, such as those based on binary matrices, ternary trees, and stabilizer codes. This challenge is further exacerbated by the many ways to describe them -- transformation of Majorana operators, action on Fock states, encoder circuits, and stabilizers of local encodings -- making it challenging to know when the mappings are equivalent. In this work, we present a graphical framework for fermion-to-qubit mappings that streamlines and unifies various representations through the ZX-calculus. To start, we present the correspondence between linear encodings of the Fock basis and phase-free ZX-diagrams. The commutation rules of scalable ZX-calculus allows us to convert the fermionic operators to Pauli operators under any linear encoding. Next, we give a translation from ternary tree mappings to scalable ZX-diagrams, which not only directly represents the encoder map as a CNOT circuit, but also retains the same structure as the tree. Consequently, we graphically prove that ternary tree transformations are equivalent to linear encodings, a recent result by Chiew et al. The scalable ZX representation moreover enables us to construct an algorithm to directly compute the binary matrix for any ternary tree mapping. Lastly, we present the graphical representation of local fermion-to-qubit encodings. Its encoder ZX-diagram has the same connectivity as the interaction graph of the fermionic Hamiltonian and also allows us to easily identify stabilizers of the encoding.

arXiv:2505.06212•May 9, 2025•6 citations

A Sierpinski Triangle Fermion-to-Qubit Transform

Brent Harrison, Mitchell Chiew, Jason Necaise +3 more

In order to simulate a system of fermions on a quantum computer, it is necessary to represent the fermionic states and operators on qubits. This can be accomplished in multiple ways, including the well-known Jordan-Wigner transform, as well as the parity, Bravyi-Kitaev, and ternary tree encodings. Notably, the Bravyi-Kitaev encoding can be described in terms of a classical data structure, the Fenwick tree. Here we establish a correspondence between a class of classical data structures similar to the Fenwick tree, and a class of one-to-one fermion-to-qubit transforms. We present a novel fermion-to-qubit encoding based on the recently discovered "Sierpinski tree" data structure, which matches the operator locality of the ternary tree encoding, and has the additional benefit of encoding the fermionic states as computational basis states. This is analogous to the formulation of the Bravyi-Kitaev encoding in terms of the Fenwick tree.

arXiv:2409.04348•Sep 6, 2024•14 citations

Optimised Fermion-Qubit Encodings for Quantum Simulation with Reduced Transpiled Circuit Depth

Michael Williams de la Bastida, Thomas M. Bickley, Peter V. Coveney

Simulation of fermionic Hamiltonians with gate-based quantum computers requires the selection of an encoding from fermionic operators to quantum gates, the most widely used being the Jordan-Wigner transform. Many alternative encodings exist, with quantum circuits and simulation results being sensitive to choice of encoding, device connectivity and Hamiltonian characteristics. Non-stochastic optimisation of the ternary tree class of encodings to date has targeted either the device or Hamiltonian. We develop a deterministic method which optimises ternary tree encodings without changing the underlying tree structure. This enables reduction in Pauli-weight without ancillae or additional swap-gate overhead. We demonstrate this method for a variety of encodings, including those which are derived from the qubit connectivity graph of a quantum computer. Numerical results for a suite of standard encoding methods applied to water in the STO-3G basis indicate that our method reduces qDRIFT circuit depths on average by 24.7% and 26.5% for untranspiled and transpiled circuits respectively.

quant-pharXiv:2512.13580•Quantum Science and Technology•Dec 16, 2025•4 citations

Clifford Algebras, Spin Groups and Qubit Trees

Alexander Yu. Vlasov

Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of superfluous branches. The usual Jordan–Wigner construction also may be formally obtained in this approach by bringing the process up to trivial qubit chain (trunk). The methods can also be used for effective simulation of some quantum circuits corresponding to the binary tree structure. The modeling of more general qubit trees, as well as the relationship with the mapping used in the Bravyi–Kitaev transformation, are also briefly discussed. Quanta 2022; 11: 97–114.

arXiv:1904.09912•Quanta•Dec 1, 2022•25 citations

The Encoding Gauge of Fermionic Variational Quantum Algorithms: Classical Simulability is Relative, Trainability is Invariant

S. M. Yousuf Iqbal Tomal, Abdullah Al Shafin

Standard fermion-to-qubit encodings (Jordan–Wigner, Bravyi–Kitaev, the Bravyi–Kitaev tree, parity, ternary tree) are related by Clifford transformations, so they form a gauge group acting on the classical-simulability problem. This code demonstrates the central split: the Pauli weight and causal-cone width are gauge-covariant (re-encoding can lower them exponentially), while the dynamical-Lie-algebra dimension and the non-stabilizerness (magic) are gauge-invariant. Trainability — the cost landscape, the gradient, and the barren-plateau variance — is gauge-invariant to machine precision.

•Jun 29, 2026•0 citations

A Geometric Theory of Fermion-to-Qubit Encodings

Lakshya Nagpal, Nishith Reen, S. R. Hassan

Exact fermion to qubit transformations are conventionally regarded as algorithmic tools that translate many-body Hamiltonians into qubit representations for quantum simulation. Here we show that they also define intrinsic geometric representations whose structure encodes physically meaningful information beyond spectral equivalence. We develop a geometric framework based on weighted hypergraphs and coupling space representations constructed from the Bravyi--Kitaev (BK) and Xia--Bian--Kais (XBK) encodings. Within the BK representation, we introduce a geometric observable that compares the algebraic connectivities of the kinetic and interaction hypergraphs, derive its exact analytical dependence on interaction strength, and uncover two geometric universality classes together with an exact spectral organization originating from the binary tree architecture of the encoding. The complementary XBK representation describes the evolution of encoded Hamiltonians through probability measures in coupling space, where optimal transport quantifies interaction-driven reorganization independently of the spectral analysis. Applications to the Hubbard, spinless tV , single impurity Anderson, and Kitaev models demonstrate that these connectivity and transport based geometric descriptions consistently capture the structural evolution of encoded quantum Hamiltonians across distinct classes of many-body systems. Our results establish hypergraph geometry as a new framework for understanding fermion-to-qubit encodings,revealing that they serve not only as computational mappings but also as geometric representations of quantum many-body Hamiltonians.

quant-pharXiv:2607.14883•Jul 17, 2026•0 citations
We consider two approaches to designing fermion-qubit mappings: (1) ternary tree transformations, which use Pauli representations of the Majorana operators that correspond to root-to-leaf paths of a tree graph and (2) linear encodings of the Fock basis, such as the Jordan-Wigner and Bravyi-Kitaev transformations, which store linear binary transformations of the fermionic occupation number vectors in the computational basis of qubits. These approaches have emerged as distinct concepts, with little notational consistency between them. In this paper we propose a universal description of fermion-qubit mappings, which reveals the relationship between ternary tree transformations and linear encodings. Using our notation, we show that every product-preserving ternary tree transformation is equivalent to a linear encoding of the Fock basis.
Mapping fermionic systems to qubits on a quantum computer is often the first step for algorithms in quantum chemistry and condensed matter physics. However, it is difficult to reconcile the many different approaches that have been proposed, such as those based on binary matrices, ternary trees, and stabilizer codes. This challenge is further exacerbated by the many ways to describe them -- transformation of Majorana operators, action on Fock states, encoder circuits, and stabilizers of local encodings -- making it challenging to know when the mappings are equivalent. In this work, we present a graphical framework for fermion-to-qubit mappings that streamlines and unifies various representations through the ZX-calculus. To start, we present the correspondence between linear encodings of the Fock basis and phase-free ZX-diagrams. The commutation rules of scalable ZX-calculus allows us to convert the fermionic operators to Pauli operators under any linear encoding. Next, we give a translation from ternary tree mappings to scalable ZX-diagrams, which not only directly represents the encoder map as a CNOT circuit, but also retains the same structure as the tree. Consequently, we graphically prove that ternary tree transformations are equivalent to linear encodings, a recent result by Chiew et al. The scalable ZX representation moreover enables us to construct an algorithm to directly compute the binary matrix for any ternary tree mapping. Lastly, we present the graphical representation of local fermion-to-qubit encodings. Its encoder ZX-diagram has the same connectivity as the interaction graph of the fermionic Hamiltonian and also allows us to easily identify stabilizers of the encoding.
In order to simulate a system of fermions on a quantum computer, it is necessary to represent the fermionic states and operators on qubits. This can be accomplished in multiple ways, including the well-known Jordan-Wigner transform, as well as the parity, Bravyi-Kitaev, and ternary tree encodings. Notably, the Bravyi-Kitaev encoding can be described in terms of a classical data structure, the Fenwick tree. Here we establish a correspondence between a class of classical data structures similar to the Fenwick tree, and a class of one-to-one fermion-to-qubit transforms. We present a novel fermion-to-qubit encoding based on the recently discovered "Sierpinski tree" data structure, which matches the operator locality of the ternary tree encoding, and has the additional benefit of encoding the fermionic states as computational basis states. This is analogous to the formulation of the Bravyi-Kitaev encoding in terms of the Fenwick tree.
Simulation of fermionic Hamiltonians with gate-based quantum computers requires the selection of an encoding from fermionic operators to quantum gates, the most widely used being the Jordan-Wigner transform. Many alternative encodings exist, with quantum circuits and simulation results being sensitive to choice of encoding, device connectivity and Hamiltonian characteristics. Non-stochastic optimisation of the ternary tree class of encodings to date has targeted either the device or Hamiltonian. We develop a deterministic method which optimises ternary tree encodings without changing the underlying tree structure. This enables reduction in Pauli-weight without ancillae or additional swap-gate overhead. We demonstrate this method for a variety of encodings, including those which are derived from the qubit connectivity graph of a quantum computer. Numerical results for a suite of standard encoding methods applied to water in the STO-3G basis indicate that our method reduces qDRIFT circuit depths on average by 24.7% and 26.5% for untranspiled and transpiled circuits respectively.
Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of superfluous branches. The usual Jordan–Wigner construction also may be formally obtained in this approach by bringing the process up to trivial qubit chain (trunk). The methods can also be used for effective simulation of some quantum circuits corresponding to the binary tree structure. The modeling of more general qubit trees, as well as the relationship with the mapping used in the Bravyi–Kitaev transformation, are also briefly discussed. Quanta 2022; 11: 97–114.
Standard fermion-to-qubit encodings (Jordan–Wigner, Bravyi–Kitaev, the Bravyi–Kitaev tree, parity, ternary tree) are related by Clifford transformations, so they form a gauge group acting on the classical-simulability problem. This code demonstrates the central split: the Pauli weight and causal-cone width are gauge-covariant (re-encoding can lower them exponentially), while the dynamical-Lie-algebra dimension and the non-stabilizerness (magic) are gauge-invariant. Trainability — the cost landscape, the gradient, and the barren-plateau variance — is gauge-invariant to machine precision.
Exact fermion to qubit transformations are conventionally regarded as algorithmic tools that translate many-body Hamiltonians into qubit representations for quantum simulation. Here we show that they also define intrinsic geometric representations whose structure encodes physically meaningful information beyond spectral equivalence. We develop a geometric framework based on weighted hypergraphs and coupling space representations constructed from the Bravyi--Kitaev (BK) and Xia--Bian--Kais (XBK) encodings. Within the BK representation, we introduce a geometric observable that compares the algebraic connectivities of the kinetic and interaction hypergraphs, derive its exact analytical dependence on interaction strength, and uncover two geometric universality classes together with an exact spectral organization originating from the binary tree architecture of the encoding. The complementary XBK representation describes the evolution of encoded Hamiltonians through probability measures in coupling space, where optimal transport quantifies interaction-driven reorganization independently of the spectral analysis. Applications to the Hubbard, spinless tV , single impurity Anderson, and Kitaev models demonstrate that these connectivity and transport based geometric descriptions consistently capture the structural evolution of encoded quantum Hamiltonians across distinct classes of many-body systems. Our results establish hypergraph geometry as a new framework for understanding fermion-to-qubit encodings,revealing that they serve not only as computational mappings but also as geometric representations of quantum many-body Hamiltonians.