Quantum Computing Stack Exchange
Quantum Computing Stack Exchange

Most Popular

more tags
1500 questions
9
votes
2 answers

How to program a controlled Hadamard-Hadamard gate?

I'm trying to program a controlled gate as the figure below in Qiskit. Should it be sufficient to separate and control individually the Hadamard gates?
German Alamilla
  • 135
  • 4
9
votes
2 answers

How is the decoherence rate connected to the error rate?

I'm reading about the threshold theorem, which states that "a quantum computer with a physical error rate below a certain threshold can, through the application of quantum error correction schemes, suppress the logical error rate to arbitrarily low…
VannyUW
  • 91
  • 1
9
votes
4 answers

Controlled Hadamard gate in ZX-calculus

What is the representation of the CH gate in ZX-calculus? Is there a general recipe for going from a ZX-calculus representation of a gate to the representation of the controlled version?
Daniel Mahler
  • 331
  • 1
  • 5
9
votes
1 answer

Simulating a system inside a system

The minimum size of a computer that could simulate the universe would be the universe itself. This is quite a pretty big theory in classical computing and physics because to contain the information of the whole universe, you require a minimum…
Yuzuriha Inori
  • 524
  • 2
  • 10
9
votes
0 answers

Is there a BQP algorithm for each level of the polynomial hierarchy PH?

This question is inspired by thinking about quantum computing power with respect to games, such as chess/checkers/other toy games. Games fit naturally into the polynomial hierarchy $\mathrm{PH}$; I'm curious about follow-up questions. Every Venn…
Mark Spinelli
  • 11,947
  • 2
  • 19
  • 65
9
votes
2 answers

Will quantum computers be able to solve the game of chess?

Will it be possible to use quantum computing to one day solve the game of chess? If so, any estimate as to how many qubits it would require? The game of checkers has already been solved through back in 2007 after years of number crunching. But they…
lkessler
  • 191
  • 2
  • 5
9
votes
2 answers

How to prove that the query oracle is unitary?

The query oracle: $O_{x}|i\rangle|b\rangle = |i\rangle|b \oplus x_{i}\rangle$ used in algorithms like Deutsch Jozsa is unitary. How do I prove it is unitary?
Divyat
  • 93
  • 4
9
votes
2 answers

Fast way to check if two state vectors are equivalent up to Pauli operations

I'm looking for fast code, or a fast algorithm, for checking if a given state vector $A$ can be transformed into another state vector $B$ using only the Pauli operations $X$, $Y$, $Z$. The naive strategy is to simply iterate through all $4^n$ ways…
Craig Gidney
  • 36,389
  • 1
  • 29
  • 95
9
votes
1 answer

Quantum teleportation with moving Alice and Bob

I have questions regarding quantum teleportation, which keep confusing me. Suppose Alice and Bob are in the same inertial frame $K$, and at time $t$ (in $K$) Alice teleports a quantum state to Bob. What I always hear is that this means that at time…
Tamás V
  • 101
  • 2
9
votes
1 answer

Current limits on Grover search space

I was wondering why till date Grover search has been implemented only till 3 qubits (corresponding to size of database = 8). Refer this paper The reason why I ask is that we have much larger sized quantum computers today. For eg IBM has 50 qubits,…
Maharshi Ray
  • 191
  • 2
9
votes
1 answer

What is the complexity of the quantum phase estimation in Grover's algorithm?

Suppose we are using GA (Grover's algorithm) such that we are given it has 2 or more solutions. The search space is of size $N$. We all know Grover's algorithm has, at worst, a time complexity proportional to $\sqrt{N}$. Now assume we are using…
Learner
  • 336
  • 1
  • 6
9
votes
2 answers

Optimal strategy to a quantum state game

Consider the following game: I flip a fair coin, and depending on the outcome (either heads/tails), I'll give you one of the following states: $$|0\rangle \text{ or } \cos(x)|0\rangle + \sin(x)|1\rangle.$$ Here, $x$ is a known constant angle. But, I…
jjbid
  • 91
  • 4
9
votes
2 answers

Why doesn't Deutsch-Jozsa Algorithm show that P ≠ BQP?

To my understanding, Deutsch-Jozsa algorithm solves a specific problem in constant time, using a fixed circuit depth, compared to a classical deterministic algorithm, which would require time exponential to the number of bits used to store the…
3yakuya
  • 632
  • 3
  • 10
9
votes
3 answers

Proof of optimality for CHSH game classical strategy

I'm aware that the optimality of the quantum strategy for the CHSH game is given by Tsirelson's bound, but presentations all skip over the (admittedly much less interesting) proof of the classical strategy's optimality. In the CHSH game, we have two…
ahelwer
  • 4,128
  • 1
  • 13
  • 33
9
votes
1 answer

Building Intuition for Relative Von Neumann Entropy

This is how I think about classical relative entropy: There is a variable that has distribution P, that is outcome $i$ has probability $p_i$ of occuring, but someone mistakes it to be of a distribution Q instead, so when outcome $i$ occurs, instead…
Mahathi Vempati
  • 1,621
  • 9
  • 20
1 2 3
…
99 100