We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel code by using generalized packing lemmas for the type method. Using our classical-quantum universal superposition code, we establish the capacity region of a classical-quantum compound broadcast channel with degraded message sets. Our universal classical-quantum multiple access channel codes have two types of codes. One is a code with joint decoding and the other is a code with separate decoding. The former universally achieves corner points of the capacity region and the latter universally achieves general points of the capacity region. Combining the latter universal code with the existing result by Quantum Inf Process. 18, 246 (2019), we establish a single-letterized formula for the capacity region of a classical-quantum compound multiple access channel.
By sending a classical two-level system, one can transfer information about only \emph{two} distinguishable outcomes. Here we show that in quantum mechanics, using both the spin and path degrees of freedom of a spin-1/2 particle, and a Mach-Zehnder type interferometric arrangement with two suitable Stern-Gerlach detectors, it is possible to transfer information about \emph{four} distinguishable outcomes. This procedure does \emph{not} require using quantum entanglement as a resource as in the well-known protocol of dense coding, but instead hinges entirely on the quantum superposition principl…
We consider quantum channels with one sender and two receivers, used in several different ways for the simultaneous transmission of independent messages. We begin by extending the technique of superposition coding to quantum channels with a classical input to give a general achievable region. We also give outer bounds to the capacity regions for various special cases from the classical literature and prove that superposition coding is optimal for a class of channels. We then consider extensions of superposition coding for channels with a quantum input, where some of the messages transmitted ar…
Suppose that two senders each obtain one share of the output of a classical, bivariate, correlated information source. They would like to transmit the correlated source to a receiver using a quantum multiple access channel. In prior work, Cover, El Gamal, and Salehi provided a combined source-channel coding strategy for a classical multiple access channel which outperforms the simpler "separation" strategy where separate codebooks are used for the source coding and the channel coding tasks. In the present paper, we prove that a coding strategy similar to the Cover-El Gamal-Salehi strategy and …
Korea University（高丽大学）；Ajou University（亚洲大学）；Deakin University（迪肯大学）；University of Oulu（奥卢大学）
While witnessing the noisy intermediate-scale quantum (NISQ) era and beyond, quantum federated learning (QFL) has recently become an emerging field of study. In QFL, each quantum computer or device locally trains its quantum neural network (QNN) with trainable gates, and communicates only these gate parameters over classical channels, without costly quantum communications. Towards enabling QFL under various channel conditions, in this article we develop a depth-controllable architecture of entangled slimmable quantum neural networks (eSQNNs), and propose an entangled slimmable QFL (eSQFL) that…
We derive universal codes for transmission of broadcast and confidential messages over classical-quantum-quantum and fully quantum channels. These codes are robust to channel uncertainties considered in the compound model. To construct these codes we generalize random codes for transmission of public messages, to derive a universal superposition coding for the compound quantum broadcast channel. As an application, we give a multi-letter characterization of regions corresponding to the capacity of the compound quantum broadcast channel for transmitting broadcast and confidential messages simult…
We consider secret sharing schemes with a classical secret and quantum shares. One example of such schemes was recently reported whose access structure cannot be realized by any secret sharing schemes with classical shares. In this paper, we report further quantum secret sharing schemes whose access structures cannot be realized by any classical secret sharing schemes.
In 2013, Boneh and Zhandry introduced the notion of indistinguishability (IND) in chosen plaintext (CPA) and chosen ciphertext (CCA) attacks by a quantum adversary which is given superposition access to an oracle for encryption and decryption queries but is restricted to classical queries in the challenge phase. In this paper we define IND-CPA and IND-CCA notions for symmetric encryption schemes where the adversary has full quantum superposition access to the oracle, and give constructions that achieve these security notions. Our results are formulated in the concrete security framework.
The quantum analogues of classical variable-length codes are indeterminate-length quantum codes, in which codewords may exist in superpositions of different lengths. This paper explores some of their properties. The length observable for such codes is governed by a quantum version of the Kraft-McMillan inequality. Indeterminate-length quantum codes also provide an alternate approach to quantum data compression.
Quantum superpositions and entanglement are at the heart of the quantum information science. There have been only a few investigations of these phenomena at the mesoscopic level, despite the fact that these systems are promising for quantum state storage and processing. Here we present two novel experiments with surface plasmons propagating on cm-long metallic stripe waveguides. We demonstrate that two plasmons can be entangled at remote places. In addition, we create a single plasmon in a temporal superposition state: it exists in a superposition of two widely separated moments. These quantum…
An (n,1,p)-Quantum Random Access (QRA) coding, introduced by Ambainis, Nayak, Ta-shma and Vazirani in ACM Symp. on Theory of Computing 1999, is the following communication system: The sender which has n-bit information encodes his/her information into one qubit, which is sent to the receiver. The receiver can recover any one bit of the original n bits correctly with probability at least p, through a certain decoding process based on positive operator-valued measures. Actually, Ambainis et al. shows the existence of a (2,1,0.85)-QRA coding and also proves the impossibility of its classical coun…
Quantum information theory predicts that when the transmission resource is doubled in quantum channels, the amount of information transmitted can be increased more than twice by quantum channel coding technique, whereas the increase is at most twice in classical information theory. This remarkable feature, the superadditive quantum coding gain, can be implemented by appropriate choices of code words and corresponding quantum decoding which requires a collective quantum measurement. Recently, the first experimental demonstration was reported [Phys. Rev. Lett. 90, 167906 (2003)]. The purpose of …
Random access codes are important for a wide range of applications in quantum information. However, their implementation with quantum theory can be made in two very different ways: (i) by distributing data with strong spatial correlations violating a Bell inequality, or (ii) using quantum communication channels to create stronger-than-classical sequential correlations between state preparation and measurement outcome. Here, we study this duality of the quantum realization. We present a family of Bell inequalities tailored to the task at hand and study their quantum violations. Remarkably, we s…
We propose an experimentally accessible, objective measure for the macroscopicity of superposition states in mechanical quantum systems. Based on the observable consequences of a minimal, macrorealist extension of quantum mechanics, it allows one to quantify the degree of macroscopicity achieved in different experiments.
Quantum field theory is completely characterized by the field correlations between spacetime points. In turn, some of these can be accessed by locally coupling to the field simple quantum systems, a.k.a. particle detectors. In this work, we consider what happens when a quantum-controlled superposition of detectors at different space-time points is used to probe the correlations of the field. We show that, due to quantum interference effects, two detectors can gain information on field correlations which would not be otherwise accessible. This has relevant consequences for information theoretic…
We report the realization of an entangled quantum superposition of M=12 photons by a high gain, quantum-injected optical parametric amplification. The system is found so highly resilient against decoherence to exhibit directly accessible mesoscopic interference effects at normal temperature. By modern tomographic methods the non-separability and the quantum superposition are demonstrated for the overall mesoscopic output state of the dynamic ''closed system''. The device realizes the condition conceived by Erwin Schroedinger with his 1935 paradigmatic ''Cat'' apologue, a fundamental landmark i…
We report the security analysis of time-coding quantum key distribution protocols. The protocols make use of coherent single-photon pulses. The key is encoded in the photon time-detection. The use of coherent superposition of states allows to detect eavesdropping of the key. We give a mathematical model of a first protocol from which we derive a second, simpler, protocol. We derive the security analysis of both protocols and find that the secure rates can be similar to those obtained with the BB84 protocol. We then calculate the secure distance for those protocols over standard fibre links. Wh…
Quantum-access security, where an attacker is granted superposition access to secret-keyed functionalities, is a fundamental security model and its study has inspired results in post-quantum security. We revisit, and fill a gap in, the quantum-access security analysis of the Lamport one-time signature scheme (OTS) in the quantum random oracle model (QROM) by Alagic et al.~(Eurocrypt 2020). We then go on to generalize the technique to the Winternitz OTS. Along the way, we develop a tool for the analysis of hash chains in the QROM based on the superposition oracle technique by Zhandry (Crypto 20…
In this work, we demonstrate reconfigurable frequency manipulation of quantum states of light in the telecom C-band. Triggered single photons are encoded in a superposition state of three channels using sidebands up to 53 GHz created by an off-the-shelf phase modulator. The single photons are emitted by an InAs/GaAs quantum dot grown by metal-organic vapor-phase epitaxy within the transparency window of the backbone fiber optical network. A cross-correlation measurement of the sidebands demonstrates the preservation of the single photon nature; an important prerequisite for future quantum tech…
