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 networks and systems

Compendium of Qubit Technologies in Quantum Computing

Eby Sebastian Puthussery, Ramesh Chandra Poonia

Published Jan 1, 2023• 2 citations
Publisher
DOI
10.1007/978-981-99-2100-3_8

Related papers

A Survey of Current Advances in Quantum Computing

Quincy Mccarthy

•Jan 1, 2015•0 citations

QC Paulinesia

Robert R. Tucci

My goal in producing this document was to create a collection of qubit circuit identities that are used in Quantum Computing. Mathematicians and Physicists may consider it as being analogous to a Table of Integrals or a Mathematical Handbook such as Gradshteyn-Ryzhik or Abramowitz-Stegun. Computer Programmers may think of it as a scrapbook of code snippets that are elegant, instructive, well documented, and useful. Electronics experts may view it as a compendium of circuits for performing a large assortment of tasks. The vast majority of the circuit identities collected in this work were not discovered for the first time by me, and I take no credit for discovering them. In producing this document, I am acting as a collector, not as a discoverer.

•Jul 27, 2004•11 citations

The Compendium of Super-Quadratic Computational Quantum Advantages

Philipp Kammerlander, Thomas E. O'Brien, Robbie King +18 more

This compendium presents a structured collection of computational problems with credible prospects for realizing meaningful quantum advantage, focused on describing problem characteristics rather than specific algorithms. It is intended for non-quantum researchers and practitioners with strong computational backgrounds, particularly domain experts, seeking to assess the relevance of quantum methods to real-world problems. The compendium focuses on enumerating core problems for which there is good evidence that a quantum computer can realize more than a quadratic speedup in offline non-relativized time-complexity (e.g., as opposed to in oracular settings, streaming models, or communication advantages). Entries characterize the structural constraints that real-world instances must satisfy to realize those advantages in practice. The intention is to provide a reference that can be leveraged to connect quantum algorithms to practical use cases.

quant-pharXiv:2610.32595•Oct 26, 2026•0 citations

A Survey on quantum computing technology

László Gyöngyösi, Sándor Imre

Computer Science Review•Jan 27, 2019•646 citations

QC Paulinesia

Robert R. Tucci

My goal in producing this document was to create a collection of qubit circuit identities that are used in Quantum Computing. Mathematicians and Physicists may consider it as being analogous to a Table of Integrals or a Mathematical Handbook such as Gradshteyn-Ryzhik or Abramowitz-Stegun. Computer Programmers may think of it as a scrapbook of code snippets that are elegant, instructive, well documented, and useful. Electronics experts may view it as a compendium of circuits for performing a large assortment of tasks. The vast majority of the circuit identities collected in this work were not discovered for the first time by me, and I take no credit for discovering them. In producing this document, I am acting as a collector, not as a discoverer.

arXiv:quant-ph/0407215•Jul 27, 2004•0 citations

Quantum Computing with Qubits

Samuel L. Braunstein, Arun Kumar Pati

Springer eBooks•Jan 1, 2003•1 citation
My goal in producing this document was to create a collection of qubit circuit identities that are used in Quantum Computing. Mathematicians and Physicists may consider it as being analogous to a Table of Integrals or a Mathematical Handbook such as Gradshteyn-Ryzhik or Abramowitz-Stegun. Computer Programmers may think of it as a scrapbook of code snippets that are elegant, instructive, well documented, and useful. Electronics experts may view it as a compendium of circuits for performing a large assortment of tasks. The vast majority of the circuit identities collected in this work were not discovered for the first time by me, and I take no credit for discovering them. In producing this document, I am acting as a collector, not as a discoverer.
This compendium presents a structured collection of computational problems with credible prospects for realizing meaningful quantum advantage, focused on describing problem characteristics rather than specific algorithms. It is intended for non-quantum researchers and practitioners with strong computational backgrounds, particularly domain experts, seeking to assess the relevance of quantum methods to real-world problems. The compendium focuses on enumerating core problems for which there is good evidence that a quantum computer can realize more than a quadratic speedup in offline non-relativized time-complexity (e.g., as opposed to in oracular settings, streaming models, or communication advantages). Entries characterize the structural constraints that real-world instances must satisfy to realize those advantages in practice. The intention is to provide a reference that can be leveraged to connect quantum algorithms to practical use cases.
My goal in producing this document was to create a collection of qubit circuit identities that are used in Quantum Computing. Mathematicians and Physicists may consider it as being analogous to a Table of Integrals or a Mathematical Handbook such as Gradshteyn-Ryzhik or Abramowitz-Stegun. Computer Programmers may think of it as a scrapbook of code snippets that are elegant, instructive, well documented, and useful. Electronics experts may view it as a compendium of circuits for performing a large assortment of tasks. The vast majority of the circuit identities collected in this work were not discovered for the first time by me, and I take no credit for discovering them. In producing this document, I am acting as a collector, not as a discoverer.