Quantum Computing Stack Exchange
Quantum Computing Stack Exchange

Most Popular

more tags
1500 questions
8
votes
1 answer

How to delete pending jobs on IBM Quantum Computer to retrieve units?

I am trying to run some code using qiskit, but I get the error message, that I have run out of necessary Experiment Units. I tried to remove pending jobs using the API with the following code for job in api.get_jobs(): if job["status"] ==…
brzepkowski
  • 1,069
  • 7
  • 19
8
votes
1 answer

Can we simulate the Hamiltonian for the Rubik's Cube with "nth-root of SWAP" gates?

I'm interested in, but confused about, local Hamiltonian simulation. I don't yet have enough intuition regarding even the approach set forth by Lloyd in 1996. I think Lloyd's recipe is to repeatedly run a "small" circuit of unitary gates to…
Mark Spinelli
  • 15,378
  • 3
  • 26
  • 83
8
votes
3 answers

Is there a convention for denoting $Y$ eigenstates?

Two common shorthands for eigenstates of the $Z$ operator are $\{|0\rangle,|1\rangle\}$ and $\{|1\rangle,|-1\rangle\}$, where in the first case we have $Z|z\rangle=(-1)^z|z\rangle$ and in the second case we have $Z|z\rangle=z|z\rangle$. The common…
Jahan Claes
  • 1,092
  • 6
  • 13
8
votes
1 answer

How would a Quantum Computer (network) perform loophole-free Bell tests?

In a simple form, Bell's theorem states that: No physical theory of local hidden variables can ever reproduce all of the predictions of quantum mechanics. Bell developed a series of inequalities to provide specific experimental examples to…
agaitaarino
  • 3,907
  • 2
  • 13
  • 42
8
votes
1 answer

Adiabatic Quantum Computing vs Adiabatic Quantum Optimization vs Quantum Annealing

I am aware that of the difference of Adiabatic Quantum Computing (AQC) and Quantum Annealing (QA) as explained here. However, another term which came up in some papers was Adiabatic Quantum Optimization (AQO). Where does AQO fit in among AQC and…
ArcaneArrowX
  • 83
  • 3
8
votes
1 answer

Gradient boosting akin to XGBoost using a quantum device

I am currently trying to implement a boosting algorithm akin to XGBoost with a quantum device. The reason is that I want to make use of a quantum device to train weak classifiers. However, as far as I know, the current quantum device can only be…
QuanFinance
  • 81
  • 2
8
votes
3 answers

Can we synthesize quantum many body systems with quantum computers quickly in the general case?

Quantum computing can be used to efficiently simulate quantum many-body systems. Solving such a problem is classically hard because its complexity grows exponentially with the problem size (roughly with the degree of freedoms), which is an inherent…
peterh
  • 897
  • 2
  • 14
  • 23
8
votes
1 answer

Does superdense coding allow to double the information capacity of a set of qubits?

I read the basic introductory information about qubits on Wikipedia: There are two possible outcomes for the measurement of a qubit—usually 0 and 1, like a bit. The difference is that whereas the state of a bit is either 0 or 1, the state of a…
Kaspar Siricenko
  • 83
  • 5
8
votes
2 answers

Use of the term "dimension" in this description of Simon's algorithm?

In Kaye, Laflamme and Mosca (2007) pg106 they write the following (in the context of Simon's algorithm): ...where $S=\{\mathbf{0},\mathbf{s}\}$ is a $2$-dimensional vector space spanned by $\mathbf{s}$. this is not the only place I have seen this…
Quantum spaghettification
  • 1,532
  • 11
  • 29
8
votes
2 answers

What do we mean by parity of qubits?

I am currently reading "Quantum Computation and Quantum Information" by Nielsen and Chuang. In the section about Quantum Simulation, they give an illustrative example (section 4.7.3), which I don't quite understand: Suppose we have the Hamiltonian…
brzepkowski
  • 1,069
  • 7
  • 19
8
votes
0 answers

How does the extremality of a POVM reflect on its Naimark dilation isometry?

Let $\mu:\Sigma\to\mathrm{Pos}(\mathbb{C}^d)$ be some POVM, with $\Sigma$ the finite set of possible outcomes, and $\mathrm{Pos}(\mathbb{C}^d)$ the set of $d$-dimensional positive semidefinite operators. Write the components of the POVM with $\mu_b,…
glS
  • 27,510
  • 7
  • 37
  • 125
8
votes
1 answer

Intuition for Shor code failure probability

Consider the 9 qubit Shor code. This can detect and correct arbitrary single qubit errors, but if there are 2 or more single qubit errors before a correction round, the correction will fail. (In the sense that it won't reproduce the original logical…
anon1802
  • 215
  • 1
  • 6
8
votes
2 answers

Dependency of architecture on hardware

How much of a role does the type of hardware used to implement the building blocks (like qubits, the circuits, the communication channels,quantum RAM etc.) have to play when designing the architecture for a full scale quantum computer? My own…
ak_nama
  • 353
  • 1
  • 2
  • 7
8
votes
2 answers

Which is the highest number factorized by QC in a non-specific experiment?

Since the original experimental contribution using the Shor's factoring algorithm to factorize the integer 15 some experiments have been performed in order to calculate the largest factorized number. But most of the experiments are particularly…
SalvaCardona
  • 673
  • 3
  • 12
8
votes
2 answers

What is the difference between amplitude amplification, amplitude estimation, and phase estimation?

I'm confused about the difference among Amplitude amplification (AA) , phase estimation (PE), and Amplitude Estimation. I thought I understood AA and PE somewhat but when I heard the amplitude estimation and the circuit looked so similar to phase…
John Parker
  • 1,181
  • 6
  • 15
1 2 3
…
99 100