Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Parham, Natalie"'
Checking whether two quantum circuits are approximately equivalent is a common task in quantum computing. We consider a closely related identity check problem: given a quantum circuit $U$, one has to estimate the diamond-norm distance between $U$ and
Externí odkaz:
http://arxiv.org/abs/2401.16525
Publikováno v:
STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1498-1506
The circuit class $\mathsf{QAC}^0$ was introduced by Moore (1999) as a model for constant depth quantum circuits where the gate set includes many-qubit Toffoli gates. Proving lower bounds against such circuits is a longstanding challenge in quantum c
Externí odkaz:
http://arxiv.org/abs/2311.09631
Autor:
Watts, Adam Bene, Parham, Natalie
Recent work by Bravyi, Gosset, and Koenig showed that there exists a search problem that a constant-depth quantum circuit can solve, but that any constant-depth classical circuit with bounded fan-in cannot. They also pose the question: Can we achieve
Externí odkaz:
http://arxiv.org/abs/2301.00995
This paper introduces two techniques that make the standard Quantum Approximate Optimization Algorithm (QAOA) more suitable for constrained optimization problems. The first technique describes how to use the outcome of a prior greedy classical algori
Externí odkaz:
http://arxiv.org/abs/2108.08805