
Quantum Computing Methods for Supervised Learning
The last two decades have seen an explosive growth in the theory and pra...
read it

An Introduction to Quantum Computing for NonPhysicists
Richard Feynman's observation that quantum mechanical effects could not ...
read it

A comparative study of universal quantum computing models: towards a physical unification
Quantum computing has been a fascinating research field in quantum physi...
read it

Teaching Quantum Computing to an Audience Beyond Physicists: A Case Study over 22 Workshops in 10 Countries
Quantum computing is a topic mainly rooted in physics, and it has been g...
read it

Quantum Software Models: The Density Matrix for Classical and Quantum Software Systems Design
Linear Software Models enable rigorous linear algebraic procedures for m...
read it

Best Subset Selection: Statistical Computing Meets Quantum Computing
With the rapid development of quantum computers, quantum algorithms have...
read it

An Algorithm for Computing Invariant Projectors in Representations of Wreath Products
We describe an algorithm for computing the complete set of primitive ort...
read it
An Introduction to Quantum Computing, Without the Physics
This paper is a gentle but rigorous introduction to quantum computing intended for computer scientists. Starting from a small set of assumptions on the behavior of quantum computing devices, we analyze their main characteristics, stressing the differences with classical computers, and finally describe two wellknown algorithms (Simon's algorithm and Grover's algorithm) using the formalism developed in previous sections. This paper does not touch on the physics of the devices, and therefore does not require any notion of quantum mechanics.
READ FULL TEXT
Comments
There are no comments yet.