Related papers: Hidden Quantum Advantage near the Decoding Thresho…
We improve on the results of [A. Jackson et al. Proc. Natl. Acad. Sci. U.S.A 121 (6). 2024] on the verification of analogue quantum simulators by eliminating the use of universal Hamiltonians, removing the need for two-qubit gates, and no…
The quest to identify quantum advantages lies at the heart of quantum technology. While quantum devices promise extraordinary capabilities, from exponential computational speedups to unprecedented measurement precision, distinguishing…
Sequential methods for quantum hypothesis testing offer significant advantages over fixed-length approaches, which rely on a predefined number of state copies. Despite their potential, these methods remain underexplored for unambiguous…
We systematically study the fundamental competition between quantum error correction (QEC) and continuous symmetries, two key notions in quantum information and physics, in a quantitative manner. Three meaningful measures of approximate…
It is shown that a generalization of the fluctuation-dissipation theorem places an upper bound on the figure of merit for any quantum gate designed to entangle spatially-separated qubits. The bound depends solely on the spectral properties…
Quantum nondeterministic distributed computing was recently introduced as dQMA (distributed quantum Merlin-Arthur) protocols by Fraigniaud, Le Gall, Nishimura and Paz (ITCS 2021). In dQMA protocols, with the help of quantum proofs and local…
Quantum key distribution (QKD) is a method that distributes a secret key to a sender and a receiver by the transmission of quantum particles (e.g. photons). Device-independent quantum key distribution (DIQKD) is a version of QKD with a…
Standard protocols for quantum key distribution (QKD) require that the sender be able to transmit in two or more mutually unbiased bases. Here, we analyze the extent to which the performance of QKD is degraded by diffraction effects that…
A quantum code is a subspace of a Hilbert space of a physical system chosen to be correctable against a given class of errors, where information can be encoded. Ideally, the quantum code lies within the ground space of the physical system.…
A robust definition of quantum runtime is essential for assessing the performance of quantum algorithms and claims of quantum advantage. While for most classical hardware the total runtime is well approximated by computation plus a weakly…
The Heisenberg limit provides a quadratic improvement over the standard quantum limit, and is the maximum quantum advantage that quantum sensors could provide over classical methods. This limit remains elusive, however, because of the…
The widespread use of machine learning has raised the question of quantum supremacy for supervised learning as compared to quantum computational advantage. In fact, a recent work shows that computational and learning advantage are, in…
We solve for quantum Riemannian geometries on the finite lattice interval $\bullet-\bullet-\cdots-\bullet$ with $n$ nodes (the Dynkin graph of type $A_n$) and find that they are necessarily $q$-deformed with $q=e^{\imath\pi\over n+1}$. This…
Quantum error mitigation (QEM) is a promising technique of protecting hybrid quantum-classical computation from decoherence, but it suffers from sampling overhead which erodes the computational speed. In this treatise, we provide a…
Quantum error correction plays an important role in fault-tolerant quantum information processing. It is usually difficult to experimentally realize quantum error correction, as it requires multiple qubits and quantum gates with high…
Quantum error-correcting codes protect fragile quantum information by encoding it redundantly, but identifying codes that perform well in practice with minimal overhead remains difficult due to the combinatorial search space and the high…
Quantum advantage, broadly understood as the ability of quantum systems to significantly outperform their classical counterparts, underpins current interest to quantum technologies and is a topic of active investigation. In many situations,…
We study analytically and numerically decoding properties of finite rate hypergraph-product quantum LDPC codes obtained from random (3,4)-regular Gallager codes, with a simple model of independent X and Z errors. Several non-trival lower…
We analyze utility of communication channels in absence of any short of quantum or classical correlation shared between the sender and the receiver. To this aim, we propose a class of two-party communication games, and show that the games…
Quantum error correction offers a promising path for performing quantum computations with low errors. Although a fully fault-tolerant execution of a quantum algorithm remains unrealized, recent experimental developments, along with…