A (t,n) threshold quantum secret sharing with cheat identification and authenticity

We study the communication capabilities of a quantum channel under the most general channel model known as the one-shot model. Unlike classical channels that can only be used to transmit classical information (bits), a quantum channel can be used for transmission of classical information, quantum information (qubits) and simultaneous transmission of classical and quantum information. In this work, we investigate the one-shot capabilities of a quantum channel for simultaneously transmitting of bits and qubits. This problem was studied in the asymptotic regime for a memoryless channel and a regularized characterization of the capacity region was reported. It is known that the transmission of private classical information is closely related to the problem of quantum information transmission. We resort to this idea and find achievable and converse bounds on the simultaneous transmission of the public and private classical information. then by shifting the classical private rate to the quantum information rate, the obtained rate regions will be translated into rate regions of thThis in turn, leads to a rate region for simulttaneous transmission of classical and quantum information. In the case of asymptotic i.i.d. setting, our one-shot result is evaluated to the known results in the literature. Our main tools used in the achievability proofs are position-based decoding and convex-split lemma.

The Symmetries of Quantum and Classical Information. The Ressurected “Ether" of Quantum Information

The family of $n$-bit Toffoli gates, with the two-bit Toffoli gate as the figurehead, are of great interest in quantum information as they can be used as universal gates and in quantum error correction, among other things. We present a single-step implementation of arbitrary $n$-bit Toffoli gates (up to a local change of basis), based on resonantly driving a single qubit that has a strong Ising coupling to $n$ other qubits. The setup in the two-qubit case turns out to be identical to the universal Barenco gate. The gate time and error are, in theory, independent of the number of control qubits, scaling better than conventional circuit decompositions. We note that our assumptions, namely strongly coupling $n+1$ qubits and a driving frequency that scales with $n$, may break down for large systems. Still, our protocol could enhance the capabilities of intermediate scale quantum computers, and we discuss the prospects of implementing our protocol on trapped ions, Rydberg atoms, and on superconducting circuits. Simulations of the latter platform show that the Toffoli gate with two control bits attains fidelities of above 0.98 even in the presence of decoherence. We also show how similar ideas can be used to make a series of controlled-\textsc{not}-gates in a single step. We show how these can speed up the implementation of quantum error correcting codes and we simulate the encoding steps of the three-qubit bit-flip code and the seven-qubit Steane code.

