Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Computing and High Energy Physics

Prasanth Shyamsundar

Published Aug 5, 2024• 0 citations
Publisher

Abstract

Some Difficulties in Quantum Computing… -----------------------------=C=FermilabWe can already run circuits of sufficient size, depth, and entanglement (with reasonable accuracy), that classically simulating them is prohibitively expensive.
DOI
10.2172/2426500

Related papers

Practical framework for simulating permutation-equivariant quantum circuits

Su Yeon Chang, Martin Larocca, M. Cerezo

Understanding which subclasses of quantum circuits are efficiently classically simulable is fundamental to delineating the boundary between classical and quantum computation. In this context, it is well known that certain tasks based on permutation-equivariant unitaries-i.e., $n$-qubit circuits whose action commutes with the qubit-permuting representation of the symmetric group $S_n$-can be simulated in polynomial time. However, existing approaches scale as $O(n^7)$, and can rapidly become prohibitively expensive. In this work, we introduce a practical algorithm for simulating $S_n$-equivariant circuits under the assumption that the gate generators are at most $k$-local, with $k\in O(1)$. The resulting method runs in $O(n^{ω+1})$ time for constant depth, where $ω$ is the matrix multiplication exponent, significantly lowering the polynomial degree compared to existing techniques. Finally, we numerically validate this scaling by simulating the dynamical evolution of the Lipkin-Meshkov-Glick model, and show that for $n=512$ spins, a standard laptop can compute the concurrence of the evolved state in under two minutes.

quant-pharXiv:2603.13072•Mar 16, 2026•2 citations

Quantum Computing for High Energy Physics workshop

Heather M. Gray

The ATLAS Physics challenge at the HL-LHC and ideas about Quantum Computing. 0:00:00 Slide 1 0:01:44 Slide 2 0:02:12 Slide 3 0:02:49 Slide 4 0:03:46 Slide 5 0:05:10 Slide 6 0:05:43 Slide 7 0:06:19 Slide 8 0:06:35 Slide 9 0:06:56 Slide 10 0:07:37 Slide 11 0:08:01 Slide 12 0:09:32 Slide 13 0:10:52 Slide 14 0:11:47 Slide 15 0:12:43 Slide 16 0:13:52 Slide 17 0:14:46 Slide 18 0:15:39 Slide 19 0:16:35 Slide 20 0:17:02 Slide 21 0:17:43 Slide 22 0:18:52 Slide 23 0:19:37 Slide 24 0:19:59 Slide 25 0:21:13 Slide 26 0:23:31 Slide 27 0:24:00 Slide 28 0:24:04 Slide 29

•Jan 1, 2018•0 citations

Quantum-selected configuration interaction with time-evolved state

Mathias Mikkelsen, Yuya O. Nakagawa

Quantum-selected configuration interaction (QSCI) utilizes an input quantum state on a quantum device to select important bases (electron configurations in quantum chemistry) that define a subspace in which to diagonalize a target Hamiltonian, i.e., perform selected configuration interaction, on classical computers. Previous proposals for preparing a good input state, which is crucial for the quality of QSCI, based on optimization of quantum circuits may suffer from optimization difficulty and require many runs of the quantum device. Here, we propose using a time-evolved state by the target Hamiltonian (for some initial state) as an input of QSCI. Our proposal is based on the intuition that the time evolution by the Hamiltonian creates electron excitations of various orders when applied to the initial state. We numerically investigate the accuracy of the energy obtained by the proposed method for quantum chemistry Hamiltonians describing electronic states of small molecules. Numerical results reveal that our method can yield sufficiently accurate ground-state energies for the investigated molecules. Systematic analysis when increasing the number of qubits in a hydrogen chain shows that the subspace size required for sufficiently accurate results is reasonable at system sizes that cannot be solved by naive classical diagonalization. Our proposal provides a systematic and optimization-free method to prepare the input state of QSCI and could contribute to practical applications of quantum computers in quantum chemistry calculations.

arXiv:2412.13839•Physical Review Research•Sep 12, 2025•51 citations

Quantum Computing for High Energy Physics workshop

A. Elbe

Quantum Computing at INTEL. 0:00:00 Slide 1 0:02:45 Slide 2 0:02:54 Slide 3 0:03:03 Slide 4 0:06:11 Slide 5 0:07:04 Slide 6 0:08:08 Slide 7 0:09:16 Slide 8 0:10:07 Slide 9 0:10:59 Slide 10 0:13:58 Slide 11 0:14:52 Slide 12 0:15:10 Slide 13 0:16:08 Slide 14 0:17:30 Slide 15 0:18:22 Slide 16 0:19:18 Slide 17 0:21:28 Slide 18

•Jan 1, 2018•0 citations

Quantum Computing for High Energy Physics workshop

Federico Carminati

Opening. 0:00:00 Slide 1 0:00:30 Slide 2 0:00:37 Slide 3 0:00:42 Slide 4 0:02:19 Slide 5 0:02:27 Slide 6 0:02:41 Slide 7 0:03:01 Slide 8 0:03:14 Slide 9 0:03:37 Slide 10 0:04:07 Slide 11 0:04:11 Slide 12 0:04:21 Slide 13 0:05:35 Slide 14 0:07:37 Slide 15 0:07:50 Slide 16 0:08:04 Slide 17 0:08:18 Slide 18 0:09:28 Slide 19 0:09:58 Slide 20 0:10:24 Slide 21 0:10:30 Slide 22 0:10:36 Slide 23 0:10:40 Slide 24 0:10:48 Slide 25 0:10:52 Slide 26 0:10:56 Slide 27

