From Fermions to Qubits: A ZX-Calculus Perspective
- URL: http://arxiv.org/abs/2505.06212v1
- Date: Fri, 09 May 2025 17:42:01 GMT
- Title: From Fermions to Qubits: A ZX-Calculus Perspective
- Authors: Haytham McDowall-Rose, Razin A. Shaikh, Lia Yeh,
- Abstract summary: We present a graphical framework for fermion-to-qubit mappings that unifies various representations through the ZX-calculus.<n>We graphically prove that ternary tree transformations are equivalent to linear encodings.<n> Lastly, we present the graphical representation of local fermion-to-qubit encodings.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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.
Related papers
- Quantum Computing from Graphs [0.0]
We introduce a representation of stabilizer codes as graphs with certain structures.<n>The graph representation gives insight into both code construction and algorithms.<n>We also use graphs to extend the quantum Gilbert-Varshamov bound to a three-way distance-rate-weight trade-off.
arXiv Detail & Related papers (2025-01-29T19:47:39Z) - Ternary tree transformations are equivalent to linear encodings of the Fock basis [1.0884863227198973]
We propose a universal description of fermion-qubit mappings.<n>We show that every product-preserving ternary tree transformation is equivalent to a linear encoding of the Fock basis.
arXiv Detail & Related papers (2024-12-10T15:14:02Z) - Graph Transformers Dream of Electric Flow [72.06286909236827]
We show that the linear Transformer, when applied to graph data, can implement algorithms that solve canonical problems.<n>We present explicit weight configurations for implementing each algorithm, and we bound the constructed Transformers' errors by the errors of the underlying algorithms.<n>Our work is an initial step towards elucidating the inner-workings of the Transformer for graph data.
arXiv Detail & Related papers (2024-10-22T05:11:45Z) - Dynamically generated concatenated codes and their phase diagrams [0.0]
We formulate code concatenation as the action of a unitary quantum circuit on an expanding tree geometry.
In the presence of bulk errors, the coding phase is a type of spin glass, characterized by a distribution of failure probabilities.
arXiv Detail & Related papers (2024-09-20T17:51:50Z) - A Sierpinski Triangle Fermion-to-Qubit Transform [0.876484595372461]
We present a novel fermion-to-qubit encoding based on the recently discovered "Sierpinski tree" data structure.
This encoding has the additional benefit of encoding the fermionic states as computational basis states.
arXiv Detail & Related papers (2024-09-06T15:29:09Z) - Equivalence Classes of Quantum Error-Correcting Codes [49.436750507696225]
Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes.
We represent QECC's in a form called a ZX diagram, consisting of a tensor network.
arXiv Detail & Related papers (2024-06-17T20:48:43Z) - Generating Graphs via Spectral Diffusion [48.70458395826864]
We present GGSD, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process.<n>An extensive set of experiments on both synthetic and real-world graphs demonstrates the strengths of our model against state-of-the-art alternatives.
arXiv Detail & Related papers (2024-02-29T09:26:46Z) - A ZX-Calculus Approach for the Construction of Graph Codes [2.136983452580014]
Quantum Error-Correcting Codes (QECCs) play a crucial role in enhancing the robustness of quantum computing and communication systems against errors.
Within the realm of QECCs, stabilizer codes, and specifically graph codes, stand out for their distinct attributes and promising utility in quantum technologies.
This study underscores the significance of devising expansive QECCs and adopts the ZX-calculus a graphical language adept at quantum computational reasoning.
arXiv Detail & Related papers (2023-04-17T15:24:28Z) - Homological Quantum Rotor Codes: Logical Qubits from Torsion [47.52324012811181]
homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code.<n>We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
arXiv Detail & Related papers (2023-03-24T00:29:15Z) - Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages.
The computation can then be implemented using a series of non-Pauli measurements on this graph state.
arXiv Detail & Related papers (2022-09-15T14:52:31Z) - Circuit Extraction for ZX-diagrams can be #P-hard [0.0]
Some applications for the ZX-calculus rely on being able to efficiently translate a ZX-diagram back into a quantum circuit of comparable size.
In this paper we show that the circuit extraction problem is #P-hard, and so is itself at least as hard as strong simulation of quantum circuits.
arXiv Detail & Related papers (2022-02-18T13:50:24Z) - Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs.
Super-Quantum Encoders [67.12391801199688]
We investigate dense coding by imposing various locality restrictions to our decoder.
In this task, the sender Alice and the receiver Bob share an entangled state.
arXiv Detail & Related papers (2021-09-26T07:29:54Z) - Learning Graphon Autoencoders for Generative Graph Modeling [91.32624399902755]
Graphon is a nonparametric model that generates graphs with arbitrary sizes and can be induced from graphs easily.
We propose a novel framework called textitgraphon autoencoder to build an interpretable and scalable graph generative model.
A linear graphon factorization model works as a decoder, leveraging the latent representations to reconstruct the induced graphons.
arXiv Detail & Related papers (2021-05-29T08:11:40Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.