Parallel-sequential circuits provide a tunable family of quantum circuit layouts that numerically outperform brickwall, sequential, and log-depth circuits for 1D ground-state preparation under realistic noise models.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
Rigorous bounds establish that t = Theta(k^2) non-Clifford gates are necessary and sufficient for frame-potential approximation to unitary k-designs while t = Theta(nk) suffices for relative-error k-designs.
Optimal weak-measurement reversal for entanglement protection does not coincide with optimal teleportation fidelity under single-sided amplitude damping, but the optima coincide under two-sided damping.
citing papers explorer
-
State preparation with parallel-sequential circuits
Parallel-sequential circuits provide a tunable family of quantum circuit layouts that numerically outperform brickwall, sequential, and log-depth circuits for 1D ground-state preparation under realistic noise models.
-
Non-Clifford Cost of Random Unitaries
Rigorous bounds establish that t = Theta(k^2) non-Clifford gates are necessary and sufficient for frame-potential approximation to unitary k-designs while t = Theta(nk) suffices for relative-error k-designs.
-
Incompatibility of optimized protection of entanglement and teleportation fdelity in the presence of decoherence
Optimal weak-measurement reversal for entanglement protection does not coincide with optimal teleportation fidelity under single-sided amplitude damping, but the optima coincide under two-sided damping.