Fetching the paper…
Reading the bibliography…
This paper presents a novel quantum walk approach to simulating parton showers on a quantum computer.
1903
Earlier work this paper cites.
V. Sudakov, Vertex parts at very high-energies in quantum electrodynamics
1956
Earlier work this paper cites.
V. Gribov and L. Lipatov, Deep inelastic e p scattering in perturbation theory
1972
Earlier work this paper cites.
Y. L. Dokshitzer, Calculation of the Structure Functions for Deep Inelastic Scattering and e+ e- Annihilation by Perturbation Theory in Quantum Chromodynamics
1977
Earlier work this paper cites.
G. Altarelli and G. Parisi, Asymptotic freedom in parton language
1977
Earlier work this paper cites.
Y. Aharonov, L. Davidovich, and N. Zagury, Quantum random walks
1993
Earlier work this paper cites.
Progress in Theoretical Computer Science. Birkhäuser Boston, 1993
A. Sinclair, Algorithms for Random Generation and Counting: A Markov Chain Approach: A Markov Chain Approach · 1993
Earlier work this paper cites.
Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, 1997
J. R. Norris, Markov Chains · 1997
Earlier work this paper cites.
D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani, Quantum walks on graphs
2001
Earlier work this paper cites.
A. Ambainis, E. Bach, A. Nayak, A. Vishwanath, and J. Watrous, One-dimensional quantum walks
2001
Earlier work this paper cites.
J. Kempe, Quantum random walks: An introductory overview
2003
Earlier work this paper cites.
T. A. Brun, H. A. Carteret and A. Ambainis, Quantum walks driven by many coins
2003
Earlier work this paper cites.
N. Shenvi, J. Kempe, and K. B. Whaley, Quantum random-walk search algorithm
2003
Earlier work this paper cites.
T. Gleisberg et al
2004
Earlier work this paper cites.
M. Szegedy, Quantum speed-up of markov chain based algorithms
2004
Earlier work this paper cites.
P. C. Richter, Quantum speedup of classical mixing processes
2007
Earlier work this paper cites.
M. Bahr et al
2008
Earlier work this paper cites.
P. Wocjan and A. Abeyesinghe, Speedup via quantum sampling
2008
Cited alongside, same era.
R. D. Somma, S. Boixo, H. Barnum, and E. Knill, Quantum simulations of classical annealing processes
2008
Cited alongside, same era.
American Mathematical Soc., 2008
D. Levin, Y. Peres, and E. Wilmer, Markov Chains and Mixing Times · 2008
Cited alongside, same era.
2008
Cited alongside, same era.
A. E. Armenakas and O. K. Baker, Application of a quantum search algorithm to high- energy physics data at the large hadron collider
2010
Cited alongside, same era.
A. Buckley et al
2011
Cited alongside, same era.
C. Tüysüz, F. Carminati, B. Demirköz, D. Dobos, F. Fracas, K. Novotny, K. Potamianos, S. Vallecorsa, and J.-R. Vlimant, Particle track reconstruction with quantum algorithms
2020
Later among the works it cites.
J. Lemieux, B. Heim, D. Poulin, K. Svore, and M. Troyer, Efficient Quantum Walk Circuits for Metropolis-Hastings Algorithm
2020
Later among the works it cites.
S. Chakraborty, K. Luh, and J. Roland, How fast do quantum walks mix?
2020
Later among the works it cites.
D. Li, Y. Liu, Y. G. Yang, et al
2020
Later among the works it cites.
IBM Research, IBM’s roadmap for scaling quantum technology
2020
Later among the works it cites.
C. W. Bauer, W. A. de Jong, B. Nachman, and D. ide Provasoli, Quantum Algorithm for High Energy Physics Simulations
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
F. Magniez, A. Nayak, J. Roland, and M. Santha, Search via quantum walk
2011
Cited alongside, same era.
2012
Cited alongside, same era.
P. P. Rohde, G. K. Brennen and A. Gilchrist, Quantum walks with memory provided by recycled coins and a memory of the coin-flip history
2013
Cited alongside, same era.
E. Camilleri, P. P. Rohde and J. Twamley, Quantum walks with tuneable self-avoidance in one dimension
2014
Cited alongside, same era.
T. Sjöstrand et al
2015
Cited alongside, same era.
D. Li, M. Mc Gettrick, F. Gao, J. Xu and Q. Y. Wen, Generic quantum walks with memory on regular graphs
2016
Cited alongside, same era.
2021
Closest in time.
K. Bepari, S. Malik, M. Spannowsky, and S. Williams, Towards a quantum computing algorithm for helicity amplitudes and parton showers
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
A. Blance and M. Spannowsky, Quantum Machine Learning for Particle Physics using a Variational Quantum Classifier
2021
Closest in time.
A. Blance and M. Spannowsky, Unsupervised Event Classification with Graphs on Classical and Photonic Quantum Computers
2021
Closest in time.
K. Terashi, M. Kaneda, T. Kishimoto, M. Saito, R. Sawada, and J. Tanaka, Event classification with quantum machine learning in high-energy physics
2021
Closest in time.
S. L. Wu, J. Chan, W. Guan, S. Sun, A. Wang, C. Zhou, M. Livny, F. Carminati, A. Di Meglio, A. C. Y. Li, and et al., Application of quantum machine learning using the quantum variational classifier method to high energy physics analysis at the lhc on ibm quantum computer simulator and hardware with 10 qubits
2021
Closest in time.
J. Y. Araz and M. Spannowsky, Quantum-inspired event reconstruction with Tensor Networks: Matrix Product States
2021
Closest in time.
V. Belis, S. González-Castillo, C. Reissel, S. Vallecorsa, E. F. Combarro, G. Dissertori, and F. Reiter, Higgs analysis with quantum classifiers
2021
Closest in time.
D. Pires, P. Bargassa, J. Seixas, and Y. Omar, A digital quantum algorithm for jet clustering in high-energy physics
2021
Closest in time.
Y. Atia and S. Chakraborty, Improved upper bounds for the hitting times of quantum walks
2021
Closest in time.