Related papers: Tapering off qubits to simulate fermionic Hamilton…

Here we describe an approach for simulating electronic structure on quantum computers with significantly lower asymptotic complexity than prior work. The approach uses a real-space first-quantised representation of the molecular Hamiltonian…

We propose a method for the efficient quantum simulation of fermionic systems with superconducting circuits. It consists in the suitable use of Jordan-Wigner mapping, Trotter decomposition, and multiqubit gates, be with the use of a quantum…

We present the Quantum Paldus Transform: an efficient quantum algorithm for block-diagonalising fermionic, spin-free Hamiltonians in the second quantisation. Our algorithm implements an isometry between the occupation number basis of a…

As quantum devices scale up, many-body quantum gates and algorithms begin to surpass what is possible to simulate classically. Validation methods which rely on such classical simulation, such as process tomography and randomized…

Quantum chemistry provides a target for quantum simulation of considerable scientific interest and industrial importance. The majority of algorithms to date have been based on a second-quantized representation of the electronic structure…

We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…

The advent of quantum computing necessitates the transition of worldwide cryptosystems to post-quantum cryptography (PQC), which is founded upon the problem of finding short vectors in high-dimensional structured lattices. It is assumed…

In this paper we present a hybrid scheme for topological quantum computation in a system of cold atoms trapped in an atomic lattice. A topological qubit subspace is defined using Majorana fermions which emerge in a network of atomic Kitaev…

PhD thesis investigating homological quantum codes derived from curved and higher dimensional geometries. In the first part we will consider closed surfaces with constant negative curvature. We show how such surfaces can be constructed and…

Near term quantum devices have recently garnered significant interest as promising candidates for investigating difficult-to-probe regimes in many-body physics. To this end, various qubit encoding schemes targeting second quantized…

Modeling non-Hermitian Hamiltonians is increasingly important in classical and quantum domains, especially when studying open systems, $PT$ symmetry, and resonances. However, the quantum simulation of these models has been limited by the…

Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…

Rydberg-atom quantum simulators are of keen interest because of their possibilities towards high-dimensional qubit architectures. Here we report three-dimensional conformation spectra of quantum-Ising Hamiltonian systems with programmed…

Solving atomic nuclei from first principles places enormous demands on computational resources, which grow exponentially with increasing number of particles and the size of the space they occupy. We present first quantum simulations based…

Qubitization is a modern approach to estimate Hamiltonian eigenvalues without simulating its time evolution. While in this way approximation errors are avoided, its resource and gate requirements are more extensive: qubitization requires…

In order to simulate a system of fermions on a quantum computer, it is necessary to represent the fermionic states and operators on qubits. This can be accomplished in multiple ways, including the well-known Jordan-Wigner transform, as well…

Quantum error mitigation (QEM) has emerged as a powerful tool for the extraction of useful quantum information from quantum devices. Here, we introduce the Subspace Noise Tailoring (SNT) algorithm, which efficiently combines the cheap cost…

We propose and analyze a set of variational quantum algorithms for solving quadratic unconstrained binary optimization problems where a problem consisting of $n_c$ classical variables can be implemented on $\mathcal O(\log n_c)$ number of…

In recent work [arXiv:2003.06939v2] a novel fermion to qubit mapping -- called the compact encoding -- was introduced which outperforms all previous local mappings in both the qubit to mode ratio, and the locality of mapped operators. There…

Experimental studies of synthetic quantum matter are necessarily restricted to approximate ground states prepared on finite-size quantum simulators. In general, this limits their reliability for strongly correlated systems, for instance, in…