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

High-performance simulation of interacting multiparticle quantum walks with Apache Spark

André Luiz Figueiredo de Albuquerque

Published Mar 1, 2018• 0 citations
OpenAlex

Abstract

Although many quantum algorithms have been developed in the last few decades with considerable speedup when compared to their best classical counterparts, the task of building a general purpose quantum computer is still a technological challenge. While the hardware necessary to run quantum algorithms is not available, researchers rely on classical simulations. However, the most interesting simulations are very demanding of computational resources due to the amount of data growing exponentially with the instance sizes and, thus, high performance computing techniques are necessary. Multiparticle quantum walks have been receiving a great deal of attention recently as a tool for designing quantum algorithms and for modeling physical phenomena. In the present work, we show that Apache Spark, a framework for large-scale data processing, can be used to simulate quantum walks with multiple interacting particles, with instance sizes that are impractical on single-processor, general-purpose computers. We also provide a prototype for quantum walks simulations, suitable to computer clusters, being developed atop of Spark.

Related papers

Quandoop: A Classical Simulator of Quantum Walks on Computer Clusters

David M. Souza, Franklin de Lima Marquezino, ALEXANDRE ANTÔNIO DE LIMA JUNIOR

We describe software Quandoop, a novel simulator of discrete-time quantum walks using high-performance computing (HPC) with the goal of handling simulations with very large Hilbert spaces.Those simulations are usually restricted to a relatively small number of steps due to memory limitations or reduced processing power.The most important feature of Quandoop when compared to previous simulators is to provide a low cost solution for simulations of quantum walks with extreme memory requirements.Examples of such simulations include quantum walks on fractals or with multiple interacting walkers.Quandoop uses Apache Hadoop to parallelize the calculations on a computer cluster, thus reducing the amount of time required to perform the quantum walk simulation and allowing its execution with more steps.Our simulator takes the input as text files containing the initial state, the evolution operators and the description of simulation parameters.This approach allows the integration with other quantum walk simulators such as HiPerWalk or QWalk.After running the necessary calculations in parallel, Quandoop outputs text files describing the results associated to the quantum walk.

Journal of Computational Interdisciplinary Sciences•Jan 1, 2017•0 citations

Coined quantum walks

Nguyen, Long

Quantum computing is a developing field that applies the properties of quantum mechanics to develop solutions to complex problems that the most powerful classical computers cannot solve or cannot solve efficiently. Solving difficult tasks requires sophisticated and efficient algorithms that can utilize stochastic processes as the primary techniques. The typical models of these stochastic processes include discrete-time random walks and continuous ones. Quantum walks represent a quantum extension of discrete random walks, whose demonstrated utility in algorithm design has motivated signi cant interest in quantum computational research. Therefore, the purpose of this thesis is to explore the potential of discrete-time coined quantum walks using the Python package with high-performance computing (HPC) compared to classical walks by conducting a literature review. To supplement this research, some simulations are implemented to analyze the spreading behavior of coined quantum walks, compare them with classical walks, and demonstrate their application in search tasks, such as binary hypercube search algorithm. These simulations aim to clarify the extent to which quantum walks can be effectively modeled and applied in computational contexts. The results gained show that coined quantum walks exhibit faster spreading than classical random walks, which contributes to a deeper understanding of potential applications of quantum walks, such as quantum simulation, in the future.

•Sep 5, 2025•0 citations

Efficient Quantum Computing Simulation

Valentin Pavlov

The last two decades feature an ever-increasing interest in quantum information processing - generalization of the classical computational models in the view of quantum mechanics (QM). In theory, quantum computational devices are capable of solving in polynomial time problems for which only algorithms with exponential time complexity are known. Such enormous advantage explains the global scale of scientific efforts for creating the quantum computer - physical realization of such computational device. While the results of those efforts are still constrained inside the large experimental laboratories, an adequate tool for studying quantum algorithms will be of great help for educating the next generation of computer scientists - the engineers that will be responsible for operating these devices. The paper describes a quantum computer simulation model that exhibits a certain attractive property - the simulation slowdown does not depend directly on the size of the input data but rather on the complexity of the quantum state, meaning that transformations upon less-entangled data are performed faster. Based on this property the simulation can be spread between the nodes of a grid cluster in a way as to keep the entanglement in each job minimal

IEEE John Vincent Atanasoff International Symposium on Modern Computing (JVA)•Oct 1, 2006•3 citations

Quantum Computing and Simulation Platform for HEP at IHEP

Yujiang Bi, Lu Wang, Wei Sun +1 more

With the dramatic growth of experimental data in high-energy physics and the increasing demand for accuracy of physical analysis results, the current classical computing model and computing power can no longer meet the needs of data processing and analysis. As a new computing device with great potential, quantum computers have become one of the possible ways to solve the bottleneck of high-energy physics data processing and computation, though quantum computers are still far away from general computing. At such a stage that quantum computers have so many shortcomings like few physical qubits, short coherent time, and poor fidelity to solve most of practical problems, it's necessary to build a development and simulation platform using classical computers to accelerate research on quantum algorithms and applications. We've set up an interactive development platform for quantum algorithms research and quantum computing simulation, and are preparing one web portal for public education and training on quantum computing. In the future, we will pay more attention to quantum computing applications in HEP and QCD simulation.

