Related papers: Optimal counterfeiting attacks and generalizations…
In this paper, we will present an algorithm to resolve the counterfeit coins problem in the case that the number of false coins is unknown in advance.
We consider the quantum memory assisted quantum state verification task, where an adversary prepare independent multipartite entangled states and send to the local verifiers, who then store several copies in the quantum memory and measure…
Efficient verification of multipartite quantum states is crucial to many applications in quantum information processing. By virtue of Schmidt decomposition and mutually unbiased bases, here we propose a universal protocol to verify…
We investigate the probabilistic cloning and purification of quantum states. The performance of these probabilistic operations is quantified by the average fidelity between the ideal and actual output states. We provide a simple formula for…
It had been widely claimed that quantum mechanics can protect private information during public decision in for example the so-called two-party secure computation. If this were the case, quantum smart-cards could prevent fake teller…
Optimal quantum cloning is the process of making one or more copies of an arbitrary unknown input quantum state with the highest possible fidelity. All reported demonstrations of quantum cloning have so far been limited to copying…
All known qudit-based prepare-and-measure quantum key distribution (PM-QKD) schemes are more error resilient than their qubit-based counterparts. Their high error resiliency comes partly from the careful encoding of multiple bits of signals…
The cloning of quantum variables with continuous spectra is investigated. We define a Gaussian 1-to-2 cloning machine, which copies equally well two conjugate variables such as position and momentum or the two quadrature components of a…
Quantization of a random-walk model is performed by giving a qudit (a multi-component wave function) to a walker at site and by introducing a quantum coin, which is a matrix representation of a unitary transformation. In quantum walks, the…
We demonstrate the implementation of quantum cheque, proposed by Roy Moulick and Panigrahi [Quantum Inf. Process (2016) 15: 2475], using the five-qubit IBM quantum computer. Appropriate single qubit, CNOT and Fredkin gates have been…
We employ quantum state discrimination theory to establish the ultimate limit for spoofing detection in electromagnetic signals encoded with random quantum states. Our analysis yields an analytical expression for the optimal bound, which we…
We propose a new idea for public key quantum money. In the abstract sense, our bills are encoded as a joint eigenstate of a fixed system of commuting unitary operators. We perform some basic analysis of this black box system and show that…
Coin flipping is a cryptographic primitive in which two distrustful parties wish to generate a random bit in order to choose between two alternatives. This task is impossible to realize when it relies solely on the asynchronous exchange of…
Dense coding with non-maximally entangled states has been investigated in many different scenarios. We revisit this problem for protocols adopting the standard encoding scheme. In this case, the set of possible classical messages cannot be…
Oblivious transfer is an important primitive in modern cryptography. Applications include secure multiparty computation, oblivious sampling, e-voting, and signatures. Information-theoretically secure perfect 1-out-of 2 oblivious transfer is…
In this paper we give the first proof that, under reasonable assumptions, a problem related to counterfeiting quantum money from knots [Farhi et al. 2010] is hard. Along the way, we introduce the concept of a component mixer, define three…
In coin tossing two remote participants want to share a uniformly distributed random bit. At the least in the quantum version, each participant test whether or not the other has attempted to create a bias on this bit. It is requested that,…
This note presents a method of public key distribution using quantum communication of n photons that simultaneously provides a high probability that the bits have not been tampered. It is a three-state variant of the quantum method of…
A family of protocols for quantum weak coin-flipping which asymptotically achieve a bias of 0.192 is described in this paper. The family contains protocols with n+2 messages for all n>1. The case n=2 is equivalent to the protocol of…
We show that a simple eavesdropper listening in on classical communication between potentially entangled quantum parties will eventually be able to impersonate any of the parties. Furthermore, the attack is efficient if one-way puzzles do…