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

AIP conference proceedings

Quantum computing: A contemporary computing technique with coalescence of science and engineering

Khaja Mannanuddin, Vishali Sivalenka, Srinivas Aluvala, Yerram Sneha, Y. Sharvani, M. S. Annapoorna

Published Jan 1, 2022• 0 citations
Publisher
DOI
10.1063/5.0082204

Related papers

Impact of quantum computing on computer science/engineering education

Richard Jay Spillman

Journal of computing sciences in colleges•Dec 1, 2003•0 citations

Quantum algorithm for the collision-coalescence of cloud droplets

Kazumasa Ueno, Hiroaki Miura

Quantum computing may help reduce computational costs of simulating large and nonlinear systems, but research into the use of quantum computers in atmospheric and oceanic sciences is still at an early stage. This study explores the use of quantum computing for calculating the collision-coalescence process that dominates the size growth of liquid particles in cloud microphysics. Inspired by the quantum algorithms developed in the field of financial engineering, we propose a new algorithm based on a master equation that describes the time evolution of the droplet mass distribution. Our algorithm uses the quantum amplitudes to encode the probability distribution of droplet mass and calculates the expected number of droplets via the quantum amplitude estimation. The key contribution is an encoding strategy that maps the multivariate collision-coalescence problem onto a quantum computation by recording only the transition history rather than the full mass distributions at every time step. This approach reduces the per-step qubit cost from $O(\sqrt{N})$ to $O(\log N)$, where $N$ is the number of mass bins. Our resource analysis shows that the number of T gates (T-count) scales as $\widetilde{O}(N^2)$ per mass bin in $N$, for a fixed number of time steps and a given target accuracy, where the $\widetilde{O}$ notation suppresses polylogarithmic factors in $N$. This is a substantial improvement over classical master-equation methods, whose cost grows super-polynomially with $N$ as the number of possible states increases. Our results suggest that the collision-coalescence process is one of the promising targets of quantum computing in the field of atmospheric science.

quant-pharXiv:2603.06353•Physical Review Applied•Mar 9, 2026•1 citation

QUANTUM COMPUTING: THE COMPUTING TECHNOLOGY OF TOMORROW

Ms. Gaganpreet Kaur Dr. Mohammed Bakhtawar Ahmed

Redshine Archive•Jul 7, 2024•0 citations

What is Quantum Computing

Kevin A. Yuh

•Jan 1, 2012•5 citations

The Road to Useful Quantum Computers

Timothy Proctor, Robin Blume-Kohout, Andrew Baczewski

Building a useful quantum computer is a grand science and engineering challenge, currently pursued intensely by teams around the world. In the 1980s, Richard Feynman and Yuri Manin observed independently that computers based on quantum mechanics might enable better simulations of quantum phenomena. Their vision remained an intellectual curiosity until Peter Shor published his famous quantum algorithm for integer factoring, and shortly thereafter a proof that errors in quantum computations can be corrected. Since then, quantum computing R&D has progressed rapidly, from small-scale experiments in university physics laboratories to well-funded industrial efforts and prototypes. Hype notwithstanding, quantum computers have yet to solve scientifically or practically important problems -- a target often called quantum utility. In this article, we describe the capabilities of contemporary quantum computers, compare them to the requirements of quantum utility, and illustrate how to track progress from today to utility. We highlight key science and engineering challenges on the road to quantum utility, touching on relevant aspects of our own research.

quant-pharXiv:2602.22540•Feb 27, 2026•0 citations

Ytterbium ion trap quantum computing: The current state-of-the-art

Gavin Nop, Durga Paudyal, Jonathan D. H. Smith

We present an overview of contemporary quantum computing with ytterbium ion traps, placing the emphasis on industry implementations. We provide brief, concrete descriptions of various key features, such as trap loading, electronic structure, qubit function, gates, error analysis, and benchmarking. We focus on the underlying science and current technologies to provide readers with a holistic picture of available techniques for using ytterbium in contemporary ion trap designs.

AVS Quantum Science•Nov 22, 2021•23 citations
Quantum computing may help reduce computational costs of simulating large and nonlinear systems, but research into the use of quantum computers in atmospheric and oceanic sciences is still at an early stage. This study explores the use of quantum computing for calculating the collision-coalescence process that dominates the size growth of liquid particles in cloud microphysics. Inspired by the quantum algorithms developed in the field of financial engineering, we propose a new algorithm based on a master equation that describes the time evolution of the droplet mass distribution. Our algorithm uses the quantum amplitudes to encode the probability distribution of droplet mass and calculates the expected number of droplets via the quantum amplitude estimation. The key contribution is an encoding strategy that maps the multivariate collision-coalescence problem onto a quantum computation by recording only the transition history rather than the full mass distributions at every time step. This approach reduces the per-step qubit cost from O(N)O(\sqrt{N})O(N​) to O(log⁡N)O(\log N)O(logN), where NNN is the number of mass bins. Our resource analysis shows that the number of T gates (T-count) scales as O~(N2)\widetilde{O}(N^2)O(N2) per mass bin in NNN, for a fixed number of time steps and a given target accuracy, where the O~\widetilde{O}O notation suppresses polylogarithmic factors in NNN. This is a substantial improvement over classical master-equation methods, whose cost grows super-polynomially with NNN as the number of possible states increases. Our results suggest that the collision-coalescence process is one of the promising targets of quantum computing in the field of atmospheric science.
Building a useful quantum computer is a grand science and engineering challenge, currently pursued intensely by teams around the world. In the 1980s, Richard Feynman and Yuri Manin observed independently that computers based on quantum mechanics might enable better simulations of quantum phenomena. Their vision remained an intellectual curiosity until Peter Shor published his famous quantum algorithm for integer factoring, and shortly thereafter a proof that errors in quantum computations can be corrected. Since then, quantum computing R&D has progressed rapidly, from small-scale experiments in university physics laboratories to well-funded industrial efforts and prototypes. Hype notwithstanding, quantum computers have yet to solve scientifically or practically important problems -- a target often called quantum utility. In this article, we describe the capabilities of contemporary quantum computers, compare them to the requirements of quantum utility, and illustrate how to track progress from today to utility. We highlight key science and engineering challenges on the road to quantum utility, touching on relevant aspects of our own research.