activity
20122026
most citedPredicting Many Properties of a Quantum System from Very Few Measurements

1.2k citations · 4.9k across the 66 of their papers we have counts for

collaborators

74 papers

quant-ph2026

(A Variant of) Clifford Circuit Synthesis is NP-Complete

Luna Lima Keller, Richard Kueng

Optimal circuit synthesis is the problem of finding the shortest-depth circuit representation of a given functionality with respect to a pre-specified elementary gate set. This is…

quant-ph2026

Local robust shadows on a trapped ion computer -- a case study

Jadwiga Wilkens, Milena Guevara-Bertsch, Marwa Marso +6

We experimentally demonstrate local robust shadows on a trapped-ion quantum computing system, a protocol developed to counteract measurement errors. We alternate between a calibrat…

quant-ph2026

Harmoniq: Efficient Data Augmentation on a Quantum Computer Inspired by Harmonic Analysis

Kristina Kirova, Monika Doerfler, Franz Luef +1

Quantum machine learning has attracted significant interest in recent years. Most existing approaches, however, are variational in nature and require extensive parameter optimizati…

quant-ph2026

An Online Approach for Entanglement Verification Using Classical Shadows

Marwa Marso, Sabrina Herbst, Jadwiga Wilkens +3

Quantum measurements are slow, while classical processors are fast, yet existing hybrid protocols never exploit this asymmetry. In this work, we propose an alternative formulation…

quant-ph2026

QuickQudits: A Framework for Efficient Simulation of Noisy Qudit Clifford Circuits via an Extended Stabilizer Tableau Formalism

Nina Brandl, Mykyta Cherniak, Johannes Kofler +1

We present a comprehensive and self-contained framework for the efficient classical simulation of Clifford circuits acting on -dimensional qudits, including realistic Pauli/Weyl…

quant-ph2026

Parametric Quantum State Tomography with HyperRBMs

Simon Tonner, Viet T. Tran, Richard Kueng

Quantum state tomography (QST) is essential for validating quantum devices but suffers from exponential scaling in system size. Neural-network quantum states, such as Restricted Bo…

quant-ph2025

A Rigorous Quantum Framework for Inequality-Constrained and Multi-Objective Binary Optimization: Quadratic Cost Functions and Empirical Evaluations

Sebastian Egginger, Kristina Kirova, Sonja Bruckner +2

The prospect of quantum solutions for complicated optimization problems is contingent on mapping the original problem onto a tractable quantum energy landscape, e.g. an Ising-type…

quant-ph2025

A Rigorous Quantum Framework for Inequality-Constrained and Multi-Objective Binary Optimization

Sebastian Egginger, Kristina Kirova, Sonja Bruckner +2

Encoding combinatorial optimization problems into physically meaningful Hamiltonians with tractable energy landscapes forms the foundation of quantum optimization. Numerous works h…

quant-ph2025

An infinite hierarchy of multi-copy quantum learning tasks

Jan Nöller, Viet T. Tran, Mariami Gachechiladze +1

Learning properties of quantum states from measurement data is a fundamental challenge in quantum information. The sample complexity of such tasks depends crucially on the measurem…

quant-ph2025

The Sound of Entanglement

Enar de Dios Rodríguez, Philipp Haslinger, Johannes Kofler +5

The advent of quantum physics has revolutionized our understanding of the universe, replacing the deterministic framework of classical physics with a paradigm dominated by intrinsi…

quant-ph2025

One, Two, Three: One empirical evaluation of a two-copy shadow tomography scheme with triple efficiency

Viet T. Tran, Richard Kueng

Shadow tomography protocols have recently emerged as powerful tools for efficient quantum state learning, aiming to reconstruct expectation values of observables with fewer resourc…

quant-ph2025

Fast quantum measurement tomography with optimal error bounds

Leonardo Zambrano, Sergi Ramos-Calderer, Richard Kueng

We present a two-step protocol for quantum measurement tomography that is light on classical co-processing cost and still achieves optimal sample complexity. Given measurement data…

quant-ph2025★ 2 cited

Quantum computing and artificial intelligence: status and perspectives

Giovanni Acampora, Andris Ambainis, Natalia Ares +36

This white paper discusses and explores the various points of intersection between quantum computing and artificial intelligence (AI). It describes how quantum computing could supp…

quant-ph2025★ 7 cited

In the shadow of the Hadamard test: Using the garbage state for good and further modifications

Paul K. Faehrmann, Jens Eisert, Richard Kueng

The Hadamard test is naturally suited for the intermediate regime between the current era of noisy quantum devices and complete fault tolerance. Its applications use measurements o…

quant-ph2025

Ability of entanglement and purity to help to detect systematic experimental errors

Julia Freund, Francesco Basso Basset, Tobias M. Krieger +12

Measurements are central in all quantitative sciences, and a fundamental challenge is to make observations without systematic measurement errors. This holds in particular for quant…

quant-ph2025

Solving quadratic binary optimization problems using quantum SDP methods: Non-asymptotic running time analysis

Fabian Henze, Viet Tran, Birte Ostermann +3

Quantum computers can solve semidefinite programs (SDPs) using resources that scale better than state-of-the-art classical methods as a function of the problem dimension. At the sa…

quant-ph2024★ 1 cited

Short-time simulation of quantum dynamics by Pauli measurements

Paul K. Faehrmann, Jens Eisert, Maria Kieferova +1

Simulating the dynamics of complex quantum systems is a central application of quantum devices. Here, we propose leveraging the power of measurements to simulate short-time quantum…

quant-ph2024★ 5 cited

Learning Properties of Quantum States Without the I.I.D. Assumption

Omar Fawzi, Richard Kueng, Damian Markham +1

We develop a framework for learning properties of quantum states beyond the assumption of independent and identically distributed (i.i.d.) input states. We prove that, given any le…

quant-ph2023★ 2 cited

Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers

Tom Peham, Nina Brandl, Richard Kueng +2

Circuit synthesis is the task of decomposing a given logical functionality into a sequence of elementary gates. It is (depth-)optimal if it is impossible to achieve the desired fun…

quant-ph2023★ 4 cited

On the average-case complexity of learning output distributions of quantum circuits

Alexander Nietner, Marios Ioannou, Ryan Sweke +4

In this work, we show that learning the output distributions of brickwork random quantum circuits is average-case hard in the statistical query model. This learning model is widely…

quant-ph2023★ 39 cited

Improved machine learning algorithm for predicting ground state properties

Laura Lewis, Hsin-Yuan Huang, Viet T. Tran +3

Finding the ground state of a quantum many-body system is a fundamental problem in quantum physics. In this work, we give a classical machine learning (ML) algorithm for predicting…

quant-ph2022★ 73 cited

Entanglement barrier and its symmetry resolution: theory and experiment

Aniket Rath, Vittorio Vitale, Sara Murciano +6

The operator entanglement (OE) is a key quantifier of the complexity of a reduced density matrix. In out-of-equilibrium situations, e.g. after a quantum quench of a product state,…

quant-ph2022★ 20 cited

Recursive greedy initialization of the quantum approximate optimization algorithm with guaranteed improvement

Stefan H. Sack, Raimel A. Medina, Richard Kueng +1

The quantum approximate optimization algorithm (QAOA) is a variational quantum algorithm, where a quantum computer implements a variational ansatz consisting of layers of alter…

quant-ph2022★ 2 cited

Quantum mean states are nicer than you think: fast algorithms to compute states maximizing average fidelity

A. Afham, Richard Kueng, Chris Ferrie

Fidelity is arguably the most popular figure of merit in quantum sciences. However, many of its properties are still unknown. In this work, we resolve the open problem of maximizin…