An Introduction to Quantum Computing, without the Physics

DOI10.1137/18M1170650MaRDI QIDQ5140614

Giacomo Nannicini

Publication date: 16 December 2020

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.03684

zbMATH Keywords

algorithmsquantum computingopen-source software

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

A Theory of Quantum Subspace Diagonalization ⋮ Fast quantum subroutines for the simplex method

Uses Software

• QISKit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits
• Universal Quantum Simulators
• Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
• Exponential algorithmic speedup by a quantum walk
• Rapid solution of problems by quantum computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum computations: algorithms and error correction
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• Quantum Complexity Theory
• Strengths and Weaknesses of Quantum Computing
• Universal Blind Quantum Computation
• Quantum Computer Science
• Quantum Walk Algorithm for Element Distinctness
• Logical Reversibility of Computation
• A polynomial quantum algorithm for approximating the Jones polynomial

This page was built for publication: An Introduction to Quantum Computing, without the Physics