Related papers: Modifications of Quantum Computation and Adaptive …
Quantum computation offers a promising new kind of information processing, where the non-classical features of quantum mechanics can be harnessed and exploited. A number of models of quantum computation exist, including the now well-studied…
In the near future, there will likely be special-purpose quantum computers with 40-50 high-quality qubits. This paper lays general theoretical foundations for how to use such devices to demonstrate "quantum supremacy": that is, a clear…
The imminent era of error-corrected quantum computing urgently demands robust methods to characterize complex quantum states, even from limited and noisy measurements. We introduce the Quantum Attention Network (QuAN), a versatile classical…
This work is originally a Cambridge Part III essay paper. Quantum complexity arises as an alternative measure to the Fubini metric between two quantum states. Given two states and a set of allowed gates, it is defined as the least complex…
Deutsch proposed two sorts of models of quantum computers, quantum Turing machines (QTMs) and quantum circuit families (QCFs). In this paper we explore the computational powers of these models and re-examine the claim of the computational…
Benchmarking the performance of quantum error correction codes in physical systems is crucial for achieving fault-tolerant quantum computing. Current methodologies, such as (shadow) tomography or direct fidelity estimation, fall short in…
Interacting with a standard computer can enhance the capabilities of current quantum computers already today, particularly by offloading certain computations to the standard computer. Quantum computers that interact with standard computers…
Complexity theory typically focuses on the difficulty of solving computational problems using classical inputs and outputs, even with a quantum computer. In the quantum world, it is natural to apply a different notion of complexity, namely…
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside the entire polynomial hierarchy, by relating this question to…
With the recent advances in the development of devices capable of performing quantum computations, a growing interest in finding near-term applications has emerged in many areas of science. In the era of non-fault tolerant quantum devices,…
This paper presents an efficient parallel approximation scheme for a new class of min-max problems. The algorithm is derived from the matrix multiplicative weights update method and can be used to find near-optimal strategies for…
The mechanism by which an effective macroscopic description of quantum measurement in terms of discrete, probabilistic collapse events emerges from the reversible microscopic dynamics remains an enduring open question. Emerging quantum…
Quantum sample-to-query lifting, a relation between quantum sample complexity and quantum query complexity presented in Wang and Zhang (SIAM J. Comput. 2025), was significantly strengthened by Tang, Wright, and Zhandry (2025) to the case of…
This thesis studies three topics in quantum computation and information: The approximability of quantum problems, quantum proof systems, and non-classical correlations in quantum systems. In the first area, we demonstrate a polynomial-time…
This article provides a cartoon of the quantization of General Relativity using the ideas of effective field theory. These ideas underpin the use of General Relativity as a theory from which precise predictions are possible, since they show…
We show that the meromorphic Jacobi form that counts the quarter-BPS states in N=4 string theories can be canonically decomposed as a sum of a mock Jacobi form and an Appell-Lerch sum. The quantum degeneracies of single-centered black holes…
Recently\cite{BQG}, it was shown that quantum effects of matter could be identified with the conformal degree of freedom of the space-time metric. Accordingly, one can introduce quantum effects either by making a scale transformation (i.e.…
The Quantum Singular Value Transformation (QSVT) is a recent technique that gives a unified framework to describe most quantum algorithms discovered so far, and may lead to the development of novel quantum algorithms. In this paper we…
We consider quantum computations comprising only commuting gates, known as IQP computations, and provide compelling evidence that the task of sampling their output probability distributions is unlikely to be achievable by any efficient…
Multipartite quantum correlation (MQC) not only explains many novel microscopic and macroscopic quantum phenomena, but also holds promise for specific quantum technologies with superiorities. MQCs descriptions and measures have been an open…