Related papers: Algebraic Compression of Free Fermionic Quantum Ci…
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…
Simulation of interacting fermionic Hamiltonians is one of the most promising applications of quantum computers. However, the feasibility of analysing fermionic systems with a quantum computer hinges on the efficiency of fermion-to-qubit…
This work proposes a protocol for Fermionic Hamiltonian learning. For the Hubbard model defined on a bounded-degree graph, the Heisenberg-limited scaling is achieved while allowing for state preparation and measurement errors. To achieve…
The quantum simulation of topological phases in (2+1)D quantum electrodynamics with Wilson fermions provides a promising route toward realizing topological phenomena in near-term lattice experiments. We show that the commonly used…
Simulating the dynamics of electrons and other fermionic particles in quantum chemistry, materials science, and high-energy physics is one of the most promising applications of fault-tolerant quantum computers. However, the overhead in…
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather…
Trotterization is a technique that allows one to approximate a time evolution of a Hamiltonian by repeatedly evolving the individual terms of the Hamiltonian one-at-a-time for small time durations. Bounds on the error of this approximation…
Engineering quantum bath networks through non-Hermitian subsystem Hamiltonians has recently emerged as a promising strategy for qubit cooling, state stabilization, and fault-tolerant quantum computation. However, scaling these systems while…
We present a quantum algorithm for simulating the time evolution generated by any bounded, time-dependent operator $-A$ with non-positive logarithmic norm, thereby serving as a natural generalization of the Hamiltonian simulation problem.…
Hamiltonian formulations of lattice field theories provide access to real-time dynamics, but their simulation is difficult to implement efficiently. Trotter-Suzuki decompositions are at the center of time evolution computation, either on…
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…
As physical implementations of quantum architectures emerge, it is increasingly important to consider the cost of algorithms for practical connectivities between qubits. We show that by using an arrangement of gates that we term 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…
As established in the seminal work by Berry et al.[1], expanding the time evolution operator using truncated Taylor series (up to some order $K$) makes a good candidate for simulating Hamiltonian dynamics. Here, we adapt the method but…
We present a proposal for a versatile cold-atom-based quantum simulator of relativistic fermionic theories and topological insulators in arbitrary dimensions. The setup consists of a spin-independent optical lattice that traps a collection…
We present a simulation algorithm for Hamiltonian fermion lattice models. A guiding trial wave function is adaptively optimized during Monte Carlo evolution. We apply the method to the two dimensional Gross-Neveu model and analyze systematc…
In designing quantum control, it is generally required to simulate the controlled system evolution with a classical computer. However, computing the time evolution operator can be quite resource-consuming since the total Hamiltonian is…
We investigate the performance and accuracy of digital quantum algorithms for the study of static and dynamic properties of the fermionic Hubbard model at half-filling with next-nearest neighbour hopping terms. We provide quantum circuits…
We provide a new approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations by a factor of up to…
In optimal quantum-mechanical evolutions, motion can take place along paths of minimal length within an optimal time frame. Alternatively, optimal evolutions may occur along established paths without any waste of energy resources and…