Related papers: Quantum Random Access Codes for Boolean Functions
Motivated by the growing application of wireless multi-access networks with stringent delay constraints, we investigate the Gaussian multiple access channel (MAC) in the finite blocklength regime. Building upon information spectrum…
The ultimate goal of quantum error correction is to create logical qubits with very low error rates (e.g. 1e-12) and assemble them into large-scale quantum computers capable of performing many (e.g. billions) of logical gates on many (e.g.…
We propose a method to directly recover the degree of entanglement distributed by entanglement swapping in the presence of noise. Our approach introduces a reversing operation that probabilistically undoes the effect of amplitude damping or…
Random numbers are a fundamental and useful resource in science and engineering with important applications in simulation, machine learning and cyber-security. Quantum systems can produce true random numbers because of the inherent…
Quantum stabilizer codes (QSCs) suffer from a low quantum coding rate, since they have to recover the quantum bits (qubits) in the face of both bit-flip and phase-flip errors. In this treatise, we conceive a low-complexity concatenated…
Quantum information technology has the potential to revolutionize computing, communications, and security. To fully realize its potential, quantum processors with millions of qubits are needed, which is still far from being accomplished.…
Quantum repeater networks distribute entanglement over lossy links while many users share a limited pool of entangled pairs. Most existing routing schemes either always use a single best path or rely on global optimizations that are hard to…
By a locally recoverable code (LRC), we will in this paper, mean a linear code in which a given code symbol can be recovered by taking a linear combination of at most $r$ other code symbols with $r << k$. A natural extension is to the local…
Quantum Key Distribution is a quantum communication technique in which random numbers are encoded on quantum systems, usually photons, and sent from one party, Alice, to another, Bob. Using the data sent via the quantum signals,…
One of the crucial generic techniques for quantum computation is amplitude encoding. Although several approaches have been proposed, each of them often requires exponential classical-computational cost or an oracle whose explicit…
A photonic quantum memory capable of simultaneously storing multiple qubits and subsequently recalling any randomly selected subset of the qubits, is essential for large-scale quantum networking and computing. Such functionality, akin to…
The standard approach to realize a quantum repeater relies upon probabilistic but heralded entangled state manipulations and the storage of quantum states while waiting for successful events. In the literature on this class of repeaters,…
The unpredictability of random numbers is fundamental to both digital security and applications that fairly distribute resources. However, existing random number generators have limitations-the generation processes cannot be fully traced,…
Using random Gaussian vectors and an information-uncertainty relation, we give a proof that the coherent information is an achievable rate for entanglement transmission through a noisy quantum channel. The codes are random subspaces…
In conventional circuit-based quantum computing architectures, the standard gate set includes arbitrary single-qubit rotations and two-qubit entangling gates. This choice is not always aligned with the native operations available in certain…
Quantum networks enable a number of important applications such as quantum key distribution. The basic function of a quantum network is to enable long-distance quantum entanglement between two remote communication parties. This work focuses…
Multipartite entanglement plays a crucial role for the design of the Quantum Internet, due to its potentiality of significantly increasing the network performance. In this paper, we design an entanglement access control protocol for…
Randomized protocols are procedures that incorporate probabilistic choices during their execution and they play a central role in quantum algorithms, spanning Hamiltonian simulation, noise mitigation, and measurement tasks. In practical…
We show how to construct simulation secure one-time memories, and thus one-time programs, without computational assumptions in the presence of constraints on quantum hardware. Specifically, we build one-time memories from random linear…
Quantum optimization methods use a continuous degree-of-freedom of quantum states to heuristically solve combinatorial problems, such as the MAX-CUT problem, which can be attributed to various NP-hard combinatorial problems. This paper…