Preparations for Quantum Simulations of Quantum Chromodynamics in 1+1 Dimensions: (I) Axial Gauge
Authors: Roland C. Farrell, Ivan A. Chernyshev, Sarah J. M. Powell, Nikita A. Zemlevskiy, Marc Illa, Martin J. Savage
AI-generated Key Points
- Development of tools for quantum simulations of $1+1$ dimensional QCD
- System formulated in axial gauge with two flavors of quarks
- Simulation requires 12 qubits per spatial site, including gauge fields
- Utilization of classical computations and D-Wave's quantum annealer Advantage
- Discovery of confined color edge states within a screening length
- Use of IBM's 7-qubit quantum computers for dynamics computation in one-flavor QCD
- Development of Hamiltonian and quantum circuits for time evolution in $1+1$ dimensional $SU(N_c)$ gauge theory with $N_f$ flavors of quarks
- Estimation of resource requirements for large-scale quantum simulations
- Advancement in simulating QCD in lower dimensions using classical and quantum computing technologies
Abstract: Tools necessary for quantum simulations of $1+1$ dimensional quantum chromodynamics are developed. When formulated in axial gauge and with two flavors of quarks, this system requires 12 qubits per spatial site with the gauge fields included via non-local interactions. Classical computations and D-Wave's quantum annealer Advantage are used to determine the hadronic spectrum, enabling a decomposition of the masses and a study of quark entanglement. Color edge states confined within a screening length of the end of the lattice are found. IBM's 7-qubit quantum computers, ibmq_jakarta and ibm_perth, are used to compute dynamics from the trivial vacuum in one-flavor QCD with one spatial site. More generally, the Hamiltonian and quantum circuits for time evolution of $1+1$ dimensional $SU(N_c)$ gauge theory with $N_f$ flavors of quarks are developed, and the resource requirements for large-scale quantum simulations are estimated.
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.
The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.
⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.
Similar papers summarized with our AI tools
Navigate through even more similar papers through a
tree representationLook for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.