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

A Sierpinski Triangle Fermion-to-Qubit Transform

Brent Harrison, Mitchell Chiew, Jason Necaise, Andrew M. Projansky, Sergii Strelchuk, James Daniel Whitfield

Published Sep 6, 2024• 14 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2409.04348

Related papers

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

Mitchell Chiew, Brent Harrison, Sergii Strelchuk

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.

arXiv:2412.07578•Dec 10, 2024•11 citations

Operator locality in the quantum simulation of fermionic models

Vojtěch Havlíček, Matthias Troyer, James Daniel Whitfield

Simulating fermionic lattice models with qubits requires mapping fermionic degrees of freedom to qubits. The simplest method for this task, the Jordan-Wigner transformation, yields strings of Pauli operators acting on an extensive number of qubits. This overhead can be a hindrance to implementation of qubit-based quantum simulators, especially in the analog context. Here we thus review and analyze alternative fermion-to-qubit mappings, including the two approaches by Bravyi and Kitaev and the auxiliary fermion transformation. The Bravyi-Kitaev transform is reformulated in terms of a classical data structure and generalized to achieve a further locality improvement for local fermionic models on a rectangular lattice. We conclude that the most compact encoding of the fermionic operators can be done using ancilla qubits with the auxiliary fermion scheme. Without introducing ancillas, a variant of the Bravyi-Kitaev transform provides the most compact fermion-to-qubit mapping for Hubbard-like models.

arXiv:1701.07072•Physical Review A•Mar 29, 2017•104 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

The Bravyi-Kitaev transformation for quantum computation of electronic structure

Jacob T. Seeley, Martin J. Richard, Peter J. Love

Quantum simulation is an important application of future quantum computers with applications in quantum chemistry, condensed matter, and beyond. Quantum simulation of fermionic systems presents a specific challenge. The Jordan-Wigner transformation allows for representation of a fermionic operator by O(n) qubit operations. Here, we develop an alternative method of simulating fermions with qubits, first proposed by Bravyi and Kitaev [Ann. Phys. 298, 210 (2002); e-print arXiv:quant-ph/0003137v2], that reduces the simulation cost to O(log n) qubit operations for one fermionic operation. We apply this new Bravyi-Kitaev transformation to the task of simulating quantum chemical Hamiltonians, and give a detailed example for the simplest possible case of molecular hydrogen in a minimal basis. We show that the quantum circuit for simulating a single Trotter time step of the Bravyi-Kitaev derived Hamiltonian for H(2) requires fewer gate applications than the equivalent circuit derived from the Jordan-Wigner transformation. Since the scaling of the Bravyi-Kitaev method is asymptotically better than the Jordan-Wigner method, this result for molecular hydrogen in a minimal basis demonstrates the superior efficiency of the Bravyi-Kitaev method for all quantum computations of electronic structure.

arXiv:1208.5986•The Journal of Chemical Physics•Dec 12, 2012•652 citations

Quantum codes for quantum simulation of fermions on a square lattice of qubits

Mark Steudtner, Stephanie Wehner

Quantum simulation of fermionic systems is a promising application of quantum computers, but to program them, we need to map fermionic states and operators to qubit states and quantum gates. While quantum processors may be built as two-dimensional qubit networks with couplings between nearest neighbors, standard fermion-to-qubit mappings do not account for that kind of connectivity. In this work we concatenate the (one-dimensional) Jordan-Wigner transform with specific quantum codes defined under the addition of a certain number of auxiliary qubits. This yields a class of mappings with which any fermionic system can be embedded in a two-dimensional qubit setup, fostering scalable quantum simulation. Our technique is demonstrated on the two-dimensional Fermi-Hubbard model, which we transform into a local Hamiltonian. What is more, we adapt the Verstraete-Cirac transform and Bravyi-Kitaev superfast simulation to the square lattice connectivity and compare them to our mappings. An advantage of our approach in this comparison is that it allows us to encode and decode a logical state with a simple unitary quantum circuit.

arXiv:1810.02681•Physical Review A•Feb 8, 2019•62 citations

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
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.
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.
Simulating fermionic lattice models with qubits requires mapping fermionic degrees of freedom to qubits. The simplest method for this task, the Jordan-Wigner transformation, yields strings of Pauli operators acting on an extensive number of qubits. This overhead can be a hindrance to implementation of qubit-based quantum simulators, especially in the analog context. Here we thus review and analyze alternative fermion-to-qubit mappings, including the two approaches by Bravyi and Kitaev and the auxiliary fermion transformation. The Bravyi-Kitaev transform is reformulated in terms of a classical data structure and generalized to achieve a further locality improvement for local fermionic models on a rectangular lattice. We conclude that the most compact encoding of the fermionic operators can be done using ancilla qubits with the auxiliary fermion scheme. Without introducing ancillas, a variant of the Bravyi-Kitaev transform provides the most compact fermion-to-qubit mapping for Hubbard-like models.
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.
Quantum simulation is an important application of future quantum computers with applications in quantum chemistry, condensed matter, and beyond. Quantum simulation of fermionic systems presents a specific challenge. The Jordan-Wigner transformation allows for representation of a fermionic operator by O(n) qubit operations. Here, we develop an alternative method of simulating fermions with qubits, first proposed by Bravyi and Kitaev [Ann. Phys. 298, 210 (2002); e-print arXiv:quant-ph/0003137v2], that reduces the simulation cost to O(log n) qubit operations for one fermionic operation. We apply this new Bravyi-Kitaev transformation to the task of simulating quantum chemical Hamiltonians, and give a detailed example for the simplest possible case of molecular hydrogen in a minimal basis. We show that the quantum circuit for simulating a single Trotter time step of the Bravyi-Kitaev derived Hamiltonian for H(2) requires fewer gate applications than the equivalent circuit derived from the Jordan-Wigner transformation. Since the scaling of the Bravyi-Kitaev method is asymptotically better than the Jordan-Wigner method, this result for molecular hydrogen in a minimal basis demonstrates the superior efficiency of the Bravyi-Kitaev method for all quantum computations of electronic structure.
Quantum simulation of fermionic systems is a promising application of quantum computers, but to program them, we need to map fermionic states and operators to qubit states and quantum gates. While quantum processors may be built as two-dimensional qubit networks with couplings between nearest neighbors, standard fermion-to-qubit mappings do not account for that kind of connectivity. In this work we concatenate the (one-dimensional) Jordan-Wigner transform with specific quantum codes defined under the addition of a certain number of auxiliary qubits. This yields a class of mappings with which any fermionic system can be embedded in a two-dimensional qubit setup, fostering scalable quantum simulation. Our technique is demonstrated on the two-dimensional Fermi-Hubbard model, which we transform into a local Hamiltonian. What is more, we adapt the Verstraete-Cirac transform and Bravyi-Kitaev superfast simulation to the square lattice connectivity and compare them to our mappings. An advantage of our approach in this comparison is that it allows us to encode and decode a logical state with a simple unitary quantum circuit.
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.