English
Related papers

Related papers: A simpler proof of existence of quantum weak coin …

200 papers

Oblivious transfer is a fundamental cryptographic primitive which is useful for secure multiparty computation. There are several variants of oblivious transfer. We consider 1 out of 2 oblivious transfer, where a sender sends two bits of…

Quantum Physics · Physics 2025-11-12 David Reichmuth , Ittoop Vergheese Puthoor , Petros Wallden , Erika Andersson

Secure function evaluation is a two-party cryptographic primitive where Bob computes a function of Alice's and his respective inputs, and both hope to keep their inputs private from the other party. It has been proven that perfect (or near…

Quantum Physics · Physics 2022-03-17 Sarah Osborn , Jamie Sikora

In this paper, a quantum version of classical alternating bit protocol is proposed. This protocol provides a reliable method to transmit the secret quantum data via a noisy quantum channel while the entanglement between particles is not…

Cryptography and Security · Computer Science 2016-06-02 Hadi Farahani

This paper addresses the controversy between Mayers, Lo and Chau on one side, and Yuen on the opposite side, on whether there exist or not unconditionally secure protocols. For such purpose, a complete classification of all possible bit…

Quantum Physics · Physics 2007-05-23 Giacomo Mauro D'Ariano

This thesis initiates the study of cryptographic protocols in the bounded-quantum-storage model. On the practical side, simple protocols for Rabin Oblivious Transfer, 1-2 Oblivious Transfer and Bit Commitment are presented. No quantum…

Quantum Physics · Physics 2007-09-04 Christian Schaffner

In recent years, several hacking attacks have broken the security of quantum cryptography implementations by exploiting the presence of losses and the ability of the eavesdropper to tune detection efficiencies. We present a simple attack of…

Quantum Physics · Physics 2016-01-28 Antonio Acín , Daniel Cavalcanti , Elsa Passaro , Stefano Pironio , Paul Skrzypczyk

We present a family of quantum money schemes with classical verification which display a number of benefits over previous proposals. Our schemes are based on hidden matching quantum retrieval games and they tolerate noise up to 23%, which…

Quantum Physics · Physics 2017-07-05 Ryan Amiri , Juan Miguel Arrazola

The purpose of this paper is the formal verification of a counterexample of Santos et al. to the so-called Hirsch Conjecture on the diameter of polytopes (bounded convex polyhedra). In contrast with the pen-and-paper proof, our approach is…

Logic in Computer Science · Computer Science 2023-01-11 Xavier Allamigeon , Quentin Canu , Pierre-Yves Strub

A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al.,…

We show that there exists an oracle relative to which quantum commitments exist but no (efficiently verifiable) one-way state generators exist. Both have been widely considered candidates for replacing one-way functions as the minimal…

Quantum Physics · Physics 2025-04-14 John Bostanci , Boyang Chen , Barak Nehoran

It is well known that conductivity of disordered metals is suppressed in the limit of low frequencies and temperatures by quantum corrections. Although predicted by theory to exist up to much higher energies, such corrections have so far…

Mesoscale and Nanoscale Physics · Physics 2019-12-18 P. Neilinger , J. Greguš , D. Manca , B. Grančič , M. Kopčík , P. Szabó , P. Samuely , R. Hlubina , M. Grajcar

Quantum mechanical weak values of projection operators have been used to answer which-way questions, e.g. to trace which arms in a multiple Mach-Zehnder setup a particle may have traversed from a given initial to a prescribed final state. I…

Quantum Physics · Physics 2017-03-08 B. E. Y. Svensson

Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client's input, output and computation remain private. A desirable property for any BQC protocol is verification, whereby…

Quantum Physics · Physics 2017-07-12 Joseph F. Fitzsimons , Elham Kashefi

Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…

Quantum Physics · Physics 2016-04-20 Bobby Antonio

Alice seeks an information-theoretically secure source of private random data. Unfortunately, she lacks a personal source and must use remote sources controlled by other parties. Alice wants to simulate a coin flip of specified bias…

Computational Complexity · Computer Science 2015-03-13 Gene S. Kopp , John D. Wiltshire-Gordon

The no-cloning theorem can be used as a basis for quantum money constructions which guarantee unconditionally unforgeable currency. Existing schemes, however, either (i) require long-term quantum memory and quantum communication between the…

Quantum Physics · Physics 2025-10-22 Dmytro Gavinsky , Dar Gilboa , Siddhartha Jain , Dmitri Maslov , Jarrod R. McClean

We study the minimal input sets which can determine completely the universal and the phase-covariant quantum cloning machines. We find that the universal quantum cloning machine, which can copy arbitrary input qubit equally well, however…

Quantum Physics · Physics 2013-01-01 Li Jing , Yi-Nan Wang , Han-Duo Shi , Liang-Zhu Mu , Heng Fan

In [1] the authors claim that "weak values are not inherently quantum but rather a purely statistical feature". I argue that their model reproduces only few elements of weak measurements but fails to reproduce all the other intrinsically…

Quantum Physics · Physics 2014-10-01 Eliahu Cohen

In this paper, we investigate the motion of spinning particles around a covariant quantum-corrected black hole without a Cauchy horizon within the framework of effective quantum gravity, and examine the influence of quantum gravitational…

General Relativity and Quantum Cosmology · Physics 2025-09-10 Jiawei Chen , Jinsong Yang

We give a new theoretical solution to a leading-edge experimental challenge, namely to the verification of quantum computations in the regime of high computational complexity. Our results are given in the language of quantum interactive…

Quantum Physics · Physics 2018-06-25 Anne Broadbent
‹ Prev 1 8 9 10 Next ›