« first day (469 days earlier)      last day (1758 days later) » 

3:30 AM
0
Q: There seems to be a problem with the implementation of identity gates on Qiskit as compared to the circuit composer

JonasI have been experimenting with slowing down the decay of qubits, and as a control, I implemented a circuit with just identity gates for comparison. However, when I implement such circuits in Qiskit, no matter how many identity gates I put, I get about the same fidelity each time. For example, I i...

 
 
1 hour later…
4:34 AM
0
Q: What is the intuition of using Hadamard gate in quantant fourier transform?

user3176354According to this answer by rrtucci , I still cannot catch the spirit of QFT algorithm. So I would like to ask why we are using Hadamard Gate when computing Fourier Transform? Moreover, what is the main idea behind Hadamard Gate? Thank you!

 
 
5 hours later…
9:38 AM
1
Q: How to do randomised benchmarking for non-Clifford gates on Qiskit?

Darren NgFor my summer research internship I'm looking to randomized benchmark (RB) non-Clifford gates for a single qubit. Since I found out that Qiskit ignis allows for the RB of Clifford gates (https://github.com/Qiskit/qiskit-tutorials/blob/master/qiskit/ignis/randomized_benchmarking.ipynb), naturally ...

 
 
1 hour later…
11:00 AM
0
Q: How to derive a circuit from given equations?

Nimish MishraI was reading a paper on Quantum Neural Networks where the authors discussed a new back propagation algorithm. They shared a schematic of the circuit. However, I am unable to understand how the proposed circuit can be derived from the equations derived. Can anybody shed some light? The paper can...

 
11:31 AM
1
Q: Entanglement of Werner States

PhysMathLet the Werner state $$\rho_W = W\mid\Psi^-\rangle\langle\Psi^-\mid + \frac{1-W}{4}\mathbb{I},\ W\in [0,1],$$ where $|\Psi^-\rangle=(|01\rangle+|10\rangle)/\sqrt{2}$. I have repeatedly heard that such a state is separable if $W\leq\frac{1}{3}$ and entangled otherwise. I would like to see where e...

 
0
Q: Coding an oracle for Simon's algorithm

Ronen RazI am trying to implement Simon's algorithm which calls for a 2-to-1 mapping function that satisfies f(x) = f(x⊕s). I am looking for a simple way to code the oracle (using H, Cx, and R gates), ideally with an easy way to redefine s.

 
 
3 hours later…
3:03 PM
0
Q: How to calculate the quantum Volume?

lufydadI read the article of IBM on Quantum Volume. But I don't understand how to calculate effective error rate, and therefore the Quantum Volume. If someone have an example of calculation ?

 
 
7 hours later…
10:30 PM
0
Q: Minimum Spanning Tree on D Wave Processor

MaxwellsequationsI am attempting to implement a minimum spanning tree problem on the D wave quantum computing architecture. I have seen many graph problems implemented, such as a graph coloring example. There are also a variety of Traveling Salesman Tutorials available. What would be the best approach for making ...

posted on June 25, 2019 by Winterstorm D

If the series of 0s and 1s in a computer can be accelerated, decelerated constantly, in their presentation, then there would be no noise in a regular computer. The series of 0s and 1s, run out into an approximation of a graph paper grid. The diagonal of a square is longer than the edge, so that if the algorithm being run is a quantum algorithm, the grid of 0s and 1

 

« first day (469 days earlier)      last day (1758 days later) »