4
votes
Definitions of a quantum circuit's depth and connectivity
The traditional definitions of classical Boolean circuits work perfectly well here: https://en.wikipedia.org/wiki/Boolean_circuit. This is the definition that gives you Niel de Beaudrap's definition.
...
3
votes
What are the best-known lower bounds on the number of measurements required for quantum state tomography?
This preprint is just submitted a few days ago:
An Improved Sample Complexity Lower Bound for Quantum State Tomography by Henry Yuen.
It shows that $\Omega(rd/\epsilon)$ copies of an unknown rank-$r$, ...
2
votes
Definitions of a quantum circuit's depth and connectivity
Let me try to provide a more precise definition of connectivity in a quantum circuit.
Every quantum circuit defines a graph (network), with vertices (nodes) given by qubits. There is an edge $q_1 q_2$ ...
1
vote
How to deterministically add two integers on a quantum computer
I think you’ve got the basic idea, but a few concepts mixed up.
Every QC will give a probabilistic output only if it is in superposition. If you do not put it into superposition, addition behaves ...
1
vote
Accepted
Definitions of a quantum circuit's depth and connectivity
I would like to give explicit definitions of the circuit depth and connectivity.
I assume that the meaning of terms like vector state, quantum circuit, wires, and 1- and 2-qubit gates is understood.
I'...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
algorithm × 902quantum-gate × 116
grovers-algorithm × 115
programming × 107
qiskit × 84
quantum-state × 83
circuit-construction × 74
complexity-theory × 74
shors-algorithm × 50
hhl-algorithm × 44
deutsch-jozsa-algorithm × 41
mathematics × 36
resource-request × 36
speedup × 36
phase-estimation × 35
entanglement × 33
hamiltonian-simulation × 31
oracles × 31
vqe × 30
machine-learning × 28
quantum-fourier-transform × 27
quantum-advantage × 27
cryptography × 25
classical-computing × 24
qaoa × 24