Related papers: (4,1)-Quantum Random Access Coding Does Not Exist
It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether a given quantum…
Quantum key distribution, first proposed by Bennett and Brassard, provides a possible key distribution scheme whose security depends only on the quantum laws of physics. So far the protocol has been proved secure even under channel noise…
Quantum random number generators (QRNGs) promise perfectly unpredictable random numbers. However, the security certification of the random numbers in form of a stochastic model often introduces assumptions that are either hardly justified…
A new scheme of quantum coding is presented. The scheme concerns the quantum states to which Schumacher's compression does not apply. It is shown that two qubits can be encoded in a single qutrit in such a way that one can faithfully…
When the environmental disturbace to a quantum system has a wavelength much larger than the system size, all qubits localized within a small area are under action of the same error operators. Noiseless subsystem and decoherence free…
Quantum random number generators (QRNGs) produce random numbers based on the intrinsic probabilistic nature of quantum mechanics, making them true random number generators (TRNGs). In this paper, we design and fabricate an embedded QRNG…
Quantum cryptography is the study of delivering secret communications across a quantum channel. Recently, Quantum Key Distribution (QKD) has been recognized as the most important breakthrough in quantum cryptography. This process…
This study proposes a quantum secret authentication code for protecting the integrity of secret quantum states. Since BB84[1] was first proposed, the eavesdropper detection strategy in almost all quantum cryptographic protocols is based on…
The exact cover problem is an NP-complete problem with broad applications. Studies show that although applying the Quantum Approximate Optimization Algorithm (QAOA) to this problem can yield improved solution quality with deeper circuit…
We present the first quantum anonymous notification (QAN) protocol that introduces anonymity and paves the way for anonymous secure quantum communication in quantum networks. QAN protocol has applications ranging from multiparty quantum…
Emerging communication and cryptography applications call for reliable, fast, unpredictable random number generators. Quantum random number generation (QRNG) allows for the creation of truly unpredictable numbers thanks to the inherent…
We introduce an approach to quantum information processing where the information is stored in the motional degrees of freedom of nanomechanical devices. The qubits of our approach are formed by the two lowest energy levels of mechanical…
We present a high-quality, bias-free quantum random number generator (QRNG) using photon arrival time selectively in accordance with the number of photon detection events within a sampling time interval in attenuated light. It is well…
We analyze various prominent quantum repeater protocols in the context of long-distance quantum key distribution. These protocols are the original quantum repeater proposal by Briegel, D\"ur, Cirac and Zoller, the so-called hybrid quantum…
Based on principle of quantum mechanics, quantum cryptography provides an intriguing way to establish secret keys between remote parties, generally relying on actual transmission of signal particles. Surprisingly, an even more striking…
In this paper, we proposed an experimental implementation of quantum random number generator(QRNG) with inherent randomness of quantum tunneling effect of electrons. We exploited InGaAs/InP diodes, whose valance band and conduction band…
We discuss properties of probabilistic coding of two qubits to one qutrit and generalize the scheme to higher dimensions. We show that the protocol preservers entanglement between qubits to be encoded and environment and can be also applied…
Unsourced random access (URA) is a recently proposed communication paradigm attuned to machine-driven data transfers. In the original URA formulation, all the active devices share the same number of bits per packet. The scenario where…
Quantum random access codes (QRACs) provide a basic tool for demonstrating the advantages of quantum resources and protocols, which have a wide range of applications in quantum information processing tasks. However, the investigation and…
A random access memory, or RAM, is a device that, when interrogated, returns the content of a memory location in a memory array. A quantum RAM, or qRAM, allows one to access superpositions of memory sites, which may contain either quantum…