Related papers: Custom fermionic codes for quantum simulation
Present quantum computers often work with distinguishable qubits as their computational units. In order to simulate indistinguishable fermionic particles, it is first required to map the fermionic state to the state of the qubits. The…
We describe a general method for turning quantum circuits into sparse quantum subsystem codes. The idea is to turn each circuit element into a set of low-weight gauge generators that enforce the input-output relations of that circuit…
The simulation of complex quantum systems on a quantum computer is studied, taking the kicked Harper model as an example. This well-studied system has a rich variety of dynamical behavior depending on parameters, displays interesting…
In this work, our main objective is to construct quantum codes from quasi-twisted (QT) codes. At first, a necessary and sufficient condition for Hermitian self-orthogonality of QT codes is introduced by virtue of the Chinese Remainder…
We shall revisit the conventional treatment of open quantum devices based on the Wigner-Function formalism. Our analysis will show that the artificial spatial separation between device active region and external reservoirs -properly defined…
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…
Current quantum simulators are primarily qubit-based, making them naturally suitable for simulating 2-level quantum systems. However, many systems in nature are inherently $d$-level, including higher spins, bosons, vibrational modes, and…
We introduce a fresh scheme based on the local hidden variable models to quantify nonlocality for arbitrarily high-dimensional quantum systems. Our scheme explores the minimal amount of white noise that must be added to the system in order…
Simulation of quantum many-body systems is a promising application of quantum computers. However, implementing the time-evolution operator as a quantum circuit efficiently on near-term devices with limited resources is challenging. Standard…
The Jordan-Wigner transformation maps a one-dimensional spin-1/2 system onto a fermionic model without spin degree of freedom. A double chain of quantum bits with XX and ZZ couplings of neighboring qubits along and between the chains,…
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…
We propose the implementation of a switch of particle statistics with an embedding quantum simulator. By encoding both Bose-Einstein and Fermi-Dirac statistics into an enlarged Hilbert space, the statistics of quantum particles may be…
Variational compression can significantly lower implementation overheads for encoding the time evolution of Hamiltonians into quantum circuits. However, they usually lack global convergence guarantees and well-established scaling behavior.…
In designing and optimizing new-generation nanomaterials and related quantum devices, dissipation versus decoherence phenomena are often accounted for via local scattering models, such as relaxation-time and Boltzmann-like schemes. Here we…
Quantum error-correcting codes aim to protect information in quantum systems to enable fault-tolerant quantum computations. The most prevalent method, stabilizer codes, has been well developed for many varieties of systems, however, largely…
The famous, yet unsolved, Fermi-Hubbard model for strongly-correlated electronic systems is a prominent target for quantum computers. However, accurately representing the Fermi-Hubbard ground state for large instances may be beyond the…
Recent progress in the development of quantum technologies has enabled the direct investigation of dynamics of increasingly complex quantum many-body systems. This motivates the study of the complexity of classical algorithms for this…
Quantum Fourier transform (QFT) is a widely used building block for quantum algorithms, whose scalable implementation is challenging in experiments. Here, we propose a protocol of quadratic quantum Fourier transform (QQFT), considering cold…
Current and near-term quantum hardware is constrained by limited qubit counts, circuit depth, and the high cost of repeated measurements. We address these challenges for solid state Hamiltonians by introducing a logarithmic-qubit encoding…
Recently we developed a local and constructive algorithm based on Lie algebraic methods for compressing Trotterized evolution under Hamiltonians that can be mapped to free fermions. The compression algorithm yields a circuit which scales…