The ability to transfer information securely is essential in the modern world we live in. While the field of cryptography has long researched ways to do this, events over the last couple of years have brought the issues of secure information transfer squarely into the public eye. As a consequence, security and cryptography have quickly become issues of social and political importance, sparking debates about the values of privacy and the role of government. An essential ingredient of modern cryptography is the generation of randomness: cryptographic techniques are built on the premise that one has access to random bits. It is well known, however, that computers cannot produce algorithmically random sequences – that is, sequences with maximal algorithmic information content – but are doomed to produce 'pseudorandomness'. This lack of randomness can be, and has been, exploited to compromise security, see [4]. The active field of quantum information theory has proposed approaches to provide supposedly 'unbreakable' security by exploiting various quantum phenomena. This security unfortunately relies on assumptions about the nature of quantum measurements and their ability to generate random bits. Anton Zeilinger summarises this by postulating that the simplest quantum systems, qubit, can hold only one bit of classical information [6]. This foundational principle is in line with a wider paradigm shift to view quantum information as an extension of classical information, but it is nonetheless unsatisfying to simply postulate this principle, given its importance in determining the practical advantages of quantum information theory. In order to understand better how quantum mechanics can help generate meaningful information, we instead look to relate the outcomes of quantum measurements to formal properties of the system based on more fundamental assumptions. Indeed, we have shown that a) some of the postulated properties of quantum information follow from the formal structure of the theory and b) a purely formal notion of information within a quantum world can generate, via measurement, meaningful and useful information in the macroscopic world (for example, in cryptography). The indeterminism of quantum measurements can be formalised via the notion of value indefiniteness. To explain this concept, let us consider an arbitrary quantum system and ask whether the outcome of a measurement of any observable quantity A (such as the energy of the system, its angular momentum (spin), etc.) is determined prior to the measurement. If this is the case, then we say the observable is value definite with value v(A); otherwise, the observable is value indefinite and v(A) is undefined. Mathematically, one can reduce all observable quantities to so-called projection observables, which can only take the values 0 or 1. Thus, the question of whether the outcome of several measurements can be simultaneously determined in advance can be rephrased in terms of the information 'carried' by a particular system in a definite quantum state. Classically, one expects that all quantities are determined in advance, and hence all observables are value definite. Quantum mechanically, however, the belief is that this is not the case, and the information content of quantum systems is limited. Formulating carefully the notion of value indefiniteness allows us to formalise the notion of (quantum) indeterminism; however, this doesn't help clarify whether quantum systems are indeed value indefinite or not. Staying in this formal framework, the Kochen-Specker theorem [5] provides a first positive result, showing that at least some observables must be value indefinite if one makes the assumption known as non-contextuality, which states that any definite values that exist must be independent of other compatible measurements that may or may not be performed on the system. Under the same assumption, this theorem can be strengthened to show that only one single observable can have the definite value 1 (see [2]). Furthermore, only observables that can be measured simultaneously with this single one can have the definite value 0; the rest must all be value indefinite. Since the preparation of a system involves precisely ensuring that, usually via measurement, the system is in a definite state with respect to some desired observable, this result shows that no other incompatible observable can be value definite. That is, preparing a system in a definite state by making the 'preparation' observable value definite specifies completely the information content of the quantum system. This is an example of syntactical quantum information acquiring meaning at the level of the quantum itself. Can the syntactical information at the level of the quantum generate meaning outside the quantum, that is, at the macroscopic level? The results cited above hold in the Hilbert-space framework of quantum mechanics and are formulated only in terms of a syntactical notion of information. Their real importance becomes evident when one interprets them in the context of quantum measurements. Specifically, if we prepare a quantum system in a known state, they allow us to 'locate' observables which we can measure, but which are value indefinite; that is, observables whose measurement results are not specified by any pre-existing property of the quantum system. Furthermore, with respect to a mathematical model of unpredictability which we developed in [3], the results of these measurements can be shown to be absolutely unpredictable. In this way we get a mathematical explanation and justification of the largely accepted intuition that quantum mechanics is inherently unpredictable, and that this unpredictability arises from the phenomenon of indefiniteness within the quantum world. Furthermore, if one considers a hypothetical infinite sequence generated by the repeated measurement of a quantum value indefinite observable, one can prove that these sequences must be strongly incomputable, technically 'bi-immune' [1]. Such sequences cannot be generated by any Turing machine or classical computer, showing that value indefiniteness leads to a clear classical/quantum split in a purely algorithmic context. Importantly, bi-immunity is a property of observed, macroscopic quantities, quite separate from the quantum framework in which the value indefiniteness is formalised. This form of macroscopic meaning created from the lack of syntactic information is precisely the scenario that quantum random number generators try to create, and which is essential for the development and certification of quantum cryptographic systems. The fact that the macroscopic information created goes beyond anything classically obtainable serves as a valuable practical resource, outside of and removed from the quantum formalism. To conclude, quantum information creates meaning within the quantum and via measure- ment, the lack of information within the quantum, creates meaning and valuable information at the macroscopic level. Acknowledgments The second author thanks Prof. S. Marcus for useful conversations on quantum information theory. This work was supported in part by Marie Curie FP7-PEOPLE-2010-IRSES Grant RANPHYS. References and Notes Abbott, A.A.; Calude, C.S.; Svozil, K. Strong Kochen-Specker theorem and incomputability of quantum randomness. Physical Review A 2012, 86, 062109. Abbott, A.A.; Calude, C.S.; Svozil, K. Value-indefinite observables are almost everywhere. Physical Review A 2013, 89, 032109. Abbott, A.A.; Calude, C.S.; Svozil, K. On the unpredictability of individual quantum measurement outcomes. CDMTCS Research Report 2014, 458. Calude, C.S. Quantum randomness & cryptology. CyberTalk 2013, 3, 42–43. Kochen, S.; Specker, E. The problem of hidden variables in quantum mechanics. Journal of Mathematics and Mechanics 1967, 17, 59–87. Zeilinger, A. A foundational principle for quantum mechanics. Foundations of Physics 1999, 29(4),631–643.

