Related papers: Fermihedral: On the Optimal Compilation for Fermio…
Quantum computation of vibrational properties of molecules is a promising platform to obtain computational advantages for computational chemistry. However, fault-tolerant quantum computations of vibrational properties remain a relatively…
Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep…
The Fermionic Neural Network (FermiNet) is a recently-developed neural network architecture that can be used as a wavefunction Ansatz for many-electron systems, and has already demonstrated high accuracy on small systems. Here we present…
We present a novel input scheme for general second-quantized Hamiltonians of relativistic or non-relativistic many-fermion systems. This input scheme incorporates the fermionic anticommutation relations, particle number variations, and…
Block-encodings of matrices have become an essential element of quantum algorithms derived from the quantum singular value transformation. This includes a variety of algorithms ranging from the quantum linear systems problem to quantum…
We introduce novel algorithms for the quantum simulation of molecular systems which are asymptotically more efficient than those based on the Trotter-Suzuki decomposition. We present the first application of a recently developed technique…
Simulating quantum systems is one of the most important potential applications of quantum computers. The high-level circuit defining the simulation needs to be compiled into one that complies with hardware limitations such as qubit…
Quantum noise in real-world devices poses a significant challenge in achieving practical quantum advantage, since accurately compiled and executed circuits are typically deep and highly susceptible to decoherence. To facilitate the…
Many promising quantum applications depend on the efficient quantum simulation of an exponentially large sparse Hamiltonian, a task known as sparse Hamiltonian simulation, which is fundamentally important in quantum computation. Although…
This article proposes a formalism which unifies Hamiltonian simulation techniques from different fields. This formalism leads to a competitive method to construct the Hamiltonian simulation with a comprehensible, simple-to-implement circuit…
Quadratic programming over orthogonal matrices encompasses a broad class of hard optimization problems that do not have an efficient quantum representation. Such problems are instances of the little noncommutative Grothendieck problem…
The simulation of quantum many-body systems, relevant for quantum chemistry and condensed matter physics, is one of the most promising applications of near-term quantum computers before fault-tolerance. However, since the vast majority of…
We propose a procedure for the robust preparation of maximally entangled states of identical fermionic qubits, studying the role played by particle statistics in the process. The protocol exploits externally activated noisy channels to…
Assemblies of strongly interacting fermions, whether in a condensed-matter or a quantum chemistry context, range amongst the most promising candidate systems for which quantum computing platforms could provide an advantage. Near-term…
Quantum compilation is the problem of translating an input quantum circuit into the most efficient equivalent of itself, taking into account the characteristics of the device that will execute the computation. Compilation strategies are…
The operator algebra of fermionic modes is isomorphic to that of qubits, the difference between them is twofold: the embedding of subalgebras corresponding to mode subsets and multiqubit subsystems on the one hand, and the parity…
Quantum computing is being extensively used in quantum chemistry, especially in simulating simple molecules and evaluating properties like the ground state energy, dipole moment, etc. The transformation of a molecular Hamiltonian from the…
To simulate a fermionic system on a quantum computer, it is necessary to encode the state of the fermions onto qubits. Fermion-to-qubit mappings such as the Jordan-Wigner and Bravyi-Kitaev transformations do this using $N$ qubits to…
We construct quantum circuits which exactly encode the spectra of correlated electron models up to errors from rotation synthesis. By invoking these circuits as oracles within the recently introduced "qubitization" framework, one can use…
Quantum approximate optimization algorithm (QAOA) has attracted much attention as an algorithm that has the potential to efficiently solve combinatorial optimization problems. Among them, a fermionic QAOA (FQAOA) for solving constrained…