Related papers: Diagrammatic security proof for 8-state encoding
Characterizing noisy quantum processes is important to quantum computation and communication (QCC), since quantum systems are generally open. To date, all methods of characterization of quantum dynamics (CQD), typically implemented by…
Large scale quantum computing is highly anticipated, and quantum circuit design automation needs to keep up with the transition from small scale to large scale problems. Methods to support fast quantum circuit manipulations (e.g.~gate…
Quantum computing poses significant threats to conventional cryptographic techniques such as RSA and AES, motivating the need for quantum secure communication methods. Quantum Key Distribution (QKD) offers information theoretic security…
We devise a simple modification that essentially doubles the efficiency of the BB84 quantum key distribution scheme proposed by Bennett and Brassard. We also prove the security of our modified scheme against the most general eavesdropping…
The application of diagrammatic reasoning techniques to large-scale quantum processes needs specific tools to describe families of diagrams of arbitrary size. For now, large-scale diagrammatic reasoning tools in ZH-calculus come in two…
We give for the first time a diagrammatic calculational tool of quantum entanglement. We present a pedagogical and simple mechanical implementation of quantum entanglement or "spooky action at a distance" to give a tangible realization of…
Quantum cryptography or, more precisely, quantum key distribution (QKD), is one of the advanced areas in the field of quantum technologies. The confidentiality of keys distributed with the use of QKD protocols is guaranteed by the…
The driven-dissipative Dicke model features normal, superradiant, and lasing steady-states that may be regular or chaotic. We report quantum signatures of chaos in a quench protocol from the lasing states. Within the framework of a…
We present a new technique for proving the security of quantum key distribution (QKD) protocols. It is based on direct information-theoretic arguments and thus also applies if no equivalent entanglement purification scheme can be found.…
The phase diagram of strong interactions in nature at finite temperature and chemical potential remains largely unexplored theoretically due to inadequacy of Monte-Carlo-based computational techniques in overcoming a sign problem. Quantum…
The Quantum Key Distribution protocol can encode a single quantum state and implements an information-theoretically secure key distribution protocol in communication. In the actual QKD experimental system, there are usually two encoding…
Quantum key distribution (QKD) allows two users to communicate with theoretically provable secrecy by encoding information on photonic qubits. Current encoders are complex, however, which reduces their appeal for practical use and…
A diagrammatic method is presented for averaging over the circular ensemble of random-matrix theory. The method is applied to phase-coherent conduction through a chaotic cavity (a ``quantum dot'') and through the interface between a normal…
Owing to its fundamental principles, quantum theory holds the promise to enhance the security of modern cryptography, from message encryption to anonymous communication, digital signatures, online banking, leader election, one-time…
We formalize the correspondence between quantum states and quantum operations isometrically, and harness its consequences. This correspondence was already implicit in the various proofs of the operator sum representation of Completely…
The computational power of quantum computers poses major challenges to new design tools since representing pure quantum states typically requires exponentially large memory. As shown previously, decision diagrams can reduce these memory…
Quantum key distribution (QKD) protocols most often use two conjugate bases in order to verify the security of the quantum channel. In the majority of protocols, these bases are mutually unbiased to one another, which is to say they are…
We consider three broad classes of quantum secret sharing with and without eavesdropping and show how a graph state formalism unifies otherwise disparate quantum secret sharing models. In addition to the elegant unification provided by…
A fundamental problem in quantum information is to describe efficiently multipartite quantum states. An efficient representation in terms of graphs exists for several families of quantum states (graph, cluster, stabilizer states),…
Classical representations of quantum states and operations as vectors and matrices are plagued by an exponential growth in memory and runtime requirements for increasing system sizes. Based on their use in classical computing, an…