Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Quantum computation and computational issues related to quantum mechanics
6
votes
Von Neumann architectures and quantum computing
There is a recent article on implementing a quantum von Neumann architecture. They do this via superconducting qubits, of course the implementation is very small, with only 7 quantum parts: two superc …
24
votes
Accepted
Is there a formal proof that quantum computing is or will be faster than classical computing?
This is a question that is a little bit difficult to unpack if you are not familiar with computational complexity. Like most of the field of computational complexity, the main results are widely belie …
2
votes
Energy cost of adiabatic quantum computation
I tend to think of energy of the Hamiltonian as setting the time scale for what we count as 'steps' of the computation. An analogue in standard complexity would be on deciding what we count as a singl …
7
votes
Is there a standard definition of Quantum Randomness?
The randomness used in quantum computing comes from quantum mechanics and is postulated to be an inherent 'randomness' of nature (and one of the problems Einstein, for instance, had with QM). If you t …
9
votes
Applications of Quantum Walks?
With the exception of cryptography applications like Shor's algorithm and quantum key distribution, I think engineering 'killer-apps' are not the norm for quantum computing, and nobody expects them to …
5
votes
Accepted
Are Alice and Bob allowed to copy qubits in quantum communication complexity model?
The general rule of thumb is if you have cloning (and unbounded computation!), then most things get easy. In the case of the qubit-channel communication complexity, Alice can just send her initial sta …
8
votes
Grover's search algorithm for 3 coloring
You don't need to keep track of all $3$ colours for your colouring, because we know how to two colour quickly.
Let the colours be $\{0,1,2\}$. Have an oracle $f: \{0,1\}^{|V|} \rightarrow \{0,1\}$ t …
5
votes
Bounding the gap between quantum and deterministic query complexity
I like Ashley Montanaro's answer, but I thought I would also include a set of functions for which the conjecture is known.
A set of functions which is often of interest is functions with constant-size …
6
votes
Are provable quantum speed-ups possible for classes larger than NP?
For total functions it is impossible to achieve more than a polynomial separation (i.e. $D(f) = O(Q^6(f))$) in the quantum query model, for more info see this cstheory blog post. With promise problems …
15
votes
Universities for Quantum Computing / Information?
To my knowledge, the only institutes/universities currently introducing explicit graduate programs in quantum information processing are: IQC at University of Waterloo, CQT at National University of S …