Related papers: A New Approach to Post-Quantum Non-Malleability
Mahadev [SIAM J. Comput. 2022] introduced the first protocol for classical verification of quantum computation based on the Learning-with-Errors (LWE) assumption, achieving a 4-message interactive scheme. This breakthrough naturally raised…
Secure multi-party computing, also called "secure function evaluation", has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are…
Quantum mechanics in its presently known formulation requires an external classical time for its description. A classical spacetime manifold and a classical spacetime metric are produced by classical matter fields. In the absence of such…
If mutually mistrustful parties A and B control two or more appropriately located sites, special relativity can be used to guarantee that a pair of messages exchanged by A and B are independent. In earlier work, we used this fact to define…
Classical matching theory can be defined in terms of matrices with nonnegative entries. The notion of Positive operator, central in Quantum Theory, is a natural generalization of matrices with nonnegative entries. Based on this point of…
Recently, Choi \emph{et al}. proposed an assumption on Mayers-Lo-Chau (MLC) no-go theorem that the state of the entire quantum system is invariable to both participants before the unveiling phase. This means that the theorem is only…
We develop a unified approach to classical, quantum and post-quantum steering. The framework is based on uncharacterised (black-box) parties performing quantum measurements on their share of a (possibly unphysical) quantum state, and its…
This paper presents an alternative approach to quantum entanglement, one that effectively resolves the logical inconsistencies without leading to logical contradictions. By addressing some of the inconsistencies within quantum mechanics,…
The advent of quantum computing threatens classical public-key cryptography, motivating NIST's adoption of post-quantum schemes such as those based on the Module Learning With Errors (Module-LWE) problem. We present NoMod ML-Attack, a…
Standard quantum mechanics predicts the non-conservation of state norms and probability when the fundamental requirement of the Hermiticity of the Hamiltonian is relaxed. Biorthogonal quantum mechanics, or the more general metric formalism,…
We investigate the amount of noise required to turn a universal quantum gate set into one that can be efficiently modelled classically. This question is useful for providing upper bounds on fault tolerant thresholds, and for understanding…
We establish an operational connection between discrete rounds of generalized measurements and continuous-time decoherence, with an explicit correspondence between the number of measurement rounds and the evolution time. Operationally, we…
Quantum cryptography has been extensively studied in the last twenty years, but information-flow security of quantum computing and communication systems has been almost untouched in the previous research. Duo to the essential difference…
We propose a general security definition for cryptographic quantum protocols that implement classical non-reactive two-party tasks. The definition is expressed in terms of simple quantum-information-theoretic conditions which must be…
Recent oracle separations [Kretschmer, TQC'21, Kretschmer et. al., STOC'23] have raised the tantalizing possibility of building quantum cryptography from sources of hardness that persist even if the polynomial hierarchy collapses. We…
The hopes for scalable quantum computing rely on the "threshold theorem": once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based…
We introduce a general method for the construction of quasiprobability representations for arbitrary notions of quantum coherence. Our technique yields a nonnegative probability distribution for the decomposition of any classical state.…
Quantum bit-string commitment[A.Kent, Phys.Rev.Lett., 90, 237901 (2003)] or QBSC is a variant of bit commitment (BC). In this paper, we propose a new QBSC protocol that can be implemented using currently available technology, and prove its…
We provide a powerful machinery to prove fully smooth one shot multipartite covering, aka convex split, type results for quantum states. In the important case of smooth multipartite convex split for classical quantum states, aka smooth…
Von Neumann's classic "multiplexing" method is unique in achieving high-threshold fault-tolerant classical computation (FTCC), but has several significant barriers to implementation: i) the extremely complex circuits required by randomized…