49 citations · 76 across the 11 of their papers we have counts for
11 papers
Efficient Learning of Clifford-Scrambled Product States
Tobias Haug
Clifford circuits acting on product magic states provide a compact ansatz exhibiting extensive magic, volume-law entanglement, and even classically hard sampling under standard com…
Exponential logical-error reduction in quantum memories via optimal syndrome-measurement timing
Tobias Haug, Kishor Bharti, Leandro Aolita
Syndrome-measurement timing is usually treated as a fixed clock cycle of a quantum error-correcting code. For quantum memories, however, the inter-round interval is itself an optim…
Machine-learned syndrome post-selection for reliable quantum error correction
Tobias Haug, Askery Canabarro, Leandro Aolita
Quantum error correction can be enhanced by post-selecting out runs that are likely to produce a logical failure, but the most accurate measures for that require costly decoder-lev…
Exponential Speed-ups for Structured Goemans-Williamson relaxations via Quantum Gibbs States and Pauli Sparsity
Haomu Yuan, Daniel Stilck França, Ilia Luchnikov +3
Quadratic Unconstrained Binary Optimization (QUBO) problems are prevalent in various applications and are known to be NP-hard. The seminal work of Goemans and Williamson introduced…
Rise and fall of nonstabilizerness via random measurements
Annarita Scocco, Wai-Keong Mok, Leandro Aolita +2
We investigate the dynamics of nonstabilizerness - also known as `magic' - in monitored quantum circuits composed of random Clifford unitaries and local projective measurements. Fo…
Quantum optimization with exact geodesic transport
André J. Ferreira-Martins, Renato M. S. Farias, Giancarlo Camilo +6
We introduce an architecture for variational quantum algorithms that can be efficiently trained via parameter updates along exact geodesics on the Riemannian state manifold. This f…
Disentangling quantum autoencoder
Adithya Sireesh, Abdulla Alhajri, M. S. Kim +1
Entangled quantum states are highly sensitive to noise, which makes it difficult to transfer them over noisy quantum channels or to store them in quantum memory. Here, we propose t…
Large-scale quantum annealing simulation with tensor networks and belief propagation
Ilia A. Luchnikov, Egor S. Tiunov, Tobias Haug +1
Quantum annealing and quantum approximate optimization algorithms hold a great potential to speed-up optimization problems. This could be game-changing for a plethora of applicatio…
Probing quantum complexity via universal saturation of stabilizer entropies
Tobias Haug, Leandro Aolita, M. S. Kim
Nonstabilizerness or `magic' is a key resource for quantum computing and a necessary condition for quantum advantage. Non-Clifford operations turn stabilizer states into resourcefu…
Quantum State Designs with Clifford Enhanced Matrix Product States
Guglielmo Lami, Tobias Haug, Jacopo De Nardis
Nonstabilizerness, or `magic', is a critical quantum resource that, together with entanglement, characterizes the non-classical complexity of quantum states. Here, we address the p…
Complexity of frustration: a new source of non-local non-stabilizerness
J. Odavić, T. Haug, G. Torre +3
We advance the characterization of complexity in quantum many-body systems by examining -states embedded in a spin chain. Such states show an amount of non-stabilizerness or "ma…