Most Popular
1500 questions
28
votes
2 answers
Why is it important to eliminate the garbage qubits?
Most reversible quantum algorithms use standard gates like Toffoli gate (CCNOT) or Fredkin gate (CSWAP). Since some operations require a constant $\left|0\right>$ as input and the number of inputs and outputs is equal, garbage qubits (or junk…
Be Brave Be Like Ukraine
- 597
- 1
- 8
- 19
27
votes
6 answers
Counterexamples in quantum information theory
As was already asked about in this phys.SE question many years ago—which, sadly, got closed and never received an answer—is there a collection of counterexamples in quantum information theory, "in the spirit of books like [...] Counterexamples in…
Frederik vom Ende
- 4,242
- 3
- 12
- 49
27
votes
1 answer
What are examples of Hamiltonian simulation problems that are BQP-complete?
Many papers assert that Hamiltonian simulation is BQP-complete
(e.g.,
Hamiltonian simulation with nearly optimal dependence on all parameters and Hamiltonian Simulation by Qubitization).
It is easy to see that Hamiltonian simulation is BQP-hard…
groupsgroupsgroups
- 389
- 2
- 6
27
votes
3 answers
What exactly are anyons and how are they relevant to topological quantum computing?
I have been trying to get a basic idea of what anyons are for the past couple of days. However, the online articles (including Wikipedia) seem unusually vague and impenetrable as far as explaining topological quantum computing and anyons goes.
The…
Sanchayan Dutta
- 18,015
- 8
- 50
- 112
27
votes
4 answers
Why is it crucial that the initial Hamiltonian does not commute with the final Hamiltonian in adiabatic quantum computation?
I've read in many sources and books on adiabatic quantum computation (AQC) that it is crucial for the initial Hamiltonian $\hat{H}_i$ to not commute with the final Hamiltonian $\hat{H}_f$, i.e. $\left[\hat{H}_i,\hat{H}_f\right]\neq 0$. But I've…
Turbotanten
- 606
- 4
- 15
27
votes
2 answers
Who first proposed the idea of quantum computing using qubits?
As I understand it, the field of quantum mechanics was started in the early 20th century when Max Planck solved the black-body radiation problem. But I don't know when the idea of computers using quantum effects spread out.
What is the earliest…
User that hates AI
- 1,067
- 1
- 14
- 28
26
votes
2 answers
What's the difference between T1 and T2?
I learned that T1 is relaxation time (time from $|1\rangle$ to $|0\rangle$) and T2 is coherence time.
The relaxation is a specific case of decoherence.
What's the difference between them and what's the exact meaning of coherence time T2?
peachnuts
- 1,505
- 1
- 10
- 15
26
votes
4 answers
Intuition about Knill-Laflamme QEC conditions
The Knill Laflamme QEC conditions are stated this way:
We consider a code space $C$ and its associated projector $P_C$.
We consider a noise acting on our system: $E(\rho)=\sum_a E_a \rho E_a^{\dagger}$
A necessary & sufficient condition for the…
Marco Fellous-Asiani
- 2,300
- 2
- 15
- 42
26
votes
1 answer
Explicit Conversion Between Universal Gate Sets
I'm interested in the conversion between different sets of universal gates. For example, it is known that each of the following sets is universal for quantum computation:
$\{T,H,\textrm{cNOT}\}$
$\{H,\textrm{c}S\}$, where $S=T^2$ and $S^2=Z$, and…
DaftWullie
- 63,351
- 4
- 57
- 142
26
votes
3 answers
What is the argument that practical quantum computers cannot be built?
An answer to another question mentions that
There are arguments that suggests that such machines ["quantum Turing machines"] cannot even be built...
I'm not sure I fully understand the problem, so perhaps I'm not asking the right question, but…
BurnsBA
- 363
- 3
- 5
26
votes
1 answer
Explicit Lieb-Robinson Velocity Bounds
Lieb-Robinson bounds describe how effects are propagated through a system due to a local Hamiltonian. They are often described in the form
$$
\left|[A,B(t)]\right|\leq Ce^{vt-l},
$$
where $A$ and $B$ are operators that are separated by a distance…
DaftWullie
- 63,351
- 4
- 57
- 142
26
votes
2 answers
Why can't quantum annealing be described by a gate model?
This is a question I was inspired to ask based on this question, which notes that quantum annealing is an entirely different model for computation than the usual circuit model. I've heard this before, and it's my understanding that the gate-model…
Emily Tyhurst
- 1,127
- 10
- 16
25
votes
3 answers
Which quantum error correction code has the highest threshold (as proven at the time of writing this)?
Which quantum error correction code currently holds the record in terms of the highest threshold for fault-tolerance? I know that the surface code is pretty good ($\approx10^{-2}$?), but finding exact numbers is difficult. I also read about some…
M. Stern
- 2,477
- 17
- 40
25
votes
1 answer
Twirling Quantum Channels: Pauli and Clifford Twirling
I am currently working through some papers related with approximations of more general quantum channels such as amplitude and phase damping channels to Pauli channels. The reason to do so is so that the Gottesman-Knill theorem is fulfilled and…
Josu Etxezarreta Martinez
- 4,246
- 17
- 43
25
votes
5 answers
How would I implement the quantum oracle in Deutsch's algorithm?
I am trying to simulate Deutsch's algorithm (elementary case of Deutsch-Jozsa algorithm), and I am not entirely sure how I would go about implementing the quantum oracle necessary for the algorithm to function, without defeating the purpose of the…
Jack Ceroni
- 1,000
- 7
- 17