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

Lecture notes in computer science

A New Universal Quantum Gates and Its Simulation on GPGPU

Huimin Luo, Jiabin Yuan, Wenjing Dai

Published Jan 1, 2017• 1 citation
Publisher
DOI
10.1007/978-3-319-68505-2_2

Related papers

GPGPU Based Simulations for One and Two Dimensional Quantum Walks

Marek Sawerwain, Roman Gielerak

arXiv:1003.3779•Communications in computer and information science•Jan 1, 2010•7 citations

High-performance GPGPU OpenCL simulation of quantum Boltzmann equation

Petr F. Kartsev

We describe the OpenCL GPGPU solver for Quantum Boltzmann equation to study the dynamics of interacting Bose gas. GPU approach allows to manage large system of equations and the required amount of calculations.

International Workshop on OpenCL•Apr 27, 2020•0 citations

Parallel quantum computer simulation on the GPU

Amariutei, Caraiman

International Conference on System Theory, Control and Computing (ICSTCC)•Jan 1, 2011•0 citations

Randomized Benchmarking of Quantum Gates on a GPU

Syed Zawad, Feng Yan, Rui Wu +2 more

Advances in intelligent systems and computing•Jan 1, 2019•0 citations

Quantum computing with GPGPUs

Καραπάνου, Μαρία Α., Καραπάνου, Μαρία Α.

The rapid development of the quantum computing field has created the need for effective study tools.Although the physical implementation of quantum systems is still at an early stage, the simulation of quantum circuits using classical computational resources offers a feasible and practical way for experimentation and evaluation.This work focuses on creating functions that enable the implementation of basic quantum gates and circuits on graphics cards (GPUs).Functions were developed that include fundamental operations for the representation and execution of quantum gates and circuits.Through examples and tests, their performance is evaluated, while a simple command-line interface is also provided so that it can be easily used by individuals without prior experience in the field.

•Jan 1, 2025•0 citations

QxSQA: GPGPU-Accelerated Simulated Quantum Annealer within a Non-Linear Optimization and Boltzmann Sampling Framework

Dan Padilha, Serge Weinstock, Mark J. Hodson

We introduce QxSQA, a GPGPU-Accelerated Simulated Quantum Annealer based on Path-Integral Monte Carlo (PIMC). QxSQA is tuned for finding low-energy solutions to integer, non-linear optimization problems of up to 214(16,384) binary variables with quadratic interactions on a single GPU instance. Experimental results demonstrate QxSQA can solve Maximum Clique test problems of 8,100 binary variables with planted solutions in under one minute, with linear scaling against key optimization parameters on other large-scale problems. Through the PIMC formulation, QxSQA also functions as an accurate sampler of Boltzmann distributions for machine learning applications. Experimental characterization of Boltzmann sampling results for a reinforcement learning problem showed good convergence performance at useful scales. Our implementation integrates as a solver within our QxBranch developer platform, positioning developers to efficiently develop applications using QxSQA, and then test the same application code on a quantum annealer or universal quantum computer hardware platform such as those from D-Wave Systems, IBM, or Rigetti Computing.

IEEE High Performance Extreme Computing Conference•Sep 1, 2019•2 citations
The rapid development of the quantum computing field has created the need for effective study tools.Although the physical implementation of quantum systems is still at an early stage, the simulation of quantum circuits using classical computational resources offers a feasible and practical way for experimentation and evaluation.This work focuses on creating functions that enable the implementation of basic quantum gates and circuits on graphics cards (GPUs).Functions were developed that include fundamental operations for the representation and execution of quantum gates and circuits.Through examples and tests, their performance is evaluated, while a simple command-line interface is also provided so that it can be easily used by individuals without prior experience in the field.
We introduce QxSQA, a GPGPU-Accelerated Simulated Quantum Annealer based on Path-Integral Monte Carlo (PIMC). QxSQA is tuned for finding low-energy solutions to integer, non-linear optimization problems of up to 214(16,384) binary variables with quadratic interactions on a single GPU instance. Experimental results demonstrate QxSQA can solve Maximum Clique test problems of 8,100 binary variables with planted solutions in under one minute, with linear scaling against key optimization parameters on other large-scale problems. Through the PIMC formulation, QxSQA also functions as an accurate sampler of Boltzmann distributions for machine learning applications. Experimental characterization of Boltzmann sampling results for a reinforcement learning problem showed good convergence performance at useful scales. Our implementation integrates as a solver within our QxBranch developer platform, positioning developers to efficiently develop applications using QxSQA, and then test the same application code on a quantum annealer or universal quantum computer hardware platform such as those from D-Wave Systems, IBM, or Rigetti Computing.