q-2023-11-14-1183.pdf

…versed edge by edge, starting from the leaves. Each time a defect is encountered all edges traversed there- after, until another defect is encountered, are added to C. Once the…

q-2023-04-20-986.pdf

…fermions, each si ∈ {0, 1}, and the orthogonal sum in Equation (19) goes un- til dI , instead of ∞. For a given gate, the output Fock space GO…

q-2018-08-08-80.pdf

…calculated, and this gener- ates another guess for the optimal values. This is iterated until the values get close enough to the goal, or the process terminates unsuccessfully af- Accepted…

q-2023-07-12-1057.pdf

Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints Taylor L. Patti1,2, Jean Kossaifi2, Anima Anandkumar3,2, and Susanne F. Yelin1 1Department of Physics, Harvard University, Cambridge, Massachusetts 02138,…

q-2018-08-06-80.pdf

…is calculated, and this gener- ates another guess for the optimal values. This is iterated until the values get close enough to the goal, or the process terminates unsuccessfully af-…

q-2021-10-06-559.pdf

…given quantum circuits, it is typically optimal to merge quantum gates until every quantum gate acts on at most two qubits in the case of random quantum circuits. To minimize…

q-2021-01-20-384.pdf

…on the setting and outcome that have occurred at the first node; this continues un- til all nodes have been used, with the probability for each subsequent event generally depending…