Questions tagged [approximation]
The approximation tag has no usage guidance.
9
questions
1
vote
0
answers
75
views
Algorithm for finding the appropriate rotating frame Hamiltonian?
Context
Consider an $N$-level Hamiltonian with energies $\omega_1...\omega_N$ with coupling drives at frequencies $f_{i,j}$ which couple the $i$ and $j$-th levels (not necessarily resonantly, so $f_{i,...
- 468
1
vote
0
answers
38
views
Improving operator norm bound on total variation distance
Let $U$ be an $n$-qubit unitary and $P_U(x) = |\langle x |U|0^n\rangle|$ the probability of measuring $x$ after acting $U$ on $|0^n\rangle$. For two $n$-qubit unitaries $U$ and $V$, one can prove that
...
- 397
1
vote
1
answer
92
views
Calculation of Trotter-Suzuki error bound
Suppose we are given Hamiltonian in the form:
$$
H = -\sum_{k=0}^{n-1} \alpha\sigma^x_k\sigma^x_{k+1} +
\beta\sigma^y_k\sigma^y_{k+1} + \gamma\sigma^z_k\sigma^z_{k+1},
$$
where $n$ is the number of ...
- 13
7
votes
2
answers
253
views
Is APPROX-QCIRCUIT-PROB a BQP-complete problem?
I've read contradictory information: on the Wikipedia page for BQP, it is written without proof that "APPROX-QCIRCUIT-PROB is a BQP-complete problem", while I have read elsewhere (don't ...
2
votes
1
answer
66
views
Bounding operator norm by total variation distance
Let $P_U(y \mid x) = |\langle y | U | x \rangle|^2$ denote the probability distribution of obtaining the bitstring $y \in \{0,1\}^n$ on a fixed input $x \in \{0,1\}^n$ w.r.t. the unitary $U$. For $n$-...
- 397
1
vote
0
answers
48
views
Close in operator norm imply close in weak multiplicative sense?
Fix $\epsilon > 0$, and suppose $U$ and $S$ are $n$ qubit unitaries such that $\| U - S \| \leq \epsilon$ (operator norm). Furthermore, let $P_U(y \mid x) = |\langle y | U | x \rangle|^2$ be the ...
- 397
2
votes
0
answers
49
views
Approximating the concatenation of two approximate circuits
Suppose I have two quantum circuits $A_n,B_n$ that I have already found to approximate the operations $U,V$ within some error $\epsilon_n$ and each with an overall circuit depth $\ell_n$ using $n$ ...
- 71
1
vote
0
answers
29
views
Error analysis on the approximation of an adiabatic evolution operator by a QAOA circuit
I would like to know what would be the approximation error of a QAOA circuit.
Suppose we have time-dependent Hamiltonian $H(t) = (1 - s(t))H_{init} + s(t)H_{prob}$ where $H_{init}$ in an initial ...
- 2,339
1
vote
1
answer
334
views
Clifford circuit approximation to a random Clifford circuit
Given a random Clifford state on $L$ qubits (defined as an infinite depth Clifford circuit acting on the zero state), what depth Clifford circuit is required to approximate this state to a given ...
- 330