187 citations · 944 across the 36 of their papers we have counts for
9 papers · 1 filter
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…
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 (NAQC). Our…
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,…
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…
Fermionic Machine Learning
Jérémie Gince, Jean-Michel Pagé, Marco Armenta +2
We introduce fermionic machine learning (FermiML), a machine learning framework based on fermionic quantum computation. FermiML models are expressed in terms of parameterized match…
Low-depth Clifford circuits approximately solve MaxCut
Manuel H. Muñoz-Arias, Stefanos Kourtis, Alexandre Blais
We introduce a quantum-inspired approximation algorithm for MaxCut based on low-depth Clifford circuits. We start by showing that the solution unitaries found by the adaptive quant…
Qubit Vitrification and Entanglement Criticality on a Quantum Simulator
Jeremy Côté, Stefanos Kourtis
Many elusive quantum phenomena emerge from the interaction of a quantum system with its classical environment. Quantum simulators enable us to program this interaction by using mea…
Finite-rate sparse quantum codes aplenty
Maxime Tremblay, Guillaume Duclos-Cianci, Stefanos Kourtis
We introduce a methodology for generating random multi-qubit stabilizer codes based on solving a constraint satisfaction problem (CSP) on random bipartite graphs. This framework al…
Hyper-optimized tensor network contraction
Johnnie Gray, Stefanos Kourtis
Tensor networks represent the state-of-the-art in computational methods across many disciplines, including the classical simulation of quantum many-body systems and quantum circuit…