Questions tagged [computational-models]

For questions on theoretical models of quantum computations. Such models may be realistically 'build' in real machines, but not necessarily.

Filter by
Sorted by
Tagged with
61 votes
7 answers

What are the models of quantum computation?

It seems that quantum computing is often taken to mean the quantum circuit method of computation, where a register of qubits is acted on by a circuit of quantum gates and measured at the output (and ...
Kiro's user avatar
  • 1,895
10 votes
3 answers

What is the simplest algorithm to demonstrate intuitively quantum speed-up?

What's the simplest algorithm (like Deutsch's algorithm and Grover's Algorithm) for intuitively demonstrating quantum speed-up? And can this algorithm be explained intuitively? Ideally this would be ...
Steven Sagona's user avatar
19 votes
2 answers

How does topological quantum computing differ from other models of quantum computing?

I've heard the term Topological Quantum Computer a few times now and know that it is equivalent to quantum computers using circuits with respect to some polynomial-time reduction. However, it is ...
dtell's user avatar
  • 512
8 votes
1 answer

What good references would you recommend to understand the (continuous-variable) CV model of computation?

If you have good references about the CV model that are understandable from a computer science background, that would be great. If they include numerical examples, that would even be better.
cnada's user avatar
  • 4,644
5 votes
3 answers

Is it possible to simulate a quantum computer in Virtual Reality? If yes, how?

There have been a couple of simulations already made and I recently saw this high performance, hardware accelerated quantum computer simulator QCGPU and started to wonder about how to simulate quantum ...
Jonas Kgomo's user avatar
26 votes
2 answers

What is the difference between quantum annealing and adiabatic quantum computation models?

From what I understood, there seems to be a difference between quantum annealing and adiabatic quantum computation models but the only thing I found on this subject implies some strange results (see ...
Adrien Suau's user avatar
  • 4,777
17 votes
2 answers

In a Quantum Turing Machine, how is the decision to move along the memory tape made?

Let, for a Quantum Turing machine (QTM), the state set be $Q$, and the alphabet of symbols be $\sum=\{0,1\}$, which appear at the tape head. Then, as per my understanding, at any given time while the ...
Prem's user avatar
  • 223
7 votes
1 answer

Are ladder operators ever extensively used in any model of quantum computation?

Computer scientists and others who are interested in learning more about quantum computation might be exposed, or re-exposed, to various concepts and classes of matrices from linear algebra. For ...
Mark Spinelli's user avatar
7 votes
2 answers

What are the pros/cons of Trapped Ion Qubits, Superconducting Qubits and Si Spin Qubits?

Among available qubit technologies for universal quantum computing these 3 come up as promising. NV centers and Majorana qubits also underway but relatively new. I find superconducting qubits and ...
mando's user avatar
  • 355
6 votes
2 answers

Anyon alternatives in topological quantum computing

A topological quantum computer is a theoretical quantum computer that employs two-dimensional quasiparticles called anyons. -Wikipedia Are there other instances of topological quantum computing ...
user820789's user avatar
  • 3,302
5 votes
1 answer

What is entropy quantum computing?

Recently there is news concerning some computational breakthroughs by using so-called "entropy quantum computing":
QGK's user avatar
  • 51
4 votes
1 answer

Chrononic Computing (Time Evolution Systems)

In a recent question about quantum speed-up @DaftWullie says: My research, for example, is very much about "how do we design Hamiltonians $H$ so that their time evolution $e^{-iHt_0}$ creates ...
user820789's user avatar
  • 3,302
4 votes
2 answers

Is quantum parallel search impossible?

Scott Aaronson's blog notably states: Quantum computers would not solve hard search problems instantaneously by simply trying all the possible solutions at once. Is this a statement of a law, as ...
psitae's user avatar
  • 1,310
3 votes
1 answer

Aren't reversible logic gates a necessity for efficiently executing quantum algorithms?

The Wikipedia article on logical reversibility says: ...reversible logic gates offered practical improvements of bit-manipulation transforms in cryptography and computer graphics. But I guess ...
Sanchayan Dutta's user avatar