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 quantum-computing
Search options answers only
not deleted
user 4967
Quantum computation and computational issues related to quantum mechanics
4
votes
Accepted
Papers on using resource states to implement QFT efficiently
Here is a 2018 paper that uses phase gradient states and adders to optimize the T-count of the approximate QFT: "Approximate Quantum Fourier Transform with O(nlog(n)) T gates" by Nam et al.
(The care …
- 1,518
2
votes
Accepted
How do I figure out how to combine simpler quantum gates to create the gate I want?
There are standard ways to approximate any unitary operation with just CNOTs, Hs, and Ts. In the specific case of the Toffoli gate you don't need something so general.
Start with the Toffoli gate:
…
- 1,518
3
votes
Accepted
Quantum circuit simulation divergence in results
Peter Shor nailed the reason. This is because OpenQASM and Quirk have different conventions for how the order of wires maps into the order of bits shown in the kets. The simplest way to check this is …
- 1,518
1
vote
Accepted
Addition on a quantum computer
The algorithm from that paper runs inline with no extra ancilla bits. If the input number and the affected number use up $t$ bits altogether, then it runs in $t$ bits.
3n qubits are required to ad …
- 1,518
1
vote
Accepted
Quantum GCD circuit: On reversibility and clearing ancillae
It looks like they just directly translated the algorithm into a circuit, so it's not too hard to reproduce.
Write out the binary gcd algorithm as a loop:
def gcd(a, b):
let shift = 0
while …
- 1,518
6
votes
Accepted
Simulating quantum measurements by unitaries
The basic idea here is that any operation that uses measurement can be replaced by an operation that instead CNOTs qubits onto ancillae.
Any circuit with an intermediate measurement can be converted …
- 1,518
6
votes
Accepted
Why is it impossible to work with polylog length encoding schemes for quantum circuits?
Clearly you can work with abstract compressed representations of circuits. You can reason about them and manipulate them and turn them into concrete lists of gates. We do it all the time.
But in cont …
- 1,518
30
votes
Accepted
Oracle Construction for Grover's Algorithm
The oracle is basically just an implementation of the predicate you want to search for a satisfying solution to.
For example, suppose you have a 3-sat problem:
(¬x1 ∨ ¬x3 ∨ ¬x4) ∧
(x2 ∨ x3 ∨ ¬x4 …
- 1,518