Related papers: Gluon Digitization via Character Expansion for Qua…
Quantum simulation of non-Abelian gauge theories requires careful handling of gauge redundancy. We address this challenge by presenting universal principles for treating gauge symmetry that apply to any quantum simulation approach,…
Quantum noise limits the use of quantum memory in high energy physics simulations. In particular, it breaks the gauge symmetry of stored quantum states. We examine this effect for abelian and nonabelian theories and demonstrate that…
We derive a representation for a lattice U(1) gauge theory with exponential convergence in the number of states used to represent each lattice site that is applicable at all values of the coupling. At large coupling, this representation is…
We provide analytic, numerical and experimental evidence that the amount of noise in digital quantum simulation of local observables can be independent of system size in a number of situations. We provide a microscopic explanation of this…
We propose a practical, scalable, and efficient scheme for quantum computation using spatially separated matter qubits and single photon interference effects. The qubit systems can be NV-centers in diamond, Pauli-blockade quantum dots with…
Quantum computers must be able to function in the presence of decoherence. The simplest strategy for decoherence reduction is dynamical decoupling (DD), which requires no encoding overhead and works by converting quantum gates into…
The study of real-time evolution of lattice quantum field theories using classical computers is known to scale exponentially with the number of lattice sites. Due to a fundamentally different computational strategy, quantum computers hold…
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…
Quantum dots must be tuned precisely to provide a suitable basis for quantum computation. A scalable platform for quantum computing can only be achieved by fully automating the tuning process. One crucial step is to trap the appropriate…
Simulating quantum many-body dynamics is important both for fundamental understanding of physics and practical applications for quantum information processing. Therefore, classical simulation methods have been developed so far.…
Simulating molecules is believed to be one of the early-stage applications for quantum computers. Current state-of-the-art quantum computers are limited in size and coherence, therefore optimizing resources to execute quantum algorithms is…
We argue that the distribution functions for quarks and gluons are computable at small x for sufficiently large nuclei, perhaps larger than can be physically realized. For such nuclei, we argue that weak coupling methods may be used. We…
Characterizing errors on many-qubit quantum computers remains a key challenge to understanding and improving the performance of these devices. Current characterization methods either don't scale beyond a few qubits, or make simplifying…
We propose a quantum algorithm which uses the number of qubits in an optimal way and efficiently simulates a physical model with rich and complex dynamics described by the quantum sawtooth map. The numerical study of the effect of static…
With a focus on universal quantum computing for quantum simulation, and through the example of lattice gauge theories, we introduce rather general quantum algorithms that can efficiently simulate certain classes of interactions consisting…
Quantum computing promises to revolutionize several scientific and technological domains through fundamentally new ways of processing information. Among its most compelling applications is digital quantum simulation, where quantum computers…
Qubit, operator and gate resources required for the digitization of lattice $\lambda\phi^4$ scalar field theories onto quantum computers are considered, building upon the foundational work by Jordan, Lee and Preskill, with a focus towards…
We present a method which, starting directly from QCD, permits a systematic gauge-invariant expansion to be made for all hard processes involving quarkonia in powers of the quark relative velocity, a small natural parameter for heavy quark…
The most scalable proposed methods of simulating lattice fermions on noisy quantum computers employ encodings that eliminate nonlocal operators using a constant factor more qubits and a nontrivial stabilizer group. In this work, we…
Quantum computers are becoming practical for computing numerous applications. However, simulating quantum computing on classical computers is still demanding yet useful because current quantum computers are limited because of computer…