Quantum secret sharing is an important way to achieve secure communications, which has critical applications in the field of information security for its physical properties. According to the perspective of the practical applications, improving the confidentiality and integrity of secret sharing schemes is a good method to increase the security and reliability of communications. In this paper, we propose a quantum secret sharing scheme based on generator matrix segmentation and the structural features of quantum graph states. The security of the secure secret sharing scheme is guaranteed by the pattern of transferring information by stabilizers, scalability of the information and new recovery strategy provided by the entanglement of the related graph states. It puts forward an effective solution to the problem of matrix cycle period, where some numbers without the primitive element cannot construct the generation matrix. First of all, the physical properties of quantum bits (qubits), such as uncertainty principle, no-cloning theorem and indistinguishability, not only optimize the classical schemes but also ensure the absolute safety of communication. Secondly, the application of matrix segmentation makes secret information has better scalability. It improves the coding diversity and the difficulty in deciphering. Thirdly, the favorable entanglement properties and mature experiment preparation techniques of graph states provide an approach to the practical applications. The superiority of the yielded graph states is described in graphical fashion with an elegant stabilizer. Fourthly, the shuffling operation can ensure the independence of the message among participants. Therefore, Eve can not obtain any useful information by measuring randomly. Two group-recovery protocols are proposed to show the secret recovering processing through rebuilding sub-secrets among legal cooperative participants. In the scheme design, the dealer extracts the classical secret information according to the corresponding principle between the classical and quantum information, and divides the classical secret through generated matrix which is produced with the primitive elements in finite domain satisfying the linear independence for any k column vectors. Then the dealer encodes information into graph states and distributes particles to the legal participants with unitary operations. Subsequently, the credible center obtains sub-secrets by the theory of graph states and the group recovery protocol. He can achieve the initial classical secret via the inverse algorithm of matrix segmentation. After getting the classical secret, he recovers quantum secret according to the relationship between classical information and quantum information. Theoretical analysis shows that this scheme can provide better security and scalability of the information. It is appropriate to realize the secret sharing in the quantum network communication to protect secrets from eavesdropping. Also, it can provide an approach to designing diverse and scalable quantum secure communication schemes based on quantum graph states, the algorithm of matrix segmentation, and group-recovery protocol.

Physical systems contain information which can be divided between classical and quantum information. Classical information is locally accessible and allows one to perform tasks such as physical work, while quantum information allows one to perform tasks such as teleportation. It is shown that these two kinds of information are complementarity in the sense that two parties can either gain access to the quantum information, or to the classical information but not both. This complementarity has a form very similar to the complementarities usually encountered in quantum mechanics. For pure states, the entanglement plays the role of Planck's constant. We also find another class of complementarity relations which applies to operators, and is induced when two parties can only perform local operations and communicate classical. In order to formalize this notion we define the restricted commutator. Observables such as the parity and phase of two qubits commute, but their restricted commutator is non-zero. It is also found that complementarity is pure in the sense that can be ''decoupled'' from the uncertainty principle.

Quantum communication offers transformative potential for media transmission by addressing the limitations of classical communication systems. To realize this potential, the study proposes a quantum communication framework for transmitting compressed videos over error-prone channels, leveraging quantum superposition. Two channel coding schemes are analyzed: quantum error correction (three-qubit, five-qubit, and seven-qubit codes) and classical error correction (1/3 rate polar code), all operating within the same bandwidth constraints. The proposed systems are benchmarked against a classical communication system using 1/3 rate polar codes. Results show that the three-qubit error correction-based quantum communication system, while simple and efficient, achieves significant performance gains over both classical error correction-based quantum and classical communication systems, with up to 41.42 dB in peak signal-to-noise ratio (PSNR), 0.9639 in structural similarity index measure (SSIM), and 94.4042 in video multimethod assessment fusion (VMAF). However, the five-qubit and seven-qubit systems outperform the three-qubit system, with the seven-qubit system surpassing all others in high noise environments, demonstrating its robustness across various group of pictures (GOP) formats. These findings highlight the trade-offs between simplicity and complexity, as the three-qubit system is practical and efficient, while the five-qubit and seven-qubit channel codes offer higher fidelity and resilience at the cost of increased complexity.

It is known that the maximum classical mutual information that can be achieved between measurements on a pair of quantum systems can drastically underestimate the quantum mutual information between those systems. In this article, we quantify this distinction between classical and quantum information by demonstrating that after removing a logarithmic-sized quantum system from one half of a pair of perfectly correlated bitstrings, even the most sensitive pair of measurements might only yield outcomes essentially independent of each other. This effect is a form of information locking but the definition we use is strictly stronger than those used previously. Moreover, we find that this property is generic, in the sense that it occurs when removing a random subsystem. As such, the effect might be relevant to statistical mechanics or black hole physics. Previous work on information locking had always assumed a uniform message. In this article, we assume only a min-entropy bound on the message and also explore the effect of entanglement. We find that classical information is strongly locked almost until it can be completely decoded. As a cryptographic application of these results, we exhibit a quantum key distribution protocol that is secure if the eavesdropper's information about the secret key is measured using the accessible information but in which leakage of even a logarithmic number of key bits compromises the secrecy of all the others.

