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 | |
Results tagged with optimization
Search options not deleted
user 14772
For questions concerning how to improve quantum computers on different aspects like performance, efficiency or fault-tolerance.
4
votes
0
answers
38
views
Number of required Qubits for combinatorial optimization problems
In general, are there better ways to encode combinatorial optimization problems, e.g. TSP, than using O(n^2) Qubits and still find optimal solutions (with high probability via Grover)? …
- 495
3
votes
0
answers
35
views
Is the execution of a circuit neglectable for large optimization problems?
Assume a large combinatorial optimization problem should be solved (e.g. via Grover) and further assume there is a (near error free) universal quantum computer with a sufficient number of qubits (and sufficiently …
- 495