Skip to main content

All Questions

0 votes
0 answers
37 views

Is Quantum State Tomography (QST) an inherently supervised or unsupervised problem in Machine Learning?

I am studying how to apply neural networks to the problem of Quantum State Tomography (QST) and I got confused when it comes to decide if this is a supervised or unsupervised learning problem. At ...
Dimitri's user avatar
  • 161
2 votes
0 answers
34 views

Algorithm that checks if a subspace of states contains a product state

Suppose I have two identical qudits, the full Hilbert space is $\mathcal{H}=(\mathbb{C}^{d})^{\otimes 2}$. Say I'm given a supspace of states $\Lambda\subset \mathcal{H}$. What is the fastest ...
Lagrenge's user avatar
  • 883
2 votes
0 answers
207 views

How Do Quantum Computers Work, Like Really [closed]

I understand in plain terms superposition and entanglement, but I'm very unclear how either of these could work as a means to increase computation power. A helpful metaphor is that of the maze. A ...
WriterState's user avatar
1 vote
1 answer
336 views

Number of qubits required in Shor's algorithm

People say that the number of qubits required in Shor's algorithm for factorizing $N$ should be $2\log N$ for control register and $\log N$ for target register. What is the reason why these numbers of ...
William's user avatar
  • 185
1 vote
0 answers
140 views

Is there a comparison table for quantum algorithms like VQE, QPE, QAOA, and so on?

I have one question: Recently, I studied about several algorithms like VQE, QPE, QAOA and so on. I would like to make some comparison tables about those algorithms, their strengths and weaknesses. If ...
5 votes
2 answers
361 views

Is the universe's Kolmogorov complexity growing over time?

The Kolmogorov complexity of a deterministic universe is constant. The Kolmogorov complexity of a nondeterministic universe grows over time. It grows whenever something happens that is not ...
LinusK's user avatar
  • 129
1 vote
1 answer
746 views

Bell State Measurement Algorithm

I'm relatively new to quantum computation and am taking a course in it. I was wondering if it is possible to code an algorithm which would be able to take an input of a 2 qubit state and perform a ...
Will's user avatar
  • 21
5 votes
0 answers
460 views

Is the only difference between tDMRG and TEBD the way the central sites are shifted?

I have been reading up on time evolution methods using matrix product states. Reading from Schollwoeck's notes on the density matrix renormalization group, (https://arxiv.org/abs/1008.3477), I looked ...
user147177's user avatar
0 votes
2 answers
290 views

Shor's algorithm with adversary - can (delayed) erasure of value qubits cripple calculations?

Let's look at quantum subroutine of Shor's algorithm: Hadamard gates create superposition of all (exponential number) values for input qubits. Then we perform a classical function on them, which is ...
Jarek Duda's user avatar
9 votes
2 answers
2k views

Shor's algorithm - why doesn't the final collapse of the auxiliary qubits cripple the computation?

Let's look at quantum subroutine of Shor's algorithm (image source): Hadamard gates create superposition of all (exponential number) values for input qubits. Then we perform a classical function ...
Jarek Duda's user avatar
0 votes
1 answer
101 views

What does "given one application of a black box" mean, in a quantum-computing context?

From Kaye, Laflamme and Mosca's An Introduction to Quantum Computing: Exercise 7.1.1 (Bernstein-Vazirani problem) Show how to find $\mathbf a \in Z_2^n$ given one application of a black box that maps ...
Keith's user avatar
  • 1,669
1 vote
0 answers
230 views

Shor's algorithm - its causality and similar exploitation of QM?

Shor's algorithm is rather the most interesting quantum algorithm as it shifts a problem which is believed to need exponential classical time, to polynomial time for quantum computer, additionally ...
Jarek Duda's user avatar
2 votes
3 answers
386 views

Where is a classical computer better than a quantum one? [closed]

Where is a classical computer better than a quantum computer? Is there any known domain where classical algorithms always beat quantum ones, say, both in terms of time and space complexity? If yes,...
MrFrety's user avatar
  • 168
0 votes
1 answer
197 views

Assumptions in the proofs for the optimality of Grover's Search Algorithm

I was trying to understand this paper in which it is proved that Grover's search algorithm is optimal. On page 4, beginning of section 2 of the paper the author says the following In the proof I ...
Rajath Radhakrishnan's user avatar
0 votes
0 answers
75 views

Using quantum state tomography in quantum search algorithms

Problem statement: The search space A involves elements $|0\rangle $, $|2\rangle$... $|d-1\rangle$. An oracle is provided for the function $f(x)$ where \begin{align} f(x)&=1 \quad x=x^{'}\in A \\ ...
Rajath Radhakrishnan's user avatar

15 30 50 per page