•Sep 28, 2022•1 citation

A Framework for Integrating Quantum Simulation and High Performance Computing

Amir Shehata, Thomas J. Naughton, In‐Saeng Suh

Scientific applications are starting to explore the viability of quantum computing. This exploration typically begins with quantum simulations that can run on existing classical platforms, albeit without the performance advantages of real quantum resources. In the context of high-performance computing (HPC), the incorporation of simulation software can often take advantage of the powerful resources to help scale-up the simulation size. The configuration, installation and operation of these quantum simulation packages on HPC resources can often be rather daunting and increases friction for experimentation by scientific application developers. We describe a framework to help streamline access to quantum simulation software running on HPC resources. This includes an interface for circuit-based quantum computing tasks, as well as the necessary resource management infrastructure to make effective use of the underlying HPC resources. The primary contributions of this work include a classification of different usage models for quantum simulation in an HPC context, a review of the software architecture for our approach and a detailed description of the prototype implementation to experiment with these ideas using two different simulators (TNQVM & NWQ-Sim). We include initial experimental results running on the Frontier supercomputer at the Oak Ridge Leadership Computing Facility (OLCF) using a synthetic workload generated via the SupermarQ quantum benchmarking framework.

arXiv:2408.08098•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•16 citations

Two-dimensional quantum walks of correlated photons

Zhi‐Qiang Jiao, Jun Gao, Wenhao Zhou +6 more

Quantum walks in an elaborately designed graph are a powerful tool for simulating physical and topological phenomena, constructing novel quantum algorithms, and realizing universal quantum computing. Integrated photonics technology has emerged as a versatile platform for implementing a variety of quantum information tasks and as a promising candidate for performing large-scale quantum walks. Both extending physical dimensions and involving more particles will increase the complexity of the evolving systems. Pioneering studies have demonstrated a single particle walking on two-dimensional lattices and multiple walkers interfering on a one-dimensional structure. However, multiple particles evolving in a genuine two-dimensional space in a scalable fashion has remained a vacancy for nearly 10 years. We present a genuine two-dimensional quantum walk with correlated photons on a triangular photonic lattice, which is mapped to a 37 × 37 high-dimensional state space. The genuine two-dimensional quantum walk breaks through the physical restrictions of single-particle evolution, allowing for the encoding of information in large spaces and construction of high-dimensional graphs, which are beneficial for quantum information processing. Between the chip and the two-dimensional fanout interface, site-by-site addressing enables simultaneous detection of over 600 nonclassical interferences and observation of quantum correlations that violate a classical limit by 57 standard deviations. Our implementation provides a paradigm for multi-photon quantum walks in a two-dimensional configuration on a large scale, paving the way for practical quantum simulation and computation beyond the classical regime.

