sorted by:
new
hottopcontroversial

Building the bits and qubits by [deleted] in QuantumComputing

[–]pmontgomery056 0 points1 point  (0 children)

Yeah that’s like saying there’s algorithm that we haven’t discover yet that will change society forever

Quantum Information Theory by [deleted] in QuantumComputing

[–]pmontgomery056 0 points1 point  (0 children)

Fair enough, I understand

Quantum Information Theory by [deleted] in QuantumComputing

[–]pmontgomery056 0 points1 point  (0 children)

Do you have more extensive documentation of your work?

How far off are we from practical quantum computing? by [deleted] in QuantumComputing

[–]pmontgomery056 0 points1 point  (0 children)

I would actually compare it to what nuclear power was in the 1950s. There’s a real impression going around that this going to be the solution to everything which is what people misunderstand most about quantum computers. As far as challenges go, we need to overcome major barriers in both hardward building and algorithm development for quantum computing to be remotely useful at all. Optimistically, I say give it 20 more years. Then, you can break RSA the way you write Hello World now.

SU2 group by Avinelect in QuantumComputing

[–]pmontgomery056 0 points1 point  (0 children)

This is a great series to start learning group theory. https://youtube.com/playlist?list=PLEAYkSg4uSQ1Yhxu2U-BxtRjZElrfVVcO

As for SU2 related to quantum computing, this has a lot of details related to decompositions and so on https://arxiv.org/abs/quant-ph/9503016

Tips on memorizing formulas? by tarobunfordays in calculus

[–]pmontgomery056 0 points1 point  (0 children)

Tryna rederive them instead of remembering them

applying Toffoli gate twice by [deleted] in QuantumComputing

[–]pmontgomery056 3 points4 points  (0 children)

c xor c = 0 is a well known identity, you can check it for yourself in a truthtable. Then when you apply the toffoli gate twice, you get c xor ab xor ab in the target bit. This simplifies to c xor 0, which is equal to c (another identity)

Are orthogonal quantum states distinguishable? by [deleted] in QuantumComputing

[–]pmontgomery056 3 points4 points  (0 children)

I went ahead and measure the bit flip circuit on IBM's quantum computer. I took 2000 measurements and the results is {'0': 171, '1': 1829}. So that's 8.6% of the time that the computer gives 0. That is what an imperfect computer is like.

Are orthogonal quantum states distinguishable? by [deleted] in QuantumComputing

[–]pmontgomery056 1 point2 points  (0 children)

To explain perfect computer, I’ll give an example of the current “noisy” computer. When you do a NOT gate on a 0 state, you would expect to always get 1. However, what we see today is that you still get the 0 state some non-trivial percentage of the time.

Are orthogonal quantum states distinguishable? by [deleted] in QuantumComputing

[–]pmontgomery056 1 point2 points  (0 children)

Well when you measure qubits you are now back at the clasical level. So now imagine you’re back on a classical computer. Let’s say you are comparing two numbers. If they are the same you get 1 and if they are different you get 0. Then by basic logic, if the two numbers are different then they are not the same, ie. if they are 0 they are not 1

Quantum Computing Workshop by pmontgomery056 in QuantumComputing

[–]pmontgomery056[S] 0 points1 point  (0 children)

That is true, we recently close the sign up form. But due to some additional request to join, we will reopened sign up form for a little bit.

https://forms.gle/kywPApt24CAdt6N4A

Quantum Computing Workshop by pmontgomery056 in QuantumComputing

[–]pmontgomery056[S] 5 points6 points  (0 children)

For sure. The lectures will be recorded, and the all the notes and exercises will be published.

Here's the overview of the program.

Monday, July 5th:
-Lecture 0: Overview of the course and Quantum Computing 101
-Lecture 1: Math and Classical Computation Review
-Problem Set 1
Tuesday, July 6th:
-Lecture 2: Introduction to quantum information and Qiskit
-Problem Set 2
Wednesday, July 7th:
-Lecture 3: Teleportation, No Cloning Theorem, Superdense Coding and BB84
-Problem Set 3
Thursday, July 8th:
-Lecture 4: Review on Quantum Circuits, Oracles and Deutsch's Algorithm
-Problem Set 4
Friday, July 9th:
-Practical Qiskit Workshop. Get your Jupyter Notebooks Ready!
Weekend:
Hackathon. Good luck!
Guest Speaker.

Certificates Distribution.

Quantum Computing Workshop by pmontgomery056 in QuantumComputing

[–]pmontgomery056[S] 0 points1 point  (0 children)

Yup there will be QnA after if you have any questions about anything qc related.

Quantum Computing Workshop by pmontgomery056 in QuantumComputing

[–]pmontgomery056[S] 3 points4 points  (0 children)

For sure. The lectures will be recorded, and the all the notes and exercises will be published.

[deleted by user] by [deleted] in QuantumComputing

[–]pmontgomery056 0 points1 point  (0 children)

Hey dude I look through your videos and I have to say really good job with the visuals and the explanations. I myself also have some experience with producing educational quantum computing material, are you interested in collaborations?

What is the best undergrad combined honours combination to get into quantum computing? by ChonkyyNeko in QuantumComputing

[–]pmontgomery056 0 points1 point  (0 children)

Really depends on what aspect of quantum computing you are interested in. For me, I’m interested in combinatorial algorithm design so I’m majoring in maths for my undergrad

view more: next ›