Related papers: Quantum Random Access Codes with Shared Randomness
We introduce a new type of cryptographic primitive that we call hiding fingerprinting. A (quantum) fingerprinting scheme translates a binary string of length $n$ to $d$ (qu)bits, typically $d\ll n$, such that given any string $y$ and a…
Random access coding is an information task that has been extensively studied and found many applications in quantum information. In this scenario, Alice receives an $n$-bit string $x$, and wishes to encode $x$ into a quantum state…
Quantum key distribution (QKD) refers to specific quantum strategies which permit the secure distribution of a secret key between two parties that wish to communicate secretly. Quantum cryptography has proven unconditionally secure in ideal…
QRAO (Quantum Random Access Optimization) is a relaxation algorithm that reduces the number of qubits required to solve a problem by encoding multiple variables per qubit using QRAC (Quantum Random Access Code). Reducing the number of…
Secret sharing is a multi-party cryptographic primitive that can be applied to a network of partially distrustful parties for encrypting data that is both sensitive (it must remain secure) and important (it must not be lost or destroyed).…
We present an approach to random access that is based on three elements: physical-layer network coding, signature codes and tree splitting. Upon occurrence of a collision, physical-layer network coding enables the receiver to decode the sum…
Any physical transformation that equally distributes quantum information over a large number M of users can be approximated by a classical broadcasting of measurement outcomes. The accuracy of the approximation is at least of the order 1/M.…
We propose a class of quantum no-key protocols for private communication of classical message based on quantum computing of random Boolean permutations, and demonstrate that they are information-theoretic secure. These protocols are…
The best qubit one-way quantum key distribution (QKD) protocol can tolerate up to 14.1% in the error rate. It has been shown how this rate can be increased by using larger quantum systems. The polarization state of a biphoton can encode a…
We analyze utility of communication channels in absence of any short of quantum or classical correlation shared between the sender and the receiver. To this aim, we propose a class of two-party communication games, and show that the games…
We define a variation on the well-known problem of private message transmission. This new problem called private randomness agreement (PRA) gives two participants access to a public, authenticated channel alongside the main channels, and…
Over a decade after its proposal, the idea of using quantum computers to sample hard distributions has remained a key path to demonstrating quantum advantage. Yet a severe drawback remains: verification seems to require classical…
We show a simple example of a secret sharing scheme encoding classical secret to quantum shares that can realize an access structure impossible by classical information processing with limitation on the size of each share. The example is…
We present a protocol for encoding $N$ real numbers stored in $N$ memory registers into the amplitudes of the quantum superposition that describes the state of $\log_2N$ qubits. This task is one of the main steps in quantum machine learning…
We introduce a protocol for quantum secret sharing based on reusable entangled states. The entangled state between the sender and the receiver acts only as a carrier to which data bits are entangled by the sender and disentangled from it by…
Quantum key distribution (QKD) allows for secure communications safe against attacks by quantum computers. QKD protocols are performed by sending a sizeable, but finite, number of quantum signals between the distant parties involved. Many…
A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate implementation is to perform process tomography.…
In recent years, new algorithms and cryptographic protocols based on the laws of quantum physics have been designed to outperform classical communication and computation. We show that the quantum world also opens up new perspectives in the…
In this paper we investigate the use of quantum information to share classical secrets. While every quantum secret sharing scheme is a quantum error correcting code, the converse is not true. Motivated by this we sought to find quantum…
A computer code for quasiparticle random phase approximation-QRPA and projected quasiparticle random phase approximation-PQRPA models of nuclear structure is explained in details. An important application of the code consists in evaluating…