A5009406261- Quantum Computing Algorithms and Architecture
- Particle physics theoretical and experimental studies
- Quantum Chromodynamics and Particle Interactions
- Quantum and electron transport phenomena
- Muon and positron interactions and applications
- Quantum Information and Cryptography
- High-Energy Particle Collisions Research
- Quantum many-body systems
- Parallel Computing and Optimization Techniques
- Atomic and Molecular Physics
- Black Holes and Theoretical Physics
- Computational Physics and Python Applications
- Advanced Data Storage Technologies
- Physics of Superconductivity and Magnetism
- Quantum-Dot Cellular Automata
- Quantum Mechanics and Applications
- Distributed and Parallel Computing Systems
- Theoretical and Computational Physics
- Low-power high-performance VLSI design
- Dark Matter and Cosmic Phenomena
- Medical Imaging Techniques and Applications
- Cosmology and Gravitation Theories
- Nanotechnology research and applications
- Neural Networks and Reservoir Computing
- Scientific Computing and Data Management
Fermi National Accelerator Laboratory
2020-2025
University of Maryland, College Park
2017-2022
Arizona State University
2013-2017
University of Regensburg
2016
It is for the first time that quantum simulation high-energy physics (HEP) studied in U.S. decadal particle-physics community planning, and fact until recently, this was not considered a mainstream topic community. This speaks of remarkable rate growth subfield over past few years, stimulated by impressive advancements information sciences (QIS) associated technologies decade, significant investment area government private sectors other countries. High-energy physicists have quickly...
The utility of quantum computers for simulating lattice gauge theories is currently limited by the noisiness physical hardware. Various error mitigation strategies exist to reduce statistical and systematic uncertainties in simulations via improved algorithms analysis strategies. We perform ${\mathbb{Z}}_{2}$ theory with matter study efficacy interplay different methods: readout mitigation, randomized compiling, rescaling, dynamical decoupling. compute Minkowski correlation functions this...
A general scheme is presented for simulating gauge theories, with matter fields, on a digital quantum computer. Trotterized time-evolution operator that respects symmetry constructed, and procedure obtaining time-separated, gauge-invariant operators detailed. We demonstrate the small lattices, including simulation of 2+1D non-Abelian theory.
We present a hybrid quantum-classical algorithm for the time evolution of out-of-equilibrium thermal states. The method depends on classically computing sparse approximation to density matrix and, then, time-evolving each element via quantum computer. For this exploratory study, we investigate time-dependent Ising model with five spins Rigetti Forest virtual machine and one spin system 8Q-Agave processor.
Simulations of gauge theories on quantum computers require the digitization continuous field variables. Digitization schemes that use minimum amount qubits are desirable. We present a practical scheme for digitizing $SU(3)$ via its discrete subgroup $S(1080)$. The $S(1080)$ standard Wilson action cannot be used since phase transition occurs as coupling is decreased, well before scaling regime. propose modified allows simulations in window and carry out classical Monte Carlo calculations down...
We construct a primitive gate set for the digital quantum simulation of 48-element binary octahedral (<a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"><a:mrow><a:mi mathvariant="double-struck">BO</a:mi></a:mrow></a:math>) group. This non-Abelian discrete group better approximates <d:math xmlns:d="http://www.w3.org/1998/Math/MathML" display="inline"><d:mi>S</d:mi><d:mi>U</d:mi><d:mo stretchy="false">(</d:mo><d:mn>2</d:mn><d:mo stretchy="false">)</d:mo></d:math> lattice...
We present a general technique for addressing sign problems that arise in Monte Carlo simulations of field theories. This method deforms the domain path integral to manifold complex space maximizes average (therefore reducing problem) within parameterized family manifolds. presents results $1+1$ dimensional Thirring model with Wilson fermions on lattice sizes up $40\times 10$. reaches higher $\mu$ then previous techniques while substantially decreasing computational time required.
We formulate a discretization of $\ensuremath{\sigma}$ models suitable for simulation by quantum computers. Space is substituted with lattice, as usually done in lattice field theory, while the target space (a sphere) replaced ``fuzzy sphere'', construction well known from noncommutative geometry. Contrary to more naive discretizations sphere, this exact O(3) symmetry maintained, which suggests that discretized model same universality class continuum model. That would allow results be...
The generalized thimble method to treat field theories with sign problems requires repeatedly solving the computationally-expensive holomorphic flow equations. We present a machine learning technique bypass this problem. central idea is obtain few configurations via equations train feed-forward neural network. trained network defines new manifold of integration which reduces problem and can be rapidly sampled. results for $1+1$ dimensional Thirring model Wilson fermions on sizable lattices....
Efficient digitization is required for quantum simulations of gauge theories. Schemes based on discrete subgroups use fewer qubits at the cost systematic errors. We systematize this approach by deriving a single plaquette action approximating general continuous groups through integrating out field fluctuations. This provides insight into effectiveness these approximations, and how they could be improved. accompany scheme pure over largest subgroup $SU(3)$ up to third order.
In the future, ab initio quantum simulations of heavy ion collisions may become possible with large-scale fault-tolerant computers. We propose a algorithm for studying these by looking at class observables requiring dramatically smaller volumes: transport coefficients. These form nonperturbative inputs into theoretical models ions; thus, their calculation reduces uncertainties without need full-scale simulation collision. derive necessary lattice operators in Hamiltonian formulation and...
We describe the simulation of dihedral gauge theories on digital quantum computers. The nonabelian discrete group $D_N$ -- serves as an approximation to $U(1)\times\mathbb{Z}_2$ lattice theory. In order carry out such a simulation, we detail construction efficient circuits realize basic primitives including Fourier transform over $D_N$, trace operation, and multiplication inversion operations. For each case required resources scale linearly or low-degree polynomials in $n=\log N$....
We construct a primitive gate set for the digital quantum simulation of binary tetrahedral ($\mathbb{BT}$) group on two architectures. This nonabelian discrete serves as crude approximation to $SU(2)$ lattice gauge theory while requiring five qubits or one quicosotetrit per link. The necessary basic primitives are inversion gate, multiplication trace and $\mathbb{BT}$ Fourier transform over $\mathbb{BT}$. experimentally benchmark gates ibm nairobi, with estimated fidelities between...
Quantum simulations of lattice gauge theories for the foreseeable future will be hampered by limited resources. The historical success improved actions in classical strongly suggests that Hamiltonians with discretization errors reduce quantum resources, i.e., require $\ensuremath{\gtrsim}{2}^{d}$ fewer qubits lattices $d$-spatial dimensions. In this work, we consider $\mathcal{O}({a}^{2})$-improved pure and design corresponding circuits its real-time evolution terms primitive gates. An...
Quantum simulations of QCD require digitization the infinite-dimensional gluon field. Schemes for doing this with minimum amount qubits are desirable. We present a practical $SU(3)$ gauge theories via its discrete subgroup $S(1080)$. Using modified action that allows classical down to $a\ensuremath{\approx}0.08\text{ }\text{ }\mathrm{fm}$, low-lying glueball spectrum is computed percent-level precision at multiple lattice spacings and shown extrapolate continuum limit results. This suggests...
We introduce a block encoding method for mapping discrete subgroups to qubits on quantum computer. This is applicable general groups, including crystal-like such as <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"><a:mrow><a:mi mathvariant="double-struck">BI</a:mi></a:mrow></a:math> of <d:math xmlns:d="http://www.w3.org/1998/Math/MathML" display="inline"><d:mi>S</d:mi><d:mi>U</d:mi><d:mo stretchy="false">(</d:mo><d:mn>2</d:mn><d:mo stretchy="false">)</d:mo></d:math> and...
We construct the primitive gate set for digital quantum simulation of 108-element <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"><a:mi mathvariant="normal">Σ</a:mi><a:mo stretchy="false">(</a:mo><a:mn>36</a:mn><a:mo>×</a:mo><a:mn>3</a:mn><a:mo stretchy="false">)</a:mo></a:math> group. This is first time a non-Abelian crystal-like subgroup <f:math xmlns:f="http://www.w3.org/1998/Math/MathML" display="inline"><f:mi>S</f:mi><f:mi>U</f:mi><f:mo...
We present Monte Carlo calculations of the thermodynamics (2+1)-dimensional Thirring model at finite density. bypass sign problem by deforming domain integration path integral into complex space in such a way as to maximize average within parameterized family manifolds. results for lattice sizes up 10^{3} and we find that high densities and/or temperatures chiral condensate is abruptly reduced.
Preparing strongly-coupled particle states on quantum computers requires large resources. In this work, we show how classical sampling coupled with projection operators can be used to compute Minkowski matrix elements without explicitly preparing these the computer. We demonstrate for 2+1d $\mathbb{Z}_2$ lattice gauge theory small lattices a simulator.
Path integral contour deformations have been shown to mitigate sign and signal-to-noise problems associated with phase fluctuations in lattice field theories. We define a family of applicable $SU(N)$ gauge theory that can reduce complex actions observables. For observables, these contours be used deformed observables identical expectation value but different variance. As proof-of-principle, we apply machine learning techniques optimize the Wilson loops two dimensional $SU(2)$ $SU(3)$ theory....
Efficient digitization is required for quantum simulations of gauge theories. Schemes based on discrete subgroups use a smaller, fixed number qubits at the cost systematic errors. We systematize this approach by deriving single plaquette action through matching continuous group to that one via character expansions modulo field fluctuation contributions. accompany scheme pure over largest crystal-like subgroup $SU(3)$ up fifth order in coupling constant.
One strategy for reducing the sign problem in finite-density field theories is to deform path integral contour from real complex fields. If deformed manifold appropriate combination of Lefschetz thimbles -- or somewhat close them alleviated. Gauge lack a well-defined thimble decomposition, and therefore it unclear how carry out generalized method. In this paper we discuss some conceptual issues involved by applying method $QED_{1+1}$ at finite density, showing that yields correct results...
With advances in quantum computing, new opportunities arise to tackle challenging calculations field theory. We show that trotterized time-evolution operators can be related by analytic continuation the Euclidean transfer matrix on an anisotropic lattice. In turn, trotterization entails renormalization of temporal and spatial lattice spacings. Based tools theory, we propose two schemes determine Minkowski spacings, using data thereby overcoming demands resources for scale setting. addition,...
A bstract We present a model-independent bound on $$ R\left(J/\psi \right)\equiv \mathrm{\mathcal{B}}\mathrm{\mathcal{R}}\left({B}_C^{+}\to J/\psi {\tau}^{+}{\nu}_{\tau}\right)/\mathrm{\mathcal{B}}\mathrm{\mathcal{R}}\left({B}_C^{+}\to {\mu}^{+}{\nu}_{\mu}\right) <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>R</mml:mi> <mml:mfenced> <mml:mrow> <mml:mi>J</mml:mi> <mml:mo>/</mml:mo> <mml:mi>ψ</mml:mi> </mml:mrow> </mml:mfenced> <mml:mtext>≡</mml:mtext> <mml:mi>ℬ</mml:mi>...
Parton distribution functions and hadronic tensors may be computed on a universal quantum computer without many of the complexities that apply to Euclidean lattice calculations. We detail algorithms for computing parton tensor in Thirring model. Their generalization QCD is discussed, with conclusion function best obtained by fitting tensor, rather than direct calculation. As side effect this method, we find lepton-hadron cross sections relatively cheaply. Finally, estimate computational cost...