I want to run code on ibm qx, and I choose the backend "simulator", I also use the monitor to check the queue, but I have this problem.
"Job is actively running" still a long time, how can I solve this problem?
Thanks a lot.
Quantum depth-2 circuits can be efficiently simulated classically, as shown in Proposition 2 of this paper. The following is a quote of the proof.
After the first time step the quantum state of the circuit consists of
a set of 2-qubit entangled states and possibly some 1-qubit states and
...
I'm trying to reproduce the results of this article https://arxiv.org/abs/1801.03897, using Qiskit and Xanadu PennyLane.
Particularly, this part with expected values of the Pauli operators:
For Ansatz circuit from the mentioned article
I can get the same results for $\langle Z_0 \rangle$ a...
Do the quantum computing experiments based on linear optics form their own class? If so where is it between $BQP$ and $BPP$ and is there a complete language?
Let $ a_1, a_2 $ be annihilation operators for the first and second component in
the product state $|m,n \rangle$ using Fock basis.
I want to show for $r \in \mathbb R$,
$$e^{(a_1 ^\dagger a_2^\dagger - a_1a_2)r}|0,0 \rangle = \frac{1}{\cosh r} \sum_{j=0}^\infty (\tanh r)^j |j,j \rangle$$
ho...
It is an open question if every $d$-dimensional Hilbert space contains a collection of $d^2$ states, such that every two have a scalar product of $\frac{1}{d+1}$, i.e. if a SIC-POVM exists for every dimension.
However, I don't understand why $d^2$ is the ultimate upper bound for the size of suc...
From my understanding a ‘hidden variable theory’ is just saying that the current quantum theory is not a complete description of nature, and just like thermodynamics can be reduced to deterministic rules (statistical mechanics), the probabilistic nature of the wave function can be reduced to dete...
I'm constantly confused by some of nomenclature that is associated with symmetries in quantum Hamiltonians and was hoping someone could set me straight.
Specifically, we often have something like a quantum transverse Ising model with
$$
H = \sum_i Z_i Z_{i+1} + \sum_i X_i
$$
where $Z_i$ is the P...
I want to run code on ibm qx, and I choose the backend "simulator", I also use the monitor to check the queue, but I have this problem.
"Job is actively running" still a long time, how can I solve this problem?
Thanks a lot.
Quantum depth-2 circuits can be efficiently simulated classically, as shown in Proposition 2 of this paper. The following is a quote of the proof.
After the first time step the quantum state of the circuit consists of
a set of 2-qubit entangled states and possibly some 1-qubit states and
...
I'm trying to reproduce the results of this article https://arxiv.org/abs/1801.03897, using Qiskit and Xanadu PennyLane.
Particularly, this part with expected values of the Pauli operators:
For Ansatz circuit from the mentioned article
I can get the same results for $\langle Z_0 \rangle$ a...
Do the quantum computing experiments based on linear optics form their own class? If so where is it between $BQP$ and $BPP$ and is there a complete language?
Let $ a_1, a_2 $ be annihilation operators for the first and second component in
the product state $|m,n \rangle$ using Fock basis.
I want to show for $r \in \mathbb R$,
$$e^{(a_1 ^\dagger a_2^\dagger - a_1a_2)r}|0,0 \rangle = \frac{1}{\cosh r} \sum_{j=0}^\infty (\tanh r)^j |j,j \rangle$$
ho...
It is an open question if every $d$-dimensional Hilbert space contains a collection of $d^2$ states, such that every two have a scalar product of $\frac{1}{d+1}$, i.e. if a SIC-POVM exists for every dimension.
However, I don't understand why $d^2$ is the ultimate upper bound for the size of suc...
