Related papers: Custom fermionic codes for quantum simulation
Quantum computers promise to revolutionise electronic simulations by overcoming the exponential scaling of many-electron problems. While electronic wave functions can be represented using a product of fermionic unitary operators, shallow…
We have shown that quantum systems on finite-dimensional Hilbert spaces are equivalent under local transformations. Using these transformations give rise to a gauge group that connects the hamiltonian operators associated with each quantum…
Despite using a novel model of computation, quantum computers break down programs into elementary gates. Among such gates, entangling gates are the most expensive. In the context of fermionic simulations, we develop a suite of compilation…
The most general method for encoding quantum information is not to encode the information into a subspace of a Hilbert space, but to encode information into a subsystem of a Hilbert space. Recently this notion has led to a more general…
Molecular simulations generally require fermionic encoding in which fermion statistics are encoded into the qubit representation of the wave function. Recent calculations suggest that fermionic encoding of the wave function can be bypassed,…
Discriminating between quantum computing architectures that can provide quantum advantage from those that cannot is of crucial importance. From the fundamental point of view, establishing such a boundary is akin to pinpointing the resources…
We introduce a new family of quantum circuits for which the scrambling of a subspace of non-local operators is classically simulable. We call these circuits `super-Clifford circuits', since the Heisenberg time evolution of these operators…
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 algorithms reformulate computational problems as quantum evolutions in a large Hilbert space. Most quantum algorithms assume that the time-evolution is perfectly unitary and that the full Hilbert space is available. However, in…
We develop theoretical methods for the implementation of creation and destruction operators in separate registers of a quantum computer, allowing for a transparent and dynamical creation and destruction of particle modes in second…
We investigate the power of quantum systems for the simulation of Hamiltonian time evolutions on a cubic lattice under the constraint of translational invariance. Given a set of translationally invariant local Hamiltonians and short range…
Using quantum Monte Carlo simulations, we show that the one-dimensional fermionic Hubbard model in a harmonic potential displays quantum critical behavior at the boundaries of a Mott-insulating region. A local compressibility defined to…
Recently Haah introduced a new quantum error correcting code embedded on a cubic lattice. One of the defining properties of this code is the absence of string logical operator. We present new codes with similar properties by relaxing the…
Formulating a lattice gauge theory using only physical degrees of freedom generically leads to non-local interactions. A local Hamiltonian is desirable for quantum simulation, and this is possible by treating the Hilbert space as a subspace…
It is not possible, using standard lattice techniques in Euclidean space, to calculate the complete fermionic spectrum of a quantum field theory. Algorithms running on quantum computers have the potential to access the theory with real-time…
Supersymmetric models are grounded in the intriguing concept of a hypothetical symmetry that relates bosonic and fermionic particles. This symmetry has profound implications, offering valuable extensions to the Standard Model of particle…
Contextuality, one of the strongest forms of quantum correlations, delineates the quantum world and the classical one. It has been shown recently that some quantum models, in the form of infinite one-dimensional translation-invariant…
We report on our recent efforts to perform realistic simulations of large quantum devices in the time domain. In contrast to d.c. transport where the calculations are explicitly performed at the Fermi level, the presence of time-dependent…
We present efficient quantum circuits for fermionic excitation operators tailored for ion trap quantum computers exhibiting the M{\o}lmer-S{\o}rensen (MS) gate. Such operators commonly arise in the study of static and dynamic properties in…
We present a quantum algorithm for the simulation of molecular systems that is asymptotically more efficient than all previous algorithms in the literature in terms of the main problem parameters. As in previous work [Babbush et al., New…