Related papers: Discovering optimal fermion-qubit mappings through…
We present several improvements to the standard Trotter-Suzuki based algorithms used in the simulation of quantum chemistry on a quantum computer. First, we modify how Jordan-Wigner transformations are implemented to reduce their cost from…
In the last years, we have been witnessing a tremendous push to demonstrate that quantum computers can solve classically intractable problems. This effort, initially focused on the hardware, progressively included the simplification of the…
An algorithm for the generation of shuttling sequences is necessary for the operation of a linear segmented ion-trap quantum computer. The present work provides an implementation of an algorithm that produces sequences proved to be optimal…
We provide a new approach to error mitigation for quantum chemistry simulation that uses a Bravyi-Kitaev Superfast encoding to implement a quantum error detecting code within the fermionic encoding. Our construction has low-weight parity…
We describe our implementation of fermionic tensor network contraction on arbitrary lattices within both a globally ordered and locally ordered formalism. We provide a pedagogical description of these two conventions as implemented for the…
We present quantum algorithms, for Hamiltonians of linear combinations of local unitary operators, for Hamiltonian matrix-vector products and for preconditioning with the inverse of shifted reduced Hamiltonian operator that contributes to…
Quantum parameter estimation with Hermitian systems has been applied in various fields, but there are relatively few results concerning non-Hermitian systems. Here, we study the quantum parameter estimation for general non-Hermitian…
Fermionic Gaussian operators are foundational tools in quantum many-body theory, numerical simulation of fermionic dynamics, and fermionic linear optics. While their structure is fully determined by two-point correlations, evaluating their…
In this work we investigate theoretical and computational aspects of novel lattice fermion formulations for the simulation of lattice gauge theories. The lattice approach to quantum gauge theories is an important tool for studying quantum…
We carry out a detailed study of the three-point fermion-photon interaction vertex at one loop order for massive fermions in reduced quantum electrodynamics. This calculation is carried out in arbitrary covariant gauges and space-time…
Fermionic linear optics corresponds to the dynamics of free fermions, and is known to be efficiently simulable classically. We define fermionic anyon models by deforming the fermionic algebra of creation and annihilation operators, and…
This work proposes a protocol for Fermionic Hamiltonian learning. For the Hubbard model defined on a bounded-degree graph, the Heisenberg-limited scaling is achieved while allowing for state preparation and measurement errors. To achieve…
Achieving quantum advantage in efficiently estimating collective properties of quantum many-body systems remains a fundamental goal in quantum computing. While the quantum gradient estimation (QGE) algorithm has been shown to achieve doubly…
We introduce Majorana Propagation, an algorithmic framework for the classical simulation of Fermionic circuits. Inspired by Pauli Propagation, Majorana Propagation operates by applying successive truncations throughout the Heisenberg…
We show that the computational effort for the numerical solution of fermionic quantum systems, occurring e.g., in quantum chemistry, solid state physics, field theory in principle grows with less than the square of the particle number for…
Many-body fermionic systems can be simulated in a hardware-efficient manner using a fermionic quantum processor. Neutral atoms trapped in optical potentials can realize such processors, where non-local fermionic statistics are guaranteed at…
Quantum state tomography is essential for characterizing quantum systems, but it becomes infeasible for large systems due to exponential resource scaling. Overlapping tomography addresses this challenge by reconstructing all $k$-body…
We develop a method to deduce the symmetry properties of many-body Hamiltonians when they are prepared in Jordan-Wigner form for evaluation on quantum computers. Symmetries, such as point-group symmetries in molecules, are apparent in the…
Simulating complex systems remains an ongoing challenge for classical computers, while being recognised as a task where a quantum computer has a natural advantage. In both digital and analogue quantum simulations the system description is…
Simulating computationally hard fermionic systems is a promising application of quantum computing. However, mapping nonlocal fermionic operators to qubits often produces deep circuits, rendering such simulations impractical on near-term…