Logical fermions for fault-tolerant quantum simulation

• URL: http://arxiv.org/abs/2110.10280v3
• Date: Fri, 7 Jul 2023 00:20:34 GMT
• Title: Logical fermions for fault-tolerant quantum simulation
• Authors: Andrew J. Landahl and Benjamin C. A. Morrison
• Abstract summary: We show how to absorb fermionic quantum simulation's expensive fermion-to-qubit mapping overhead into the overhead already incurred by surface-code-based fault-tolerant quantum computing. Our approach encodes Dirac fermions, a key data type for simulation applications, directly into logical Majorana fermions.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We show how to absorb fermionic quantum simulation's expensive fermion-to-qubit mapping overhead into the overhead already incurred by surface-code-based fault-tolerant quantum computing. The key idea is to process information in surface-code twist defects, which behave like logical Majorana fermions. Our approach encodes Dirac fermions, a key data type for simulation applications, directly into logical Majorana fermions rather than atop a logical qubit layer in the architecture. Using quantum simulation of the $N$-fermion 2D Fermi-Hubbard model as an exemplar, we demonstrate two immediate algorithmic improvements. First, by preserving the model's locality at the logical level, we reduce the asymptotic Trotter-Suzuki quantum circuit depth from $\mathcal{O}(\sqrt{N})$ in a typical Jordan-Wigner encoding to $\mathcal{O}(1)$ in our encoding. Second, by exploiting optimizations manifest for logical fermions but less obvious for logical qubits, we reduce the $T$-count of the block-encoding \textsc{select} oracle by 20\% over standard implementations, even when realized by logical qubits and not logical fermions.

Related papers

• Fermion-qubit fault-tolerant quantum computing [39.58317527488534]
  We introduce fermion-qubit fault-tolerant quantum computing, a framework which removes this overhead altogether. We show how our framework can be implemented in neutral atoms, overcoming the apparent inability of neutral atoms to implement non-number-conserving gates. Our framework opens the door to fermion-qubit fault-tolerant quantum computation in platforms with native fermions.
  arXiv  Detail & Related papers  (2024-11-13T19:00:02Z)
• Succinct Fermion Data Structures [0.0]
  Simulating fermionic systems on a quantum computer requires representing fermionic states using qubits. We present two new second-quantized fermion encodings of $F$ fermions in $M$ modes.
  arXiv  Detail & Related papers  (2024-10-05T03:16:36Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Quantum simulation of the 1D Fermi-Hubbard model as a $\mathrm{Z}_2$ lattice-gauge theory [0.0]
  We propose a quantum circuit algorithm based on the Fermi-Hubbard model. We show how these conservation laws can be used to implement an efficient error-mitigation scheme.
  arXiv  Detail & Related papers  (2023-05-08T12:04:50Z)
• Graph Neural Network Autoencoders for Efficient Quantum Circuit Optimisation [69.43216268165402]
  We present for the first time how to use graph neural network (GNN) autoencoders for the optimisation of quantum circuits. We construct directed acyclic graphs from the quantum circuits, encode the graphs and use the encodings to represent RL states. Our method is the first realistic first step towards very large scale RL quantum circuit optimisation.
  arXiv  Detail & Related papers  (2023-03-06T16:51:30Z)
• A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
  The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
  arXiv  Detail & Related papers  (2022-01-31T22:19:49Z)
• Qubit-efficient encoding scheme for quantum simulations of electronic structure [5.16230883032882]
  Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits. We propose a qubit-efficient encoding scheme that requires the qubit number to be only logarithmic in the number of configurations that satisfy the required conditions and symmetries. Our proposed scheme and results show the feasibility of quantum simulations for larger molecular systems in the noisy intermediate-scale quantum (NISQ) era.
  arXiv  Detail & Related papers  (2021-10-08T13:20:18Z)
• Second-quantized fermionic operators with polylogarithmic qubit and gate complexity [0.0]
  We present a method for encoding second-quantized fermionic systems in qubits when the number of fermions is conserved. This is the first second-quantized encoding of fermions in qubits whose costs in qubits and gates are both polylogarithmic in $M$.
  arXiv  Detail & Related papers  (2021-09-29T14:53:23Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.