Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
vtomole
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
11 ms
·
61.
▲
Chinese Tycoon Who Criticized Xi’s Response to Coronavirus Has Vanished
(nytimes.com)
11 points
by
vtomole
7y ago
|
0 comments
62.
▲
by
vtomole
7y ago
I love his "Web of Stories": https://www.webofstories.com/play/freeman.dyson/1 . Rest in peace.
63.
▲
by
vtomole
7y ago
You are right. My confusion. Sorry.
64.
▲
by
vtomole
7y ago
oops yeah my apologies!
65.
▲
by
vtomole
7y ago
A group is an algebraic structure. Please reference https://en.wikipedia.org/wiki/Clifford_algebra#Clifford_grou...
66.
▲
by
vtomole
7y ago
Clifford algebra is a big part of quantum computation. The Clifford gates ( https://en.wikipedia.org/wiki/Clifford_gates ) along with Magic state distillation ( https://en.wikipedia.org/wiki/Magic_sta
67.
▲
Quantum Provers to Infinity and Beyond
(blog.computationalcomplexity.org)
1 points
by
vtomole
7y ago
|
0 comments
68.
▲
A Masters Project
(mycqstate.wordpress.com)
1 points
by
vtomole
7y ago
|
0 comments
69.
▲
by
vtomole
7y ago
That coin example is not a proper representative either. There is no possibility for interference. I recommend you explain superposition by making the analogy that in coins, the probabilities are real numbers but in quantum mechanics they a
70.
▲
by
vtomole
7y ago
I like the hands-on tutorial. I have a couple of comments. > teleportation might be a reality ;). Please say "quantum teleportation" instead of "teleportation" so readers don't confuse https://en.wikip
71.
▲
MIP*=Re
(scottaaronson.com)
5 points
by
vtomole
7y ago
|
0 comments
72.
▲
Recent groundbreaking result in complexity theory: MIP*=RE
(arxiv.org)
1 points
by
vtomole
7y ago
|
0 comments
73.
▲
Top quantum computing experiments of 2019
(medium.com)
1 points
by
vtomole
7y ago
|
0 comments
74.
▲
by
vtomole
7y ago
If quantum hardware is the selling point, I'm trying to understand the gain in keeping their SDK closed (If that is what they plan on doing).
75.
▲
by
vtomole
7y ago
I was asking if the software that allows one to program a quantum computer is going to be open-source. Pyquil and Qiskit allow you to run on actual quantum hardware and they are open-source.
76.
▲
by
vtomole
7y ago
> This new service is designed to let you get some hands-on experience with qubits and quantum circuits. Lots of open-source libraries do this[0]. Is Amazon Bracket going to be open-source? [0]: https://github.com/desiree
77.
▲
Qflex: Tensor network, CPU-based quantum circuit simulator
(github.com)
1 points
by
vtomole
7y ago
|
0 comments
78.
▲
by
vtomole
7y ago
> What would Einstein have been without Goedel? Gödel was a child when the theory of relativity was formalized.
79.
▲
by
vtomole
7y ago
Cirq has most of the experiments that were used to demonstrate quantum supremacy[0]. Here is an example of cross-entropy benchmarking; the tool used to benchmark this processor: https://github.com/quantumlib/Cirq/b
80.
▲
Quantum Computing: Lecture Notes
(scirate.com)
3 points
by
vtomole
7y ago
|
0 comments
81.
▲
Hayden-Preskill Thought Experiment
(en.wikipedia.org)
3 points
by
vtomole
7y ago
|
0 comments
82.
▲
Startup Seed Raising Skills
(swooshing.wordpress.com)
2 points
by
vtomole
7y ago
|
0 comments
83.
▲
Researchers demonstrate new path to reliable quantum computation
(phys.org)
1 points
by
vtomole
7y ago
|
0 comments
84.
▲
Quantum Teleportation and Basis Measurements
(vtomole.github.io)
1 points
by
vtomole
7y ago
|
0 comments
85.
▲
by
vtomole
7y ago
Getting a quantum speedup and doing quantum computing are different things. Also, your link refers to a quantum annealer not a universal quantum processor.
86.
▲
by
vtomole
7y ago
> I'll believe their processor is doing quantum computing What do you mean? Quantum processors have been doing quantum computing for a while now. That is, initializing qubits to a known state, performing quantum gates on them, then
87.
▲
by
vtomole
7y ago
Microsoft doesn't have a quantum processor but Google has one.
88.
▲
by
vtomole
7y ago
> Can a QC finally factor 15? For compiled versions of Shor's algorithm, yes. https://arxiv.org/abs/1202.5707
89.
▲
by
vtomole
7y ago
> In a sense, quantum computing needs an upper bound due to its computational complexity. You mean this? https://en.wikipedia.org/wiki/AWPP_(complexity)
90.
▲
by
vtomole
7y ago
> He should know the difference between making something useful and making something hard to simulate. Please provide evidence of this claim.
More ›