vtomole

15 ms·

121.
by vtomole 8y ago
The quantum computer is accessed through the cloud.
122.
by vtomole 8y ago
Boson sampling is not universal. On the other hand, it could be used to demonstrate a quantum advantage: https://arxiv.org/abs/1011.3245 .
123.
Cirq: A quantum programming library in Python(github.com)
83 points by vtomole 8y ago|7 comments
124.
Scott Aaronson on Computational Complexity Theory and Quantum Computers(youtube.com)
2 points by vtomole 8y ago|0 comments
125.
Is quantum computing just pie in the sky?(quantumcomputing.stackexchange.com)
2 points by vtomole 8y ago|0 comments
126.
Why is it harder to build quantum computers than classical computers?(quantumcomputing.stackexchange.com)
2 points by vtomole 8y ago|0 comments
127.
The race to build a quantum economy(axios.com)
3 points by vtomole 8y ago|0 comments
128.
Get $2,000 for your open source quantum computing project(medium.com)
2 points by vtomole 8y ago|0 comments
129.
An algorithm for machine learning on near-term quantum computers(medium.com)
1 points by vtomole 8y ago|0 comments
130.
$16M grant bolsters Yale’s quantum computing research(news.yale.edu)
2 points by vtomole 8y ago|0 comments
131.
Keeping America first in quantum computing means avoiding these mistakes(technologyreview.com)
2 points by vtomole 8y ago|0 comments
132.
Was the reduction in Shor's algorithm originally discovered by Shor?(cstheory.stackexchange.com)
2 points by vtomole 8y ago|0 comments
133.
PyQuil 1.9 is now available(rigetticomputing.github.io)
3 points by vtomole 8y ago|0 comments
134.
Simon Benjamin on Architectures for Quantum Computing(blog.ycombinator.com)
2 points by vtomole 8y ago|0 comments
135.
The world’s first quantum software superstore–or so it hopes–is here(technologyreview.com)
1 points by vtomole 8y ago|1 comments
136.
Lisp, the Quantum Programmer's Choice [video](youtube.com)
2 points by vtomole 8y ago|0 comments
137.
Analyzing Quantum Programs(w.avontell.com)
1 points by vtomole 8y ago|0 comments
138.
by vtomole 9y ago
This paper is a good example of how much progress we've had in quantum algorithm research since the dawn Quantum information science. Here is another good survey for people who want to learn more about quantum algorithms [0]. From the
139.
by vtomole 9y ago
Hey Dave, your lecture notes [0] helped us a lot when we were building our simulator [1]. Thank you! [0]: https://courses.cs.washington.edu/courses/cse599d/06wi/ [1]: https://github.com/QCHack
140.
by vtomole 9y ago
Could you give me an example of different use cases for libquantum vs qiskit? Thanks.
141.
by vtomole 9y ago
That survey was written over 10 years ago. The field of quantum computation has grown by leaps and bounds since then. Modern quantum programming languages like pyQuil [0], Qiskit [1], and Q# [2] are designed to address the progress of quant
142.
by vtomole 9y ago
D-Wave doesn't have a quantum computer. They have a quantum annealer.
143.
Quantum Computing limited private beta(quantumcomputing.stackexchange.com)
3 points by vtomole 9y ago|0 comments
144.
by vtomole 9y ago
>Made me skeptical about this being any kind of breakthrough. As you should. Google is planning on sharing the results of this processor soon: https://research.googleblog.com/2018/03/a-preview-of-bristle...
145.
by vtomole 9y ago
Qubit quality is defined by the quantum volume [0]. Errors that occur when gates are applied to qubits need to be below a certain threshold to perform error correction. [0]: https://www.research.ibm.com/ibm-q/resources&
146.
by vtomole 9y ago
That is not how Shor's algorithm works. To factor a number N, Shor's algorithm uses a classical computer to pick a random number a where a < N. A quantum computer is used to find the period of f(x) = a^x mod N. This Wikipedia e
147.
by vtomole 9y ago
It will take hundreds of fault tolerant qubits. That means it will take potentially millions of physical qubits of relatively high quality. There is a long road ahead from 72 relatively medium quality to millions of relatively high quality
148.
by vtomole 9y ago
The basics of quantum computing are not difficult if you know linear algebra. The state of a qubit is described using a column vector that holds complex numbers. Gate operations are performed by multiplication on the states with unitary mat
149.
by vtomole 9y ago
That's right. HHL doesn't find x for Ax = b. It finds the result of a scalar measurement on x. Like you said, a garbage result is generated if the state is measured naively. It's rare for quantum algorithms to be drop-in repl
150.
Is There Anything Beyond Quantum Computing?(pbs.org)
3 points by vtomole 9y ago|0 comments

More ›