Skip to main content

All Questions

3 votes
2 answers
172 views

About how to calculate observables in Quantum Monte Carlo with complex weights

I'm rewriting a Diagrammatic Quantum Monte Carlo algorithm following Werner, P., Oka, T., & Millis, A. J. (2009). Diagrammatic Monte Carlo simulation of nonequilibrium systems. Physical Review B, ...
pter26's user avatar
  • 165
1 vote
0 answers
77 views

Simplest quantum Monte-Carlo method for the Bose-Hubbard model

I want to use quantum Monte-Carlo results to benchmark an algorithm for the Bose-Hubbard model. There are so many QMC methods in the market, so which one is the simplest one? I want the ground state ...
poisson's user avatar
  • 1,957
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 ...
11 votes
1 answer
1k views

Why use Crank-Nicolson over Matrix Exponential when solving Schrödinger's equation?

For Schrödinger's equation, $$\psi(x,t+\Delta t)=e^{-i H\Delta t}\psi(x,t)\approx\frac{1-\frac{1}{2}i H\Delta t}{1+\frac{1}{2}i H\Delta t}\psi(x,t).$$ The right-most expression is the Crank-Nicolson ...
XYZT's user avatar
  • 779
1 vote
0 answers
122 views

Final Hamiltonian for Adiabatic Grover

X-Posted on Quantum-Computing Stack Exchange In quantum computation, there is a famous algorithm to search a marked item in an unstructured database called Grover's algorithm. It achieves a quadratic ...
Hans-Ulrich Rudel's user avatar
4 votes
2 answers
1k views

How to actually find a Hartree-Fock ground state?

I am interested in finding the Hartree-Fock ground state for a system of interacting fermions (with totally local scattering, so a delta-function interaction potential). I have read through some ...
user502382's user avatar
0 votes
1 answer
78 views

Metropolis Algorithm Transition-Proposal Probability

I'm working my way through a short section on the Metropolis algorithm in the lecture notes on Computational Quantum Physics by Prof. Troyer. However, I am not sure what probability distribution was ...
Wasserwaage's user avatar
1 vote
1 answer
100 views

Is photon interference really random? [closed]

I know that according to the many worlds interpretation, there is no randomness and rather there is a universal wave function that simulates an observer with a continuously branching timeline. My ...
Timothy's user avatar
  • 1,668
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
2 votes
1 answer
289 views

Quantum Approximate Optimization Algorithm

I try to understand the 'Quantum Approximate Optimization Algorithm' (QAOA) by Farhi et al. - arXiv:1411.4028. I understand that the solution is hidden in the unitaries, but I do not understand how ...
QuantumMechanics'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
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
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