Richard Kueng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Richard Kueng has a total of 67 co-authors. Here are the top co-authors by number of shared publications:
- Jens Eisert
Dahlem Center for Complex Quantum Systems, Freie Universität Berlin, Berlin, Germany
4 shared publications - Hsin-Yuan Huang
California Institute of Technology
3 shared publications - John Preskill
California Institute of Technology
3 shared publications - Maksym Serbyn
Institute of Science and Technology Austria, Am Campus 1, 3400 Klosterneuburg, Austria
3 shared publications - Paul K. Faehrmann
Freie Universität Berlin
3 shared publications - Raimel A. Medina
Institute of Science and Technology Austria, Am Campus 1, 3400 Klosterneuburg, Austria
3 shared publications
Latest Publications
- Open Access
- 17 February 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (2)
Ability of entanglement and purity to help to detect systematic experimental errors
Measurements are central in all quantitative sciences, and a fundamental challenge is to make observations without systematic measurement errors. This holds in particular for quantum information processing, where other error sources, such as noise and decoherence, are unavoidable. Consequently, methods for detecting systematic errors have been developed, but the required quantum state properties are yet unexplored. We theoretically develop a direct and efficient method to detect systematic errors in quantum experiments and demonstrate it experimentally using quantum state tomography of photon pairs emitted from a semiconductor quantum dot. Our method can be scaled to multiqubit systems, and we find that entanglement and quantum states with high purity can help identify systematic errors.
- 17 February 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (2)
Open AccessAbility of entanglement and purity to help to detect systematic experimental errors
Measurements are central in all quantitative sciences, and a fundamental challenge is to make observations without systematic measurement errors. This holds in particular for quantum information processing, where other error sources, such as noise and decoherence, are unavoidable. Consequently, methods for detecting systematic errors have been developed, but the required quantum state properties are yet unexplored. We theoretically develop a direct and efficient method to detect systematic errors in quantum experiments and demonstrate it experimentally using quantum state tomography of photon pairs emitted from a semiconductor quantum dot. Our method can be scaled to multiqubit systems, and we find that entanglement and quantum states with high purity can help identify systematic errors.
- Open Access
A Rigorous Quantum Framework for Inequality-Constrained and Multi-Objective Binary Optimization: Quadratic Cost Functions and Empirical Evaluations
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 Hamiltonian. Subsequently, techniques like adiabatic optimization, quantum annealing, and the Quantum Approximate Optimization Algorithm (QAOA) can be used to find the ground state of this Hamiltonian. Quadratic Unconstrained Binary Optimization (QUBO) is one prominent problem class for which this entire pipeline is well understood and has received considerable attention over the past years. In this work, we provide novel, tractable mappings for the maxima of multiple QUBO problems. Termed Multi-Objective Quantum Approximations, or MOQA for short, our framework allows us to recast new types of classical binary optimization problems as ground state problems of a tractable Ising-type Hamiltonian. This, in turn, opens the possibility of new quantum- and quantum-inspired solutions to a variety of problems that frequently occur in practical applications. In particular, MOQA can handle various types of routing and partitioning problems, as well as inequality-constrained binary optimization problems.
Open AccessA Rigorous Quantum Framework for Inequality-Constrained and Multi-Objective Binary Optimization: Quadratic Cost Functions and Empirical Evaluations
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 Hamiltonian. Subsequently, techniques like adiabatic optimization, quantum annealing, and the Quantum Approximate Optimization Algorithm (QAOA) can be used to find the ground state of this Hamiltonian. Quadratic Unconstrained Binary Optimization (QUBO) is one prominent problem class for which this entire pipeline is well understood and has received considerable attention over the past years. In this work, we provide novel, tractable mappings for the maxima of multiple QUBO problems. Termed Multi-Objective Quantum Approximations, or MOQA for short, our framework allows us to recast new types of classical binary optimization problems as ground state problems of a tractable Ising-type Hamiltonian. This, in turn, opens the possibility of new quantum- and quantum-inspired solutions to a variety of problems that frequently occur in practical applications. In particular, MOQA can handle various types of routing and partitioning problems, as well as inequality-constrained binary optimization problems.
- Open Access
- 9 October 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (15) , 150603
In the Shadow of the Hadamard Test: Using the Garbage State for Good and Further Modifications
The Hadamard test is one of the pillars on which quantum algorithm development rests and, at the same time, is naturally suited for the intermediate regime between the current era of noisy quantum devices and complete fault tolerance. Its applications use measurements of the auxiliary qubit to extract information but disregard the system register completely. Concomitantly, but independently of this development, advances in quantum learning theory have enabled the efficient representation of quantum states via classical shadows. This Letter shows that, strikingly, putting both lines of thought into a new context results in substantial improvements to the Hadamard test on a single auxiliary readout qubit, by suitably exploiting classical shadows on the remaining n -qubit work register. We argue that this combination inherits the best of both worlds and discuss statistical phase estimation as a vignette application. At the same time, the framework is more general and applicable to a wide range of other algorithms. There, we can use the Hadamard test to estimate energies on the auxiliary qubit, while classical shadows on the system register provide access to additional features such as (i) the fidelity of the initial state with certain pure quantum states, (ii) the initial state’s energy, and (iii) how pure and how close the initial state is to an eigenstate of the Hamiltonian. Finally, we also discuss how anticontrolled unitaries can further augment this framework and explain how this Letter settles the exploitation of the Hadamard test for intermediate applications.
- 9 October 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (15) , 150603
Open AccessIn the Shadow of the Hadamard Test: Using the Garbage State for Good and Further Modifications
The Hadamard test is one of the pillars on which quantum algorithm development rests and, at the same time, is naturally suited for the intermediate regime between the current era of noisy quantum devices and complete fault tolerance. Its applications use measurements of the auxiliary qubit to extract information but disregard the system register completely. Concomitantly, but independently of this development, advances in quantum learning theory have enabled the efficient representation of quantum states via classical shadows. This Letter shows that, strikingly, putting both lines of thought into a new context results in substantial improvements to the Hadamard test on a single auxiliary readout qubit, by suitably exploiting classical shadows on the remaining n -qubit work register. We argue that this combination inherits the best of both worlds and discuss statistical phase estimation as a vignette application. At the same time, the framework is more general and applicable to a wide range of other algorithms. There, we can use the Hadamard test to estimate energies on the auxiliary qubit, while classical shadows on the system register provide access to additional features such as (i) the fidelity of the initial state with certain pure quantum states, (ii) the initial state’s energy, and (iii) how pure and how close the initial state is to an eigenstate of the Hamiltonian. Finally, we also discuss how anticontrolled unitaries can further augment this framework and explain how this Letter settles the exploitation of the Hadamard test for intermediate applications.
- Open Access
One, Two, Three: One empirical evaluation of a two-copy shadow tomography scheme with triple efficiency
Shadow tomography protocols have recently emerged as powerful tools for efficient quantum state learning, aiming to reconstruct expectation values of observables with fewer resources than traditional quantum state tomography. For the particular case of estimating Pauli observables, entangling two-copy measurement schemes can offer an exponential improvement in sample complexity over any single-copy strategy conceivable [1, Huang, Kueng, Preskill, PRL(2021)]. A recent refinement of these ideas by King et al. [2, King, Gosset, Kothari, Babbush, SODA (2025)] does not only achieve polynomial sample complexity, but also maintains reasonable computational demands and utilizes joint measurements on only a small constant number of state copies. This `triple efficiency' is achievable for any subset of $n$-qubit Pauli observables, whereas single-copy strategies can only be efficient if the Pauli observables have advantageous structure. In this work, we complement existing theoretical performance guarantees with the empirical evaluation of triply efficient shadow tomography using classical, noise-free simulations. Our findings indicate that the empirical sample complexity aligns closely with theoretical predictions for stabilizer states and, notably, demonstrates slightly improved scaling for random Gibbs states compared to established theoretical bounds. In addition, we improve a central subroutine in the triply-efficient shadow protocol by leveraging insights from a refined quantum and quantum-inspired convex optimization algorithm [3, Henze et al. arXiv:2502.15426 (2025)]. To summarize, our empirical sample complexity studies of triply efficient shadow tomography not only confirm existing theoretical scaling behavior, but also showcase that the actual constants involved are comparatively benign. Hence, this protocol has the potential to also be very sample-efficient in practice.
Open AccessOne, Two, Three: One empirical evaluation of a two-copy shadow tomography scheme with triple efficiency
Shadow tomography protocols have recently emerged as powerful tools for efficient quantum state learning, aiming to reconstruct expectation values of observables with fewer resources than traditional quantum state tomography. For the particular case of estimating Pauli observables, entangling two-copy measurement schemes can offer an exponential improvement in sample complexity over any single-copy strategy conceivable [1, Huang, Kueng, Preskill, PRL(2021)]. A recent refinement of these ideas by King et al. [2, King, Gosset, Kothari, Babbush, SODA (2025)] does not only achieve polynomial sample complexity, but also maintains reasonable computational demands and utilizes joint measurements on only a small constant number of state copies. This `triple efficiency' is achievable for any subset of $n$-qubit Pauli observables, whereas single-copy strategies can only be efficient if the Pauli observables have advantageous structure. In this work, we complement existing theoretical performance guarantees with the empirical evaluation of triply efficient shadow tomography using classical, noise-free simulations. Our findings indicate that the empirical sample complexity aligns closely with theoretical predictions for stabilizer states and, notably, demonstrates slightly improved scaling for random Gibbs states compared to established theoretical bounds. In addition, we improve a central subroutine in the triply-efficient shadow protocol by leveraging insights from a refined quantum and quantum-inspired convex optimization algorithm [3, Henze et al. arXiv:2502.15426 (2025)]. To summarize, our empirical sample complexity studies of triply efficient shadow tomography not only confirm existing theoretical scaling behavior, but also showcase that the actual constants involved are comparatively benign. Hence, this protocol has the potential to also be very sample-efficient in practice.
- Open Access
- 1 July 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (1)
Short-time simulation of quantum dynamics by Pauli measurements
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 dynamics of physically prepared quantum states in classical postprocessing using a truncated Taylor series approach. While limited to short simulation times, our hybrid quantum-classical method is equipped with rigorous error bounds. It is extendable to estimate low-order Taylor approximations of smooth time-dependent functions of tractable linear combinations of measurable operators. These insights can be made use of in the context of Hamiltonian learning and device verification, short-time imaginary-time evolution, or the application of intractable operations to subuniversal quantum simulators in classical postprocessing.
- 1 July 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (1)
Open AccessShort-time simulation of quantum dynamics by Pauli measurements
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 dynamics of physically prepared quantum states in classical postprocessing using a truncated Taylor series approach. While limited to short simulation times, our hybrid quantum-classical method is equipped with rigorous error bounds. It is extendable to estimate low-order Taylor approximations of smooth time-dependent functions of tractable linear combinations of measurable operators. These insights can be made use of in the context of Hamiltonian learning and device verification, short-time imaginary-time evolution, or the application of intractable operations to subuniversal quantum simulators in classical postprocessing.
- Open Access
In the shadow of the Hadamard test: Using the garbage state for good and further modifications
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 of the auxiliary qubit to extract information, but disregard the system register completely. Separate advances in classical representations of quantum states via classical shadows allow the implementation of even global classical shadows with shallow circuits. This work combines the Hadamard test on a single auxiliary readout qubit with classical shadows on the remaining $n$-qubit work register. We argue that this combination inherits the best of both worlds and discuss statistical phase estimation as a vignette application. There, we can use the Hadamard test to estimate eigenvalues on the auxiliary qubit, while classical shadows on the remaining $n$ qubits provide access to additional features such as, (i) fidelity with certain pure quantum states, (ii) the initial state's energy and (iii) how pure and how close the initial state is to an eigenstate of the Hamiltonian. Finally, we also discuss how anti-controlled unitaries can further augment this framework.Open AccessIn the shadow of the Hadamard test: Using the garbage state for good and further modifications
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 of the auxiliary qubit to extract information, but disregard the system register completely. Separate advances in classical representations of quantum states via classical shadows allow the implementation of even global classical shadows with shallow circuits. This work combines the Hadamard test on a single auxiliary readout qubit with classical shadows on the remaining $n$-qubit work register. We argue that this combination inherits the best of both worlds and discuss statistical phase estimation as a vignette application. There, we can use the Hadamard test to estimate eigenvalues on the auxiliary qubit, while classical shadows on the remaining $n$ qubits provide access to additional features such as, (i) fidelity with certain pure quantum states, (ii) the initial state's energy and (iii) how pure and how close the initial state is to an eigenstate of the Hamiltonian. Finally, we also discuss how anti-controlled unitaries can further augment this framework. - Open Access
Recursive greedy initialization of the quantum approximate optimization algorithm with guaranteed improvement
The quantum approximate optimization algorithm (QAOA) is a variational quantum algorithm, where a quantum computer implements a variational ansatz consisting of $p$ layers of alternating unitary operators and a classical computer is used to optimize the variational parameters. For a random initialization, the optimization typically leads to local minima with poor performance, motivating the search for initialization strategies of QAOA variational parameters. Although numerous heuristic initializations exist, an analytical understanding and performance guarantees for large $p$ remain evasive. We introduce a greedy initialization of QAOA which guarantees improving performance with an increasing number of layers. Our main result is an analytic construction of $2p+1$ transition states - saddle points with a unique negative curvature direction - for QAOA with $p+1$ layers that use the local minimum of QAOA with $p$ layers. Transition states connect to new local minima, which are guaranteed to lower the energy compared to the minimum found for $p$ layers. We use the GREEDY procedure to navigate the exponentially increasing with $p$ number of local minima resulting from the recursive application of our analytic construction. The performance of the GREEDY procedure matches available initialization strategies while providing a guarantee for the minimal energy to decrease with an increasing number of layers $p$.Open AccessRecursive greedy initialization of the quantum approximate optimization algorithm with guaranteed improvement
The quantum approximate optimization algorithm (QAOA) is a variational quantum algorithm, where a quantum computer implements a variational ansatz consisting of $p$ layers of alternating unitary operators and a classical computer is used to optimize the variational parameters. For a random initialization, the optimization typically leads to local minima with poor performance, motivating the search for initialization strategies of QAOA variational parameters. Although numerous heuristic initializations exist, an analytical understanding and performance guarantees for large $p$ remain evasive. We introduce a greedy initialization of QAOA which guarantees improving performance with an increasing number of layers. Our main result is an analytic construction of $2p+1$ transition states - saddle points with a unique negative curvature direction - for QAOA with $p+1$ layers that use the local minimum of QAOA with $p$ layers. Transition states connect to new local minima, which are guaranteed to lower the energy compared to the minimum found for $p$ layers. We use the GREEDY procedure to navigate the exponentially increasing with $p$ number of local minima resulting from the recursive application of our analytic construction. The performance of the GREEDY procedure matches available initialization strategies while providing a guarantee for the minimal energy to decrease with an increasing number of layers $p$. - Open Access
Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers
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 functionality with even shorter circuits. Optimal synthesis is a central problem in both quantum and classical hardware design, but also plagued by complexity-theoretic obstacles. Motivated by fault-tolerant quantum computation, we consider the special case of synthesizing blocks of Clifford unitaries. Leveraging entangling input stimuli and the stabilizer formalism allows us to reduce the Clifford synthesis problem to a family of poly-size satisfiability (SAT) problems -- one for each target circuit depth. On a conceptual level, our result showcases that the Clifford synthesis problem is contained in the first level of the polynomial hierarchy ($\mathsf{NP}$), while the classical synthesis problem for logical circuits is known to be complete for the second level of the polynomial hierarchy ($Σ_2^{\mathsf{P}}$). Based on this theoretical reduction, we formulate a SAT encoding for depth-optimal Clifford synthesis. We then employ SAT solvers to determine a satisfying assignment or to prove that no such assignment exists. From that, the shortest depth for which synthesis is still possible (optimality) as well as the actual circuit (synthesis) can be obtained. Empirical evaluations show that the optimal synthesis approach yields a substantial depth improvement for random Clifford circuits and Clifford+T circuits for Grover search.
Open AccessDepth-Optimal Synthesis of Clifford Circuits with SAT Solvers
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 functionality with even shorter circuits. Optimal synthesis is a central problem in both quantum and classical hardware design, but also plagued by complexity-theoretic obstacles. Motivated by fault-tolerant quantum computation, we consider the special case of synthesizing blocks of Clifford unitaries. Leveraging entangling input stimuli and the stabilizer formalism allows us to reduce the Clifford synthesis problem to a family of poly-size satisfiability (SAT) problems -- one for each target circuit depth. On a conceptual level, our result showcases that the Clifford synthesis problem is contained in the first level of the polynomial hierarchy ($\mathsf{NP}$), while the classical synthesis problem for logical circuits is known to be complete for the second level of the polynomial hierarchy ($Σ_2^{\mathsf{P}}$). Based on this theoretical reduction, we formulate a SAT encoding for depth-optimal Clifford synthesis. We then employ SAT solvers to determine a satisfying assignment or to prove that no such assignment exists. From that, the shortest depth for which synthesis is still possible (optimality) as well as the actual circuit (synthesis) can be obtained. Empirical evaluations show that the optimal synthesis approach yields a substantial depth improvement for random Clifford circuits and Clifford+T circuits for Grover search.
- Open Access
- 2 June 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 107 (6) , 062404
Recursive greedy initialization of the quantum approximate optimization algorithm with guaranteed improvement
The quantum approximate optimization algorithm (QAOA) is a variational quantum algorithm, where a quantum computer implements a variational ansatz consisting of layers of alternating unitary operators and a classical computer is used to optimize the variational parameters. For a random initialization, the optimization typically leads to local minima with poor performance, motivating the search for initialization strategies of QAOA variational parameters. Although numerous heuristic initializations exist, an analytical understanding and performance guarantees for large remain evasive. We introduce a greedy initialization of QAOA which guarantees improving performance with an increasing number of layers. Our main result is an analytic construction of transition states—saddle points with a unique negative curvature direction—for QAOA with layers that use the local minimum of QAOA with layers. Transition states connect to new local minima, which are guaranteed to lower the energy compared to the minimum found for layers. We use the Greedy procedure to navigate the exponentially increasing with number of local minima resulting from the recursive application of our analytic construction. The performance of the Greedy procedure matches available initialization strategies while providing a guarantee for the minimal energy to decrease with an increasing number of layers .- 2 June 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 107 (6) , 062404
Open AccessRecursive greedy initialization of the quantum approximate optimization algorithm with guaranteed improvement
The quantum approximate optimization algorithm (QAOA) is a variational quantum algorithm, where a quantum computer implements a variational ansatz consisting of layers of alternating unitary operators and a classical computer is used to optimize the variational parameters. For a random initialization, the optimization typically leads to local minima with poor performance, motivating the search for initialization strategies of QAOA variational parameters. Although numerous heuristic initializations exist, an analytical understanding and performance guarantees for large remain evasive. We introduce a greedy initialization of QAOA which guarantees improving performance with an increasing number of layers. Our main result is an analytic construction of transition states—saddle points with a unique negative curvature direction—for QAOA with layers that use the local minimum of QAOA with layers. Transition states connect to new local minima, which are guaranteed to lower the energy compared to the minimum found for layers. We use the Greedy procedure to navigate the exponentially increasing with number of local minima resulting from the recursive application of our analytic construction. The performance of the Greedy procedure matches available initialization strategies while providing a guarantee for the minimal energy to decrease with an increasing number of layers . - Top Cited Papers
- 2 December 2022
- Published by Springer Nature in Nature Reviews Physics
- Vol. 5 (1) , 9-24
The randomized measurement toolbox
- 2 December 2022
- Published by Springer Nature in Nature Reviews Physics
- Vol. 5 (1) , 9-24
Top Cited PapersThe randomized measurement toolbox