Corpus ID: 4779070

Quantum Algorithm Implementations for Beginners

@article{Coles2018QuantumAI,
  title={Quantum Algorithm Implementations for Beginners},
  author={Patrick J. Coles and Stephan Johannes Eidenbenz and Scott Pakin and Adetokunbo Adedoyin and J. J. Ambrosiano and Petr M. Anisimov and W. Riley Casper and Gopinath Chennupati and Carleton Coffrin and Hristo N. Djidjev and David Gunter and Satish Karra and Nathan Lemons and Shizeng Lin and Andrey Y. Lokhov and Alexander Malyzhenkov and David Dennis Lee Mascarenas and Susan M. Mniszewski and Balu Nadiga and Daniel O'Malley and Diane Oyen and Lakshman Prasad and Randy Roberts and Philip Romero and Nandakishore Santhi and Nikolai A. Sinitsyn and Pieter Swart and Marc Vuffray and James G. Wendelberger and Boram Yoon and Richard J. Zamora and Wei Zhu},
  journal={ArXiv},
  year={2018},
  volume={abs/1804.03719}
}
As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available quantum computers have less than 100 qubits, quantum computing hardware is widely expected to grow in terms of qubit count, quality, and connectivity. This review aims to explain the principles of quantum programming, which are quite different from classical… Expand
Quantum Algorithms, Architecture, and Error Correction
Quantum algorithms have the potential to provide exponential speedups over some of the best known classical algorithms. These speedups may enable quantum devices to solve currently intractableExpand
Implementing Grover’s Algorithm on the IBM Quantum Computers
TLDR
It is indicated that quantum computers can currently only be used accurately for solving simple problems with very small amounts of data. Expand
Quantum Computing: Principles and Applications
The development of quantum computers over the past few years is one of the most significant advancements in the history of quantum computing. D-Wave quantum computer has been available for more thanExpand
On the Definition of Quantum Programming Modules
TLDR
The concept of module is discussed, key in the software engineering discipline, and initial criteria for determining the cohesion and coupling levels of a module in the field of quantum programming are established as a first step towards a sound quantum software engineering. Expand
Variational Quantum Algorithms
TLDR
An overview of the field of Variational Quantum Algorithms is presented and strategies to overcome their challenges as well as the exciting prospects for using them as a means to obtain quantum advantage are discussed. Expand
Overview and Comparison of Gate Level Quantum Software Platforms
TLDR
A current picture of the rapidly evolving quantum computing landscape is provided by comparing four software platforms - Forest, Qiskit, ProjectQ, and the Quantum Developer Kit (Q#) - that enable researchers to use real and simulated quantum devices. Expand
Just Like the Real Thing: Fast Weak Simulation of Quantum Computation
TLDR
This work develops algorithms for weak simulation based on quantum state representation in terms of decision diagrams and shows, for the first time, that this enables mimicking of physical quantum computers of significant scale. Expand
Efficient Quantum Circuits for Accurate State Preparation of Smooth, Differentiable Functions
  • Adam Holmes, A. Matsuura
  • Computer Science, Physics
  • 2020 IEEE International Conference on Quantum Computing and Engineering (QCE)
  • 2020
TLDR
This work shows that there exist families of quantum states that can be prepared to high precision with circuits of linear size and depth, and develops an algorithm that requires only linear classical computation time to generate accurate linear- depth circuits to prepare these states. Expand
Quick Quantum Circuit Simulation
Quick Quantum Circuit Simulation (QQCS) is a software system for computing the result of a quantum circuit using a notation that derives directly from the circuit, expressed in a single input line.Expand
Q # : A Quantum Programming Language by Microsoft
The multi-paradigm quantum programming language Q# was analysed and used to study and create novel programs that were able to go beyond the capabilities of any classical program. This language wasExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 135 REFERENCES
Quantum Computing for Computer Scientists
TLDR
The text has step-by-step examples, more than two hundred exercises with solutions, and programming drills that bring the ideas of quantum computing alive for today's computer science students and researchers. Expand
Quantum Computers
This research paper gives an overview of quantum computers – description of their operation, differences between quantum and silicon computers, major construction problems of a quantum computer andExpand
Quantum Computing: A Gentle Introduction
The combination of two of the twentieth centurys most influential and revolutionary scientific theories, information theory and quantum mechanics, gave rise to a radically new view of computing andExpand
Experimental realisation of Shor's quantum factoring algorithm using qubit recycling
TLDR
This work demonstrates a scalable version of Shor's quantum factoring algorithm in which then qubit control register is replaced by a single qubit that is recycled n times: the total number of qubits is one third of that required in the standard protocol. Expand
Quantum Computation and Quantum Information (10th Anniversary edition)
TLDR
Containing a wealth of figures and exercises, this well-known textbook is ideal for courses on the subject, and will interest beginning graduate students and researchers in physics, computer science, mathematics, and electrical engineering. Expand
Quantum Algorithms for Systems of Linear Equations Inspired by Adiabatic Quantum Computing.
TLDR
Two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state |x⟩ that is proportional to the solution of the system of linear equations Ax[over →]=b[ over →], yielding an exponential quantum speed-up under some assumptions. Expand
Quantum supremacy using a programmable superconducting processor
TLDR
Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute. Expand
Complexity-Theoretic Foundations of Quantum Supremacy Experiments
TLDR
General theoretical foundations are laid for how to use special-purpose quantum computers with 40--50 high-quality qubits to demonstrate "quantum supremacy": that is, a clear quantum speedup for some task, motivated by the goal of overturning the Extended Church-Turing Thesis as confidently as possible. Expand
Solving mathematical problems with quantum search algorithm
Quantum computation has attracted much attention since it was shown by Shor and Grover the possibility to implement quantum algorithms able to realize, respectively, factoring and searching in aExpand
Efficient quantum circuit implementation of quantum walks
Quantum walks, being the quantum analog of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been developed, including theExpand
...
1
2
3
4
5
...