An introduction to quantum computing, without the physics

DOI10.1137/18M1170650MaRDI QIDQ5140614zbMATH OpenFDO

Authors 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 algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• scientific article; zbMATH DE number 2156270
• An introduction to quantum computing
• Mathematical introduction to quantum computing
• scientific article; zbMATH DE number 7150615
• scientific article; zbMATH DE number 1236366

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• A polynomial quantum algorithm for approximating the Jones polynomial
• Exponential algorithmic speedup by a quantum walk
• Logical Reversibility of Computation
• On the Power of Quantum Computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits
• Quantum Complexity Theory
• Quantum Computer Science
• Quantum Walk Algorithm for Element Distinctness
• Quantum computations: algorithms and error correction
• Quantum computing. A gentle introduction
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Rapid solution of problems by quantum computation
• Strengths and Weaknesses of Quantum Computing
• The Solovay--Kitaev algorithm
• Universal Blind Quantum Computation
• Universal Quantum Simulators

Cited in

(14)

• On the mathematics of quantum computers
• Mathematics for quantum computing
• Quantum computing algorithms for inverse problems on graphs and an NP-complete inverse problem
• Discrete optimization: a quantum revolution?
• scientific article; zbMATH DE number 7150615 (Why is no real title available?)
• Cartoon computation: quantum-like computing without quantum mechanics
• scientific article; zbMATH DE number 2156270 (Why is no real title available?)
• Calculating with quanta
• Quantum computing for discrete optimization: a highlight of three technologies
• scientific article; zbMATH DE number 2156282 (Why is no real title available?)
• Fast quantum subroutines for the simplex method
• Speeding up Grover's algorithm
• A Theory of Quantum Subspace Diagonalization
• Mathematical introduction to quantum computing

Describes a project that uses

Uses Software

• QISKit

This page was built for publication: An introduction to quantum computing, without the physics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140614)