Related papers: The Measure-and-Reprogram Technique 2.0: Multi-Rou…
In continuous-variable quantum key distribution (CV-QKD), the performance of the information reconciliation (IR) step is critical for the achievable secret key rate (SKR) and transmission distance. We show how to improve on the recently…
The cryptographic task of secure multi-party (classical) computation has received a lot of attention in the last decades. Even in the extreme case where a computation is performed between $k$ mutually distrustful players, and security is…
In his seminal work on recording quantum queries [Crypto 2019], Zhandry studied interactions between quantum query algorithms and the quantum oracle corresponding to random functions. Zhandry presented a framework for interpreting various…
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…
Previously, Bennet and Feynman asked if Heisenberg's uncertainty principle puts a limitation on a quantum computer (Quantum Mechanical Computers, Richard P. Feynman, Foundations of Physics, Vol. 16, No. 6, p597-531, 1986). Feynman's answer…
Quantum token protocols enable unforgeable quantum tokens promising unconditional security beyond classical cryptographic assumptions. We show here that the three stages of the Quantum token protocols involving the preparation, storage and…
Selective transfer of information between spin-1/2 particles arranged in a ring is achieved by optimizing the transfer fidelity over a readout time window via shaping, externally applied, static bias fields. Such static control fields have…
Quantum labeling tasks ask one to recover the missing associations between classical outcome labels and the effects forming the POVM. We study labeling in the multiple-shot regime, allowing a finite number of uses of the device and the most…
Quantum error correction is of crucial importance for fault-tolerant quantum computers. As an essential step towards the implementation of quantum error-correcting codes, quantum non-demolition (QND) measurements are needed to efficiently…
Quantum key distribution (QKD) protocols with threshold detectors are driving high-performance QKD demonstrations. The corresponding security proofs usually assume that all physical detectors have the same detection efficiency. However, the…
Simulating fermionic systems on qubit hardware involves many nonlocal interactions, and efficient routing of these interactions is critical to the overall cost of fermionic simulation algorithms. Recent works reduce this Jordan-Wigner…
We introduce a simulation-free method to estimate the fidelity of large quantum circuits based on the order statistics of measured output probabilities from highly entangled, chaotic states. The approach requires only the…
Several quantum key distribution (QKD) protocols employ iterative sifting. After each quantum transmission round, Alice and Bob disclose part of their setting information (including their basis choices) for the detected signals. The quantum…
The implementation of error correction protocols is a central challenge in the development of practical quantum information technologies. Recently, multi-level quantum resources such as harmonic oscillators and qudits have attracted…
Recent results of Kaplan et al., building on previous work by Kuwakado and Morii, have shown that a wide variety of classically-secure symmetric-key cryptosystems can be completely broken by quantum chosen-plaintext attacks (qCPA). In such…
Although quantum random number generators rely on the inherent indeterminism of quantum mechanics, ensuring that the numbers produced are secure remains a significant challenge. We introduce two semi-device-independent randomness expansion…
We present a quantum algorithm that analyzes risk more efficiently than Monte Carlo simulations traditionally used on classical computers. We employ quantum amplitude estimation to evaluate risk measures such as Value at Risk and…
One of the simplest security proofs of quantum key distribution is based on the so-called complementarity scenario, which involves the complementarity control of an actual protocol and a virtual protocol [M. Koashi, e-print arXiv:0704.3661…
An efficient technique of computing on encrypted data allows a client with limited capability to perform complex operations on a remote fault-tolerant server without leaking anything about the input or output. Quantum computing provides…
A potential approach for demonstrating quantum advantage is using quantum computers to simulate fermionic systems. Quantum algorithms for fermionic system simulation usually involve the Hamiltonian evolution and measurements. However, in…