Light orbital angular momentum (OAM) has been recognized as a new promising resource for classical and quantum information applications. In contrast to the spin angular momentum, the OAM is an inherently multidimensional. Thus, the information can be encoded in the higher-dimensional OAM alphabets. Recently, Marrucci et al. have invented a new device named q-plate (QP), made of liquid crystal cell patterned in such a way to introduce a topological charge q at the transverse plane, which is able to generate a well-defined values of photon OAM. My research has been aimed at investigating the physics of the QP, of the optical fields that it generates and of its possible applications for optical communication and quantum information. We studied both theoretically and experimentally a novel set of non-orthogonal but over-complete paraxial modes, named Hypergeometric-Gaussian modes, that is typically associated with OAM-carrying optical fields. We have also found the light propagation kernel inside the QP and we have shown analytically that if small losses due to reflection, absorption, and scattering are neglected, the QP can convert the photon spin into OAM with up to 100 \% efficiency. We implemented a technique to control the QP optical retardation by tuning the QP temperature. At the optimal temperature, the QP can generate a beam with up to 97\% efficiency. Moreover, the OAM state generated by QP can be rotated easily in the 2D OAM Hilbert space by proper manipulation of the input polarization state, a fact which opens a new way of beam shape controlling in MHz scale. We also performed a novel way to encode and read two bits information on the 4D OAM space by using only one QP. Finally, we experimentally demonstrated the transfer of quantum information from spin to OAM and vice versa, including the case of bi-photon states having quantum correlations. Furthermore, by exploiting these quantum information transfer devices, we demonstrated the Hong-Ou-Mandel effect and the optimal quantum cloning with OAM-carrying photons.

We present a novel weather analysis of San Francisco from 2009 to 2019 using concepts from quantum information theory. We describe how to transform a classical weather dataset into a quantum-inspired analytical framework by treating it as a quantum information system embedded in a quantum-like representation, with data encoded as density matrices in Hilbert space. Transforming classical weather data into quantum states is a mathematical abstraction, whereas a quantum-inspired system is not a quantum-physical system. We study a quantum-inspired analytical framework using quantum information-theoretic metrics, including fidelity, classical information, quantum information, decoherent information, Shannon and von Neumann entropies, and the quantum stability index, to represent and analyze the dataset. Furthermore, we give predictions for each quantum information metric for 2020 and 2021. We fit Fourier-series models to the metrics to explore temporal patterns and structural properties in the data.

Quantum error correction (QEC) is one of the central concepts in quantum information science and also has wide applications in fundamental physics. The capacity theorems provide solid foundations of QEC. We here provide a general and highly applicable form of capacity theorem for both classical and quantum information, i.e., hybrid information, with the assistance of a limited resource of entanglement in a one-shot scenario, which covers broader situations than the existing ones. Harnessing the wide applicability of the theorem, we show that a demonstration of QEC by short random quantum circuits is feasible and that QEC is intrinsic in quantum chaotic systems. Our results bridge the progress in quantum information theory, near-future quantum technology, and fundamental physics.

