**quantum-computing**

Explainer: What is a quantum computer? - MIT Technology Review

12 days ago by elrob

But despite their efforts, noise still causes lots of errors to creep into calculations. Smart quantum algorithms can compensate for some of these, and adding more qubits also helps. However, it will likely take thousands of standard qubits to create a single, highly reliable one, known as a “logical” qubit. This will sap a lot of a quantum computer’s computational capacity.

And there’s the rub: so far, researchers haven’t been able to generate more than 128 standard qubits (see our qubit counter here). So we’re still many years away from getting quantum computers that will be broadly useful.

quantum-computing
And there’s the rub: so far, researchers haven’t been able to generate more than 128 standard qubits (see our qubit counter here). So we’re still many years away from getting quantum computers that will be broadly useful.

12 days ago by elrob

(165) Jessica Pointing at the 2018 Quantum Matters™ Science Communication Competition - YouTube

24 days ago by hschilling

Jessica Pointing takes just 3 minutes to explain how quantum algorithms can organize quantum bits (qubits) for solving complex problems

quantum-computing
24 days ago by hschilling

[1807.04271] A quantum-inspired classical algorithm for recommendation systems

6 weeks ago by Vaguery

A recommendation system suggests products to users based on data about user preferences. It is typically modeled by a problem of completing an m×n matrix of small rank k. We give the first classical algorithm to produce a recommendation in O(poly(k)polylog(m,n)) time, which is an exponential improvement on previous algorithms that run in time linear in m and n. Our strategy is inspired by a quantum algorithm by Kerenidis and Prakash: like the quantum algorithm, instead of reconstructing a user's full list of preferences, we only seek a randomized sample from the user's preferences. Our main result is an algorithm that samples high-weight entries from a low-rank approximation of the input matrix in time independent of m and n, given natural sampling assumptions on that input matrix. As a consequence, we show that Kerenidis and Prakash's quantum machine learning (QML) algorithm, one of the strongest candidates for provably exponential speedups in QML, does not in fact give an exponential speedup over classical algorithms.

recommendations
algorithms
quantum-computing
classical-computing
rather-interesting
information-theory
to-understand
6 weeks ago by Vaguery

How Space and Time Could Be a Quantum Error-Correcting Code | Quanta Magazine

6 weeks ago by cierniak

How Space and Time Could Be a Quantum Error-Correcting Code | Quanta Magazine

quantum-computing
physics
from twitter
6 weeks ago by cierniak

Shtetl-Optimized » Blog Archive » Lecture notes! Intro to Quantum Information Science

7 weeks ago by awiedmer

Here’s a 184-page combined file

computing
physics
quantum-computing
lecture-notes
7 weeks ago by awiedmer