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

Techniques for Quantum Computing State Generation, Discrete Logarithms in Elliptic Curve Groups, Reliable Global Control Schemes and Algorithmic Cooling

Phillip Kaye

Published Jan 1, 2007• 0 citations
OpenAlex

Abstract

I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public.

Related papers

On quantum computation theory

W.K. van Dam

The content of the Chapters 3 through 7 of this Ph.D. thesis corresponds with the following articles written by the author.

•Jan 1, 2002•2 citations

Collision Finding with Many Classical or Quantum Processors

Stacey Jeffery

I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii In this thesis, we investigate the cost of finding collisions in a black-box function, a problem that is of fundamental importance in cryptanalysis. Inspired by the excellent performance of the heuristic rho method of collision finding, we define several new models of complexity that take into account the cost of moving information across a large space, and lay the groundwork for studying the performance of classical and quantum algorithms in these models. iii Acknowledgements I am deeply indebted to my supervisor, Dr. Michele Mosca, for introducing me to the subject of quantum information processing, and for the years of support and encouragement

•Aug 31, 2011•2 citations

Parallelizing quantum circuit synthesis

Olivia Di Matteo, C Olivia Di Matteo

I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii We present an algorithmic framework for parallel quantum circuit synthesis using meet-in-the-middle synthesis techniques. We also present two implementations thereof, using both threaded and hybrid parallelization techniques. We give examples where applying parallelism offers a speedup on the time of circuit synthesis for 2-and 3-qubit circuits. We use a threaded algorithm to synthesize 3-qubit circuits with optimal T-count 9, and 11, breaking the previous record of T-count 7. As the estimated runtime of the framework is inversely proportional to the number of processors, we propose an implementation using hybrid parallel programming which can take full advantage of a computing cluster’s thousands of cores. This implementation has the potential to synthesize circuits which were previously deemed impossible due to the exponential runtime of existing algorithms.

•Jan 1, 2015•32 citations

IEE Colloquium on Quantum Computing: Theory, Applications and Implications (Digest No.1997/145)

Institution of Engineering and Technology eBooks•Jan 1, 1997•0 citations

Quantum Computing: Algorithms and Applications - A Literature Review

Abid Hossain Rion, Mashrufa Meghla Any

•Jan 1, 2025•0 citations

On Experimental Deterministic Quantum Computation with One Quantum Bit (DQC1)

Gina Passante

I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. G. Passante ii Quantum information processors have the ability to drastically change our world. By manipulating bits of information ruled by the laws of quantum mechanics, computational devices can perform some computations that are classically intractable. Most quantum algorithms rely on pure qubits as inputs and require entanglement throughout the compu-tation. In this thesis, we explore a model of computation that uses mixed qubits without en-tanglement known as DQC1 (deterministic quantum computation with one quantum bit), using the physical system of liquid-state Nuclear Magnetic Resonance (NMR). Throughout our research, we experimentally implement an algorithm that completely encapsulates the DQC1 model, and take a close look at the quantum nature of DQC1-states as given by the

•Mar 27, 2012•1 citation
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii In this thesis, we investigate the cost of finding collisions in a black-box function, a problem that is of fundamental importance in cryptanalysis. Inspired by the excellent performance of the heuristic rho method of collision finding, we define several new models of complexity that take into account the cost of moving information across a large space, and lay the groundwork for studying the performance of classical and quantum algorithms in these models. iii Acknowledgements I am deeply indebted to my supervisor, Dr. Michele Mosca, for introducing me to the subject of quantum information processing, and for the years of support and encouragement
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii We present an algorithmic framework for parallel quantum circuit synthesis using meet-in-the-middle synthesis techniques. We also present two implementations thereof, using both threaded and hybrid parallelization techniques. We give examples where applying parallelism offers a speedup on the time of circuit synthesis for 2-and 3-qubit circuits. We use a threaded algorithm to synthesize 3-qubit circuits with optimal T-count 9, and 11, breaking the previous record of T-count 7. As the estimated runtime of the framework is inversely proportional to the number of processors, we propose an implementation using hybrid parallel programming which can take full advantage of a computing cluster’s thousands of cores. This implementation has the potential to synthesize circuits which were previously deemed impossible due to the exponential runtime of existing algorithms.
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. G. Passante ii Quantum information processors have the ability to drastically change our world. By manipulating bits of information ruled by the laws of quantum mechanics, computational devices can perform some computations that are classically intractable. Most quantum algorithms rely on pure qubits as inputs and require entanglement throughout the compu-tation. In this thesis, we explore a model of computation that uses mixed qubits without en-tanglement known as DQC1 (deterministic quantum computation with one quantum bit), using the physical system of liquid-state Nuclear Magnetic Resonance (NMR). Throughout our research, we experimentally implement an algorithm that completely encapsulates the DQC1 model, and take a close look at the quantum nature of DQC1-states as given by the