8 papers
The table maker's quantum search
Benjamin C. A. Morrison, Stefanos Kourtis
We show that quantum search can be used to compute the hardness to round an elementary function, that is, to determine the minimum working precision required to compute the values…
Concentration-Free Quantum Kernel Learning in the Rydberg Blockade
Ayana Sarkar, Martin Schnee, Sangeeth Das Kallullathil +4
Quantum kernel methods (QKMs) offer an appealing framework for machine learning on near-term quantum computers. However, QKMs generically suffer from exponential concentration, req…
Counting with the quantum alternating operator ansatz
Julien Drapeau, Shreya Banerjee, Stefanos Kourtis
We introduce a variational algorithm based on the quantum alternating operator ansatz (QAOA) for the approximate solution of computationally hard counting problems. Our algorithm,…
Unconventional early-time relaxation in the Rydberg chain
Martin Schnee, Roya Radgohar, Stefanos Kourtis
We show that unconventional relaxation dynamics of special initial states in one-dimensional arrays of Rydberg atoms produce non-generic decay of the initial-state survival probabi…
Quantum Counting in the Rydberg Blockade
Joseph Gibson, Victor Drouin-Touchette, Stefanos Kourtis
We propose a quantum algorithm for approximately counting the number of solutions to planar 2-satisfiability (2SAT) formulas natively on neutral atom quantum computers. Our algorit…
Postselection-free experimental observation of the measurement-induced phase transition in circuits with universal gates
Xiaozhou Feng, Jeremy Côté, Stefanos Kourtis +1
Monitored many-body systems can exhibit a phase transition between entangling and disentangling dynamical phases by tuning the strength of measurements made on the system as it evo…