•Jan 1, 2018•0 citations

Understanding and compensating for noise on IBM quantum computers

Scott Johnstun, Jean-François S. Van Huele

Quantum algorithms offer efficient solutions to computational problems that are expensive to solve classically. Publicly available quantum computers, such as those provided by IBM, can now be used to run small quantum circuits that execute quantum algorithms. However, these quantum computers are highly prone to noise. Here, we introduce important concepts of quantum circuit noise and connectivity that must be addressed to obtain reliable results on quantum computers. We utilize several examples to show how noise scales with circuit depth. We present Simon's algorithm, a quantum algorithm for solving a computational problem of the same name, explain how to implement it in IBM's Qiskit platform, and compare the results of running it both on a noiseless simulator and on physical hardware subject to noise. We discuss the impact of Qiskit's transpiler, which adapts ideal quantum circuits for physical hardware with limited connectivity between qubits. We show that even circuits of only a few qubits can have their success rate significantly reduced by quantum noise unless specific measures are taken to minimize its impact.

American Journal of Physics•Sep 22, 2021•42 citations
Understanding which subclasses of quantum circuits are efficiently classically simulable is fundamental to delineating the boundary between classical and quantum computation. In this context, it is well known that certain tasks based on permutation-equivariant unitaries-i.e., nnn-qubit circuits whose action commutes with the qubit-permuting representation of the symmetric group SnS_nSn​-can be simulated in polynomial time. However, existing approaches scale as O(n7)O(n^7)O(n7), and can rapidly become prohibitively expensive. In this work, we introduce a practical algorithm for simulating SnS_nSn​-equivariant circuits under the assumption that the gate generators are at most kkk-local, with k∈O(1)k\in O(1)k∈O(1). The resulting method runs in O(nω+1)O(n^{ω+1})O(nω+1) time for constant depth, where ωωω is the matrix multiplication exponent, significantly lowering the polynomial degree compared to existing techniques. Finally, we numerically validate this scaling by simulating the dynamical evolution of the Lipkin-Meshkov-Glick model, and show that for n=512n=512n=512 spins, a standard laptop can compute the concurrence of the evolved state in under two minutes.
The ATLAS Physics challenge at the HL-LHC and ideas about Quantum Computing. 0:00:00 Slide 1 0:01:44 Slide 2 0:02:12 Slide 3 0:02:49 Slide 4 0:03:46 Slide 5 0:05:10 Slide 6 0:05:43 Slide 7 0:06:19 Slide 8 0:06:35 Slide 9 0:06:56 Slide 10 0:07:37 Slide 11 0:08:01 Slide 12 0:09:32 Slide 13 0:10:52 Slide 14 0:11:47 Slide 15 0:12:43 Slide 16 0:13:52 Slide 17 0:14:46 Slide 18 0:15:39 Slide 19 0:16:35 Slide 20 0:17:02 Slide 21 0:17:43 Slide 22 0:18:52 Slide 23 0:19:37 Slide 24 0:19:59 Slide 25 0:21:13 Slide 26 0:23:31 Slide 27 0:24:00 Slide 28 0:24:04 Slide 29
Quantum-selected configuration interaction (QSCI) utilizes an input quantum state on a quantum device to select important bases (electron configurations in quantum chemistry) that define a subspace in which to diagonalize a target Hamiltonian, i.e., perform selected configuration interaction, on classical computers. Previous proposals for preparing a good input state, which is crucial for the quality of QSCI, based on optimization of quantum circuits may suffer from optimization difficulty and require many runs of the quantum device. Here, we propose using a time-evolved state by the target Hamiltonian (for some initial state) as an input of QSCI. Our proposal is based on the intuition that the time evolution by the Hamiltonian creates electron excitations of various orders when applied to the initial state. We numerically investigate the accuracy of the energy obtained by the proposed method for quantum chemistry Hamiltonians describing electronic states of small molecules. Numerical results reveal that our method can yield sufficiently accurate ground-state energies for the investigated molecules. Systematic analysis when increasing the number of qubits in a hydrogen chain shows that the subspace size required for sufficiently accurate results is reasonable at system sizes that cannot be solved by naive classical diagonalization. Our proposal provides a systematic and optimization-free method to prepare the input state of QSCI and could contribute to practical applications of quantum computers in quantum chemistry calculations.
Quantum algorithms offer efficient solutions to computational problems that are expensive to solve classically. Publicly available quantum computers, such as those provided by IBM, can now be used to run small quantum circuits that execute quantum algorithms. However, these quantum computers are highly prone to noise. Here, we introduce important concepts of quantum circuit noise and connectivity that must be addressed to obtain reliable results on quantum computers. We utilize several examples to show how noise scales with circuit depth. We present Simon's algorithm, a quantum algorithm for solving a computational problem of the same name, explain how to implement it in IBM's Qiskit platform, and compare the results of running it both on a noiseless simulator and on physical hardware subject to noise. We discuss the impact of Qiskit's transpiler, which adapts ideal quantum circuits for physical hardware with limited connectivity between qubits. We show that even circuits of only a few qubits can have their success rate significantly reduced by quantum noise unless specific measures are taken to minimize its impact.