arXiv:2007.06554•Optica•Aug 2, 2021•44 citations
Although many quantum algorithms have been developed in the last few decades with considerable speedup when compared to their best classical counterparts, the task of building a general purpose quantum computer is still a technological challenge. While the hardware necessary to run quantum algorithms is not available, researchers rely on classical simulations. However, the most interesting simulations are very demanding of computational resources due to the amount of data growing exponentially with the instance sizes and, thus, high performance computing techniques are necessary. Multiparticle quantum walks have been receiving a great deal of attention recently as a tool for designing quantum algorithms and for modeling physical phenomena. In the present work, we show that Apache Spark, a framework for large-scale data processing, can be used to simulate quantum walks with multiple interacting particles, with instance sizes that are impractical on single-processor, general-purpose computers. We also provide a prototype for quantum walks simulations, suitable to computer clusters, being developed atop of Spark.
We describe software Quandoop, a novel simulator of discrete-time quantum walks using high-performance computing (HPC) with the goal of handling simulations with very large Hilbert spaces.Those simulations are usually restricted to a relatively small number of steps due to memory limitations or reduced processing power.The most important feature of Quandoop when compared to previous simulators is to provide a low cost solution for simulations of quantum walks with extreme memory requirements.Examples of such simulations include quantum walks on fractals or with multiple interacting walkers.Quandoop uses Apache Hadoop to parallelize the calculations on a computer cluster, thus reducing the amount of time required to perform the quantum walk simulation and allowing its execution with more steps.Our simulator takes the input as text files containing the initial state, the evolution operators and the description of simulation parameters.This approach allows the integration with other quantum walk simulators such as HiPerWalk or QWalk.After running the necessary calculations in parallel, Quandoop outputs text files describing the results associated to the quantum walk.
Quantum computing is a developing field that applies the properties of quantum mechanics to develop solutions to complex problems that the most powerful classical computers cannot solve or cannot solve efficiently. Solving difficult tasks requires sophisticated and efficient algorithms that can utilize stochastic processes as the primary techniques. The typical models of these stochastic processes include discrete-time random walks and continuous ones. Quantum walks represent a quantum extension of discrete random walks, whose demonstrated utility in algorithm design has motivated signi cant interest in quantum computational research. Therefore, the purpose of this thesis is to explore the potential of discrete-time coined quantum walks using the Python package with high-performance computing (HPC) compared to classical walks by conducting a literature review. To supplement this research, some simulations are implemented to analyze the spreading behavior of coined quantum walks, compare them with classical walks, and demonstrate their application in search tasks, such as binary hypercube search algorithm. These simulations aim to clarify the extent to which quantum walks can be effectively modeled and applied in computational contexts. The results gained show that coined quantum walks exhibit faster spreading than classical random walks, which contributes to a deeper understanding of potential applications of quantum walks, such as quantum simulation, in the future.
The last two decades feature an ever-increasing interest in quantum information processing - generalization of the classical computational models in the view of quantum mechanics (QM). In theory, quantum computational devices are capable of solving in polynomial time problems for which only algorithms with exponential time complexity are known. Such enormous advantage explains the global scale of scientific efforts for creating the quantum computer - physical realization of such computational device. While the results of those efforts are still constrained inside the large experimental laboratories, an adequate tool for studying quantum algorithms will be of great help for educating the next generation of computer scientists - the engineers that will be responsible for operating these devices. The paper describes a quantum computer simulation model that exhibits a certain attractive property - the simulation slowdown does not depend directly on the size of the input data but rather on the complexity of the quantum state, meaning that transformations upon less-entangled data are performed faster. Based on this property the simulation can be spread between the nodes of a grid cluster in a way as to keep the entanglement in each job minimal
With the dramatic growth of experimental data in high-energy physics and the increasing demand for accuracy of physical analysis results, the current classical computing model and computing power can no longer meet the needs of data processing and analysis. As a new computing device with great potential, quantum computers have become one of the possible ways to solve the bottleneck of high-energy physics data processing and computation, though quantum computers are still far away from general computing. At such a stage that quantum computers have so many shortcomings like few physical qubits, short coherent time, and poor fidelity to solve most of practical problems, it's necessary to build a development and simulation platform using classical computers to accelerate research on quantum algorithms and applications. We've set up an interactive development platform for quantum algorithms research and quantum computing simulation, and are preparing one web portal for public education and training on quantum computing. In the future, we will pay more attention to quantum computing applications in HEP and QCD simulation.
Scientific applications are starting to explore the viability of quantum computing. This exploration typically begins with quantum simulations that can run on existing classical platforms, albeit without the performance advantages of real quantum resources. In the context of high-performance computing (HPC), the incorporation of simulation software can often take advantage of the powerful resources to help scale-up the simulation size. The configuration, installation and operation of these quantum simulation packages on HPC resources can often be rather daunting and increases friction for experimentation by scientific application developers. We describe a framework to help streamline access to quantum simulation software running on HPC resources. This includes an interface for circuit-based quantum computing tasks, as well as the necessary resource management infrastructure to make effective use of the underlying HPC resources. The primary contributions of this work include a classification of different usage models for quantum simulation in an HPC context, a review of the software architecture for our approach and a detailed description of the prototype implementation to experiment with these ideas using two different simulators (TNQVM & NWQ-Sim). We include initial experimental results running on the Frontier supercomputer at the Oak Ridge Leadership Computing Facility (OLCF) using a synthetic workload generated via the SupermarQ quantum benchmarking framework.
Quantum walks in an elaborately designed graph are a powerful tool for simulating physical and topological phenomena, constructing novel quantum algorithms, and realizing universal quantum computing. Integrated photonics technology has emerged as a versatile platform for implementing a variety of quantum information tasks and as a promising candidate for performing large-scale quantum walks. Both extending physical dimensions and involving more particles will increase the complexity of the evolving systems. Pioneering studies have demonstrated a single particle walking on two-dimensional lattices and multiple walkers interfering on a one-dimensional structure. However, multiple particles evolving in a genuine two-dimensional space in a scalable fashion has remained a vacancy for nearly 10 years. We present a genuine two-dimensional quantum walk with correlated photons on a triangular photonic lattice, which is mapped to a 37 × 37 high-dimensional state space. The genuine two-dimensional quantum walk breaks through the physical restrictions of single-particle evolution, allowing for the encoding of information in large spaces and construction of high-dimensional graphs, which are beneficial for quantum information processing. Between the chip and the two-dimensional fanout interface, site-by-site addressing enables simultaneous detection of over 600 nonclassical interferences and observation of quantum correlations that violate a classical limit by 57 standard deviations. Our implementation provides a paradigm for multi-photon quantum walks in a two-dimensional configuration on a large scale, paving the way for practical quantum simulation and computation beyond the classical regime.