Related papers: Primitive Quantum Gates for Dihedral Gauge Theorie…
We present an entirely 2D transversal realization of phase gates at any level of the Clifford hierarchy, and beyond, using non-Abelian surface codes. Our construction encodes a logical qubit in the quantum double $D(G)$ of a non-Abelian…
Quantum algorithms for factoring and discrete logarithm have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the possibility of extending this general viewpoint to finding hidden…
The digital quantum simulation of lattice gauge theories is expected to become a major application of quantum computers. Measurement-based quantum computation is a widely studied competitor of the standard circuit-based approach. We…
Unitary and non-unitary diagonal operators are fundamental building blocks in quantum algorithms with applications in the resolution of partial differential equations, Hamiltonian simulations, the loading of classical data on quantum…
We show that many well-known signal transforms allow highly efficient realizations on a quantum computer. We explain some elementary quantum circuits and review the construction of the Quantum Fourier Transform. We derive quantum circuits…
A central requirement for the faithful implementation of large-scale lattice gauge theories (LGTs) on quantum simulators is the protection of the underlying gauge symmetry. Recent advancements in the experimental realizations of large-scale…
Lattice gauge theories in varying dimensions, lattice volumes, and truncations offer a rich family of targets for Hamiltonian simulation on quantum devices. In return, formulating quantum simulations can provide new ways of thinking about…
Recent developments in mapping lattice gauge theories relevant to the Standard Model onto digital quantum computers identify scalable paths with well-defined quantum compilation challenges toward the continuum. As an entry point to these…
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,…
We present a novel approach to chiral discrimination using gate-based quantum processors, addressing a key challenge in adapting conventional control techniques using modern quantum computing. Schemes such as stimulated rapid adiabatic…
Lattice gauge theories are fundamental to such distinct fields as particle physics, condensed matter or quantum information theory. The recent progress in the control of artificial quantum systems already allows for studying Abelian lattice…
To date, all proposed quantum algorithms for simulating quantum field theory (QFT) simulate (continuous-time) Hamiltonian lattice QFT as a stepping stone. Two overlooked issues are how large we can take the timestep in these simulations…
An overarching goal in the flourishing field of quantum simulation for high-energy physics is the first-principles study of the microscopic dynamics of scattering processes on a quantum computer. Currently, this is hampered by small system…
We study a method of producing approximately diagonal 1-qubit gates. For each positive integer, the method provides a sequence of gates that are defined iteratively from a fixed diagonal gate and an arbitrary gate. These sequences are…
Rydberg quantum gate serving as an indispensable computing unit for neutral-atom quantum computation, has attracted intense research efforts for the last decade. However the state-of-the-art experiments have not reached the high gate…
The advantage of simulating lattice field theory with quantum computers is hamstrung by the limited resources that induce large errors from finite volume and sizable lattice spacings. Previous work has shown how classical simulations near…
A recent work considered quantum simulation of Quantum Electrodynamics on a lattice in the Coulomb gauge with gauge degrees of freedom represented in the occupation basis in momentum space. Here we consider the more efficient representation…
We show how a robust high-fidelity universal set of quantum gates can be implemented using a single form of non-adiabatic rapid passage whose parameters are optimized to maximize gate fidelity and reward gate robustness. Each gate in the…
High-fidelity quantum gates are essential for large-scale quantum computation. However, any quantum manipulation will inevitably affected by noises, systematic errors and decoherence effects, which lead to infidelity of a target quantum…
We examine the problem of simulating lattice gauge theories on a universal quantum computer. The basic strategy of our approach is to transcribe lattice gauge theories in the Hamiltonian formulation into a Hamiltonian involving only Pauli…