In this dissertation, we present a detailed theoretical analysis of the spin dynam- ics in small antiferromagnetic systems in view of macroscopic quantum phenom- ena, possible applications in quantum information processing, and transport of the magnetization. Ferromagnetic and antiferromagnetic systems with a size on the nanometer scale such as nanoparticles or magnetic molecular clusters, show intriguing quantum e®ects which are in stark contrast to the behavior of a macroscopic magnetic moment. In recent years, the interest in small magnetic systems has been renewed due to the discovery of possible future technological applications such as data storage or quantum information processing. Fer- romagnetic molecular magnetic systems with a large net spin show incoherent tunneling of the magnetization on a long timescale. This quantum phenomenon is, by now, well established both experimentally and theoretically. Small an- tiferromagnetic systems have so far attracted less attention although quantum e®ects are even more pronounced than in their ferromagnetic counterparts. The main reason for this is that the predicted quantum phenomena such as coherent quantum tunneling of the N¶eel vector are not easily accessible in experiments. On a theoretical level, the description of an antiferromagnetic system is chal- lenging because of the pronounced quantum °uctuations of the spins. Several antiferromagnetic molecular ring molecules have been synthesized to date. The ferric wheels are the most prominent examples. These systems are promising candidates for macroscopic quantum coherence in the form of coherent N¶eel vector tunneling. Although the tunneling rate can be determined from the measurement of thermodynamic properties, a thorough understanding requires theoretical analysis and experimental observation of the spin dynamics. We calculate spin correlation functions using spin coherent state path integrals and ¯nd analytical expressions for the correlation functions of both the N¶eel vector and the total spin. Our results are in good agreement with numerical exact diagonalization for the small systems that are accessible numerically. From the correlation functions, we deduce that the observation of N¶eel vec- tor tunneling requires an experimental probe that couples to a single spin of the antiferromagnetic system only. Both nuclear magnetic resonance and elec- tron spin resonance on doped rings meet this criterion. Nuclear spins coupled only to single electron spins are ideal candidates for local probes because the nuclear spin susceptibiliy exhibits signatures of the coherent electron spin dy- namics. Alternatively, by doping of the ring molecule, an antiferromagnetic system emerges that has uncompensated sublattice spins. The resulting tracer spin would allow one to detect N¶eel vector tunneling with electron spin reso- nance or magnetic susceptibility measurements. Small antiferromagnetic systems with a ¯nite net spin are interesting in view of quantum information processing. Single electron spins are among the most promising candidates for qubits in a solid state system. However, quantum computing is also possible with a wide range of antiferromagnetic clusters which form an e®ective two-state system in the low energy sector. The main advantage of a qubit formed by a spin cluster is that initialization, quantum gate operation, error correction, and readout are possible with techniques applicable to single spins, while the requirements on local control are relaxed. Spin cluster qubits are very insensitive to the details of intracluster exchange interactions and spin placement. Quantum computing is only one of the exciting perspectives in the emerging ¯eld of spintronics in which the spin and charge degrees of freedom of an elec- tron are treated on an equal footing. We analyze transport of magnetization in insulating systems described by a spin Hamiltonian in which the magnetization current is not accompanied by a charge current. The magnetization current through a quasi one-dimensional magnetic wire of ¯nite length suspended be- tween two bulk magnets is determined by the spin conductance which remains ¯nite in the ballistic limit due to contact resistance. Magnetization currents produce an electric ¯eld and hence can be measured directly. For magnetiza- tion transport in an external electric ¯eld, phenomena analogous to the Hall e®ect emerge.

We address routing of classical and quantum information over quantum network and show how to exploit chirality (directionality) to achieve nearly optimal and robust transport. In particular, we prove how continuous-time chiral quantum walks over a minimal graph are able to model directional transfer of information over a network. At first, we show how classical information, encoded onto an excitation localized at one vertex of a simple graph, may be sent to any other chosen location with nearly unit fidelity by tuning a single phase. Then, we prove that high-fidelity transport is also possible for coherent superpositions of states, i.e., for routing of quantum information. Furthermore, we show that by tuning the phase parameter, one obtains universal quantum routing, i.e., independent on the input state. In our scheme, chirality is governed by a single phase, and the routing probability is robust against fluctuations of this parameter. Finally, we address characterization of quantum routers and show how to exploit the self-energies of the graph to achieve high precision in estimating the phase parameter.

This chapter introduces the notions of classical and quantum information and discusses simple protocols for their exchange. It defines the entropy as a quantitative measure of information, and investigates its mathematical properties and operational meaning. It discusses the extent to which classical information can be carried by a quantum system and derives a pertinent upper bound, the Holevo bound. One important application of quantum communication is the secure distribution of cryptographic keys; a pertinent protocol, the BB84 protocol, is discussed in detail. Moreover, the chapter explains two protocols where previously shared entanglement plays a key role, superdense coding and teleportation. These are employed to effectively double the classical information carrying capacity of a qubit, or to transmit a quantum state with classical bits, respectively. It is shown that both protocols are optimal.

Artificial intelligence and quantum communication are two distinct but very far-reaching disciplines. In recent years, with the rapid development of these two disciplines, using artificial intelligence to solve the problem of transmission quality in quantum communication is also a hotspot of scientific research. In this paper, we propose the scheme for asymmetric controlled cyclic joint remote state preparation scheme in noisy environments to lay the foundation for the future use of artificial intelligence to solve the noise problem in the quantum communication process. In the scheme, under the control of supervisor David, several senders can jointly realize the preparation of quantum states for the remote receiver. We first performed the theoretical analysis of the scheme in the ideal environment, then studied the scheme in four different noise environments (amplitude damping noise, phase damping noise, bit-flip noise, depolarized noise). The results show that except in the bit-flip noise environment, the fidelity of the output state is only related to the decoherence rate, and in the other three noise environments, the fidelity is not only related to the decoherence rate but also the coefficients of the desired state. Finally, we also compared our scheme with other remote state preparation schemes, and the results show that our scheme has some superiority.