Related papers: Fermion Sampling: a robust quantum computational a…
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…
Analog quantum simulation allows for assessing static and dynamical properties of strongly correlated quantum systems to high precision. To perform simulations outside the reach of classical computers, accurate and reliable implementations…
We show that fermionic atoms have crucial advantages over bosonic atoms in terms of loading in optical lattices for use as a possible quantum computation device. After analyzing the change in the level structure of a non-uniform confining…
The Feynman path integral formalism has inspired the development of memory-efficient and parallelizable classical algorithms for simulating quantum computers. We adapt this approach for the calculation of probability amplitudes of…
Many quantum algorithms can be represented in a form of a classical circuit positioned between quantum Fourier transformations. Motivated by the search for new quantum algorithms, we turn to circuits where the latter transformation is…
We formulate and characterize a new constraint for Auxiliary Field Quantum Monte Carlo (AFQMC) applicable for general fermionic systems, which allows for the accumulation of phase in the random walk but disallows walkers with a magnitude of…
Compressible models extend the domain of simulable systems in quantum computers, but little is known about their precise limits of applicability. Using the theory of compressible matchgate circuits, we identify a class of quadratic…
This paper introduces Fermihedral, a compiler framework focusing on discovering the optimal Fermion-to-qubit encoding for targeted Fermionic Hamiltonians. Fermion-to-qubit encoding is a crucial step in harnessing quantum computing for…
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms.…
This paper introduces an innovative approach for representing Gaussian fermionic states, pivotal in quantum spin systems and fermionic models, within a range of alternative quantum bases. We focus on transitioning these states from the…
Recently, Motes, Gilchrist, Dowling & Rohde [Phys. Rev. Lett. 113, 120501 (2014)] presented a scheme for photonic boson-sampling using a fiber-loop architecture. Here we show that the same architecture can be modified to implement full,…
Compiling shallow and accurate quantum circuits for Hamiltonian simulation remains challenging due to hardware constraints and the combinatorial complexity of minimizing gate count and circuit depth. Existing optimization method pipelines…
Simulating fermions coupled to spin degrees of freedom, relevant for a range of quantum field theories, represents a promising application for quantum simulators. Mapping fermions to qubits is challenging in $2+1$ and higher spacetime…
In ab-initio electronic structure simulations, fermion-to-qubit mappings represent the initial encoding step of the fermionic problem into qubits. This work introduces a physically-inspired method for constructing mappings that…
We review the path integral method wherein quantum systems are mapped with Feynman's path integrals onto a classical system of "ring-polymers" and then simulated with the Monte Carlo technique. Bose or Fermi statistics correspond to…
Identifying the boundary beyond which quantum machines provide a computational advantage over their classical counterparts is a crucial step in charting their usefulness. Gaussian Boson Sampling (GBS), in which photons are measured from a…
Quantum computers potentially have an exponential advantage over classical computers for the quantum simulation of many-fermion quantum systems. Nonetheless, fermions are more expensive to simulate than bosons due to the fermionic encoding…
Linear optics quantum computing (LOQC) is a leading candidate for the implementation of large scale quantum computers. Here quantum information is encoded into the quantum states of light and computation proceeds via a linear optics…
Fermionic atoms in optical lattices provide a native implementation of Fermi-Hubbard (FH) models that can be used as analog quantum simulators of many-body fermionic systems. Recent experimental advances include the time-dependent local…
We propose efficient classical algorithms which (strongly) simulate the action of bosonic linear optics circuits applied to superpositions of Gaussian states. Our approach relies on an augmented covariance matrix formalism to keep track of…