We are proudly a Ukrainian website. Our country was attacked by Russian Armed Forces on Feb. 24, 2022.
You can support the Ukrainian Army by following the link: https://u24.gov.ua/.
Even the smallest donation is hugely appreciated!
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Quantum polarisation teleportation protocols.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Quantum polarisation teleportation protocols":
1
ZHAN, YOU-BANG, PENG-CHENG MA, and QUN-YONG ZHANG. "REMOTE IMPLEMENTATION OF AN UNKNOWN SINGLE-QUBIT OPERATION BY DIFFERENT DIMENSIONAL QUANTUM CHANNEL." International Journal of Quantum Information 10, no. 07 (October 2012): 1250074. http://dx.doi.org/10.1142/s0219749912500748.
We present two novel protocols for remote implementation of an unknown single-qubit operation with an EPR pair and a high-dimensional entangled state as the quantum channel, without and with quantum control. The main strategy of the protocols is teleportation of an unknown single-qubit operation, which consists of an usual teleportation of an arbitrary single-qubit state, nonsymmetric basis measurement, and corresponding local transformation. It is shown that the teleportation of the quantum operation can be implemented with unit successful probability.
2
LUO, MING-XING, XIU-BO CHEN, YI-XIAN YANG, and XIN-XIN NIU. "CLASSICAL COMMUNICATION COSTS IN QUANTUM INFORMATION PROCESSING." International Journal of Quantum Information 09, no. 05 (August 2011): 1267–78. http://dx.doi.org/10.1142/s0219749911007952.
Classical communication plays an important role in quantum information processing such as remote state preparation and quantum teleportation. First, in this paper, we present some simple faithful remote state preparation of an arbitrary n-qubit state by constructing entanglement resources and special measurement basis for the sender. Then to weigh the classical resource required, we present an information-theoretical model to evaluate the classical communication cost. By optimizing the classical communication in quantum protocols, we obtain the optimal classical communication cost. This model can also be applied to the quantum teleportation. Moreover, based on the present computation model, we reinvestigate some remote state preparation and teleportation protocols in which the classical communication cost was imperfectly computed. Finally, some problems will be presented.
3
van Enk, S. J., and T. Rudolph. "Quantum communication protocols using the vacuum." Quantum Information and Computation 3, no. 5 (2003): 423–30. http://dx.doi.org/10.26421/qic3.5-3.
We speculate what quantum information protocols can be implemented between two accelerating observers using the vacuum. Whether it is in principle possible or not to implement a protocol depends on whether the aim is to end up with classical information or quantum information. Thus, unconditionally secure coin flipping seems possible but not teleportation.
4
Yang, Yu-Guang, Sheng-Nan Cao, Wei-Feng Cao, Dan Li, Yi-Hua Zhou, and Wei-Min Shi. "Generalized teleportation by means of discrete-time quantum walks on N-lines and N-cycles." Modern Physics Letters B 33, no. 06 (February 28, 2019): 1950070. http://dx.doi.org/10.1142/s0217984919500702.
Recently, Wang et al. [Wang et al., Quantum Inf. Process. 16 (2017) 221] developed generalized teleportation schemes based on different quantum walks structures. In their paper, an interesting open question is whether there are other graphs suitable for teleportation. Here, we extend the results of quantum teleportation of an unknown qubit state by means of discrete-time quantum walks and propose two kinds of schemes for quantum teleportation by means of discrete-time quantum walks on N-lines and N-cycles, respectively. Likewise, prior quantum entanglement is unnecessary for teleportation and quantum entanglement is generated by means of quantum walks. This further opens wider applications of quantum walks in quantum communication protocols.
5
Zhou, Nan-Run, Hu-Lai Cheng, Li-Hua Gong, and Chi-Sheng Li. "Three-Party Quantum Network Communication Protocols Based on Quantum Teleportation." International Journal of Theoretical Physics 53, no. 4 (December 13, 2013): 1387–403. http://dx.doi.org/10.1007/s10773-013-1936-1.
APPN Editorial Team. "Highlights from the Asia Pacific Region." Asia Pacific Physics Newsletter 03, no. 01 (February 2014): 28–38. http://dx.doi.org/10.1142/s2251158x14000083.
The laws of quantum mechanics enable optical communications with the ultimate capacity and quantum computers to solve certain problems with unprecedented speed. A key ingredient in such quantum information processing is quantum teleportation: the act of transferring quantum information from a sender to a spatially distant receiver by utilizing shared entanglement and classical communications. For example, optical quantum teleportation is essential for various quantum communication protocols. Quantum logic gates based on optical quantum teleportation are one of the building blocks of optical quantum computers.
7
PATHAK, ANIRBAN, and ANINDITA BANERJEE. "EFFICIENT QUANTUM CIRCUITS FOR PERFECT AND CONTROLLED TELEPORTATION OF n-QUBIT NON-MAXIMALLY ENTANGLED STATES OF GENERALIZED BELL-TYPE." International Journal of Quantum Information 09, supp01 (January 2011): 389–403. http://dx.doi.org/10.1142/s0219749911007368.
An efficient and economical scheme is proposed for the perfect quantum teleportation of n-qubit non-maximally entangled state of generalized Bell-type. A Bell state is used as the quantum channel in the proposed scheme. It is also shown that the controlled teleportation of this n-qubit state can be achieved by using a GHZ state or a GHZ-like state as quantum channel. The proposed schemes are economical because for the perfect and controlled teleportation of n-qubit non-maximally entangled state of generalized Bell-type, we only need a Bell state and a tripartite entangled state respectively. It is also established that there exists a family of 12 orthogonal tripartite GHZ-like states which can be used as quantum channel for controlled teleportation. The proposed protocols are critically compared with the existing protocols.
8
de Silva, Nadish. "Efficient quantum gate teleportation in higher dimensions." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 477, no. 2251 (July 2021): 20200865. http://dx.doi.org/10.1098/rspa.2020.0865.
The Clifford hierarchy is a nested sequence of sets of quantum gates critical to achieving fault-tolerant quantum computation. Diagonal gates of the Clifford hierarchy and ‘nearly diagonal’ semi-Clifford gates are particularly important: they admit efficient gate teleportation protocols that implement these gates with fewer ancillary quantum resources such as magic states. Despite the practical importance of these sets of gates, many questions about their structure remain open; this is especially true in the higher-dimensional qudit setting. Our contribution is to leverage the discrete Stone–von Neumann theorem and the symplectic formalism of qudit stabilizer theory towards extending the results of Zeng et al . (2008) and Beigi & Shor (2010) to higher dimensions in a uniform manner. We further give a simple algorithm for recursively enumerating all gates of the Clifford hierarchy, a simple algorithm for recognizing and diagonalizing semi-Clifford gates, and a concise proof of the classification of the diagonal Clifford hierarchy gates due to Cui et al . (2016) for the single-qudit case. We generalize the efficient gate teleportation protocols of semi-Clifford gates to the qudit setting and prove that every third-level gate of one qudit (of any prime dimension) and of two qutrits can be implemented efficiently. Numerical evidence gathered via the aforementioned algorithms supports the conjecture that higher-level gates can be implemented efficiently.
9
Laurenza, Riccardo, Cosmo Lupo, Gaetana Spedalieri, Samuel L. Braunstein, and Stefano Pirandola. "Channel Simulation in Quantum Metrology." Quantum Measurements and Quantum Metrology 5, no. 1 (March 1, 2018): 1–12. http://dx.doi.org/10.1515/qmetro-2018-0001.
Abstract In this review we discuss how channel simulation can be used to simplify the most general protocols of quantum parameter estimation, where unlimited entanglement and adaptive joint operations may be employed. Whenever the unknown parameter encoded in a quantum channel is completely transferred in an environmental program state simulating the channel, the optimal adaptive estimation cannot beat the standard quantum limit. In this setting, we elucidate the crucial role of quantum teleportation as a primitive operation which allows one to completely reduce adaptive protocols over suitable teleportation-covariant channels and derive matching upper and lower bounds for parameter estimation. For these channels,wemay express the quantum Cramér Rao bound directly in terms of their Choi matrices. Our review considers both discrete- and continuous-variable systems, also presenting some new results for bosonic Gaussian channels using an alternative sub-optimal simulation. It is an open problem to design simulations for quantum channels that achieve the Heisenberg limit.
10
Cardoso-Isidoro, Carlos, and Francisco Delgado. "Shared Quantum Key Distribution Based on Asymmetric Double Quantum Teleportation." Symmetry 14, no. 4 (April 1, 2022): 713. http://dx.doi.org/10.3390/sym14040713.
Quantum cryptography is a well-stated field within quantum applications where quantum information is used to set secure communications, authentication, and secret keys. Now used in quantum devices with those purposes, particularly Quantum Key Distribution (QKD), which proposes a secret key between two parties free of effective eavesdropping, at least at a higher level than classical cryptography. The best-known quantum protocol to securely share a secret key is the BB84 one. Other protocols have been proposed as adaptations of it. Most of them are based on the quantum indeterminacy for non-orthogonal quantum states. Their security is commonly based on the large length of the key. In the current work, a BB84-like procedure for QKD based on double quantum teleportation allows the sharing of the key statement using several parties. Thus, the quantum bits of information are assembled among three parties via entanglement, instead of travelling through a unique quantum channel as in the traditional protocol. Asymmetry in the double teleportation plus post-measurement retains the secrecy in the process. Despite requiring more complex control and resources, the procedure dramatically reduces the probability of success for an eavesdropper under individual attacks, because of the ignorance of the processing times in the procedure. Quantum Bit Error Rate remains in the acceptable threshold and it becomes configurable. The article depicts the double quantum teleportation procedure, the associated control to introduce the QKD scheme, the analysis of individual attacks performed by an eavesdropper, and a brief comparison with other protocols.
Thesis (BSc. (Hons))--Australian National University, 2002. Available via the Australian National University Library Electronic Pre and Post Print Repository. Title from title screen (viewed Mar. 28, 2003). "A thesis submitted for the degree of Bachelor of Science in Physics, The Australian National University" Bibliography: p. 77-80.
2
Avveduti, Silvia. "Analysis of multi-hop Teleportation Protocols for Quantum Networks." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/19934/.
Quantum mechanics for computation and information purposes has seen a burst of interest in the scientific community and companies, due to the potential unique computational power offered by quantum computers, not achievable through classical computers. In particular two technologies are used in most quantum computers, which are the trapped ions and artificial atoms, but many different technologies are currently being studied for the physical implementation of quantum information systems. Quantum computers are challenging to build, because the element which represents information, the qubit, requires strict conditions such as isolation from the environment and a very refined control. Moreover, qubits cannot intrinsically reject noise as classical bits do. This thesis is organized as follows. In Chapter 2 the essential concepts for Quantum Computation and Information are introduced; in Chapter 3 an overview of the main applications is displayed; in Chapter 4 the current results in entanglement and teleportation in Quantum Network protocols are shown. The experimental outcomes obtained in IBM Q are discussed in Chapter 5. Finally, Chapter 6 contains the conclusions.
3
Strelchuk, Sergii. "Superactivation of the channel capacity and teleportation protocols in quantum information theory." Thesis, University of Cambridge, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.648259.
The continuous variables regime offers much promise for quantum information and computation protocols. In particular, the continuous variable polarisation teleportation is of great interest, both theoretically and experimentally, at the moment.
In this thesis three schemes for continuous variable polarisation teleportation are analysed and their performance is rated. The double teleporter setup, the quantum nondemolition teleporter scheme and the biased entanglement teleporter setup are each discussed and evaluated. Two methods are employed for the evaluation of the teleportation success. The TV diagram which stresses the usefulness of the experimental design and the fidelity, which measures the quantum input to output state preservation. It is later shown that these two independent assessments, which consider physically different attributes, yield contradicting conclusions. Further it is shown that it is important to decide whether the objective of the polarisation teleportation is the transfer of information or the quantum state recreation before meaningful analysis using TV or fidelity can be made.
Finally, a study of a special cloning limit for a particular input state is made, related to the two of the above polarisation teleportation schemes. A new cloning fidelity limit is derived for these cases and TV cloning limits of information transfer and correlations are discussed.
Books on the topic "Quantum polarisation teleportation protocols":
1
Heunen, Chris, and Jamie Vicary. Categories for Quantum Theory. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780198739623.001.0001.
Monoidal category theory serves as a powerful framework for describing logical aspects of quantum theory, giving an abstract language for parallel and sequential composition and a conceptual way to understand many high-level quantum phenomena. Here, we lay the foundations for this categorical quantum mechanics, with an emphasis on the graphical calculus that makes computation intuitive. We describe superposition and entanglement using biproducts and dual objects, and show how quantum teleportation can be studied abstractly using these structures. We investigate monoids, Frobenius structures and Hopf algebras, showing how they can be used to model classical information and complementary observables. We describe the CP construction, a categorical tool to describe probabilistic quantum systems. The last chapter introduces higher categories, surface diagrams and 2-Hilbert spaces, and shows how the language of duality in monoidal 2-categories can be used to reason about quantum protocols, including quantum teleportation and dense coding. Previous knowledge of linear algebra, quantum information or category theory would give an ideal background for studying this text, but it is not assumed, with essential background material given in a self-contained introductory chapter. Throughout the text, we point out links with many other areas, such as representation theory, topology, quantum algebra, knot theory and probability theory, and present nonstandard models including sets and relations. All results are stated rigorously and full proofs are given as far as possible, making this book an invaluable reference for modern techniques in quantum logic, with much of the material not available in any other textbook.
2
Zubairy, M. Suhail. Quantum Mechanics for Beginners. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198854227.001.0001.
Quantum mechanics is a highly successful yet a mysterious theory. Quantum Mechanics for Beginners provides an introduction of this fascinating subject to someone with only a high school background in physics and mathematics. This book, except the last chapter on the Schrödinger equation, is entirely algebra-based. A major strength of this book is that, in addition to the foundation of quantum mechanics, it provides an introduction to the fields of quantum communication and quantum computing. The topics covered include wave–particle duality, the Heisenberg uncertainty relation, Bohr’s principle of complementarity, quantum superposition and entanglement, Schrödinger’s cat, Einstein–Podolsky–Rosen paradox, Bell theorem, quantum no-cloning theorem and quantum copying, quantum eraser and delayed choice, quantum teleportation, quantum key distribution protocols such as BB-84 and B-92, counterfactual communication, quantum money, quantum Fourier transform, quantum computing protocols including Shor and Grover algorithms, quantum dense coding, and quantum tunneling. All these topics and more are explained fully but using only elementary mathematics. Each chapter is followed by a short list of references and some exercises. This book is meant for an advanced high school student and a beginning college student and can be used as a text for a one semester course at the undergraduate level. However it can also be a useful and accessible book for those who are not familiar but want to learn some of the fascinating recent and ongoing developments in areas related to the foundations of quantum mechanics and its applications to quantum communication and quantum computing.
Book chapters on the topic "Quantum polarisation teleportation protocols":
1
Kaye, Phillip, Raymond Laflamme, and Michele Mosca. "Superdense Coding and Quantum Teleportation." In An Introduction to Quantum Computing. Oxford University Press, 2006. http://dx.doi.org/10.1093/oso/9780198570004.003.0008.
We are now ready to look at our first protocols for quantum information. In this section, we examine two communication protocols which can be implemented using the tools we have developed in the preceding sections. These protocols are known as superdense coding and quantum teleportation. Both are inherently quantum: there are no classical protocols which behave in the same way. Both involve two parties who wish to perform some communication task between them. In descriptions of such communication protocols (especially in cryptography), it is very common to name the two parties ‘Alice’ and ‘Bob’, for convenience. We will follow this tradition. We will repeatedly refer to communication channels. A quantum communication channel refers to a communication line (e.g. a fiberoptic cable), which can carry qubits between two remote locations. A classical communication channel is one which can carry classical bits (but not qubits).1 The protocols (like many in quantum communication) require that Alice and Bob initially share an entangled pair of qubits in the Bell state The above Bell state is sometimes referred to as an EPR pair. Such a state would have to be created ahead of time, when the qubits are in a lab together and can be made to interact in a way which will give rise to the entanglement between them. After the state is created, Alice and Bob each take one of the two qubits away with them. Alternatively, a third party could create the EPR pair and give one particle to Alice and the other to Bob. If they are careful not to let them interact with the environment, or any other quantum system, Alice and Bob’s joint state will remain entangled. This entanglement becomes a resource which Alice and Bob can use to achieve protocols such as the following. Suppose Alice wishes to send Bob two classical bits of information. Superdense coding is a way of achieving this task over a quantum channel, requiring only that Alice send one qubit to Bob. Alice and Bob must initially share the Bell state Suppose Alice is in possession of the first qubit and Bob the second qubit.
2
Rau, Jochen. "Communication." In Quantum Theory, 223–60. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780192896308.003.0005.
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.
3
Guha Majumdar, Mrittunjoy. "Can We Entangle Entanglement?" In Topics on Quantum Information Science [Working Title]. IntechOpen, 2021. http://dx.doi.org/10.5772/intechopen.98535.
In this chapter, nested multilevel entanglement is formulated and discussed in terms of Matryoshka states. The generation of such states that contain nested patterns of entanglement, based on an anisotropic XY model has been proposed. Two classes of multilevel-entanglement- the Matryoshka Q-GHZ states and Matryoshka generalised GHZ states, are studied. Potential applications of such resource states, such as for quantum teleportation of arbitrary one, two and three qubits states, bidirectional teleportation of arbitrary two qubit states and probabilistic circular controlled teleportation are proposed and discussed, in terms of a Matryoshka state over seven qubits. We also discuss fractal network protocols, surface codes and graph states as well as generation of arbitrary entangled states at remote locations in this chapter.
4
Kaye, Phillip, Raymond Laflamme, and Michele Mosca. "Introduction and Background." In An Introduction to Quantum Computing. Oxford University Press, 2006. http://dx.doi.org/10.1093/oso/9780198570004.003.0004.
A computer is a physical device that helps us process information by executing algorithms. An algorithm is a well-defined procedure, with finite description, for realizing an information-processing task. An information-processing task can always be translated into a physical task. When designing complex algorithms and protocols for various information-processing tasks, it is very helpful, perhaps essential, to work with some idealized computing model. However, when studying the true limitations of a computing device, especially for some practical reason, it is important not to forget the relationship between computing and physics. Real computing devices are embodied in a larger and often richer physical reality than is represented by the idealized computing model. Quantum information processing is the result of using the physical reality that quantum theory tells us about for the purposes of performing tasks that were previously thought impossible or infeasible. Devices that perform quantum information processing are known as quantum computers. In this book we examine how quantum computers can be used to solve certain problems more efficiently than can be done with classical computers, and also how this can be done reliably even when there is a possibility for errors to occur. In this first chapter we present some fundamental notions of computation theory and quantum physics that will form the basis for much of what follows. After this brief introduction, we will review the necessary tools from linear algebra in Chapter 2, and detail the framework of quantum mechanics, as relevant to our model of quantum computation, in Chapter 3. In the remainder of the book we examine quantum teleportation, quantum algorithms and quantum error correction in detail. We are often interested in the amount of resources used by a computer to solve a problem, and we refer to this as the complexity of the computation. An important resource for a computer is time. Another resource is space, which refers to the amount of memory used by the computer in performing the computation. We measure the amount of a resource used in a computation for solving a given problem as a function of the length of the input of an instance of that problem.
5
Vedral, Vlatko. "Destruction ab Toto: Nothing from Something." In Decoding Reality. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198815433.003.0020.
The main view promoted by this book is that underlying many different aspects of reality is some form of information processing. The theory of information started rather innocently, as the result of a very specific question that Shannon considered, which was how to maximize the capacity of communication between two users. Shannon showed that all we need is to associate a probability to an event, and defined a metric that allowed you to quantify the information content of that event. Interestingly, because of its simplicity and intuitiveness, Shannon’s views have been successfully applied to many other problems. We can view biological information through Shannon’s theory as a communication in time (where the objective of natural selection is to propagate the gene pool into the future). But it is not only that communications and biology are trying to optimize information. In physics, systems arrange themselves so that entropy is maximized, and this entropy is quantified in the same way as Shannon’s information. We encounter the same form of information in other phenomena. Financial speculation is also governed by the same concept of entropy, and optimizing your profit is the same problem as optimizing your channel capacity. In social theory, society is governed by its interconnectedness or correlation and this correlation itself is quantified by Shannon’s entropy. Underlying all these phenomena was the classical Boolean logic where events had clear outcomes, either yes or no, on or off, and so on. In our most accurate description of reality, given by quantum theory, we know that bits of information are an approximation to a much more precise concept of qubits. Qubits, unlike bits, can exist in a multitude of states, any combination of yes and no, on and off. Shannon’s information theory has been extended to account for quantum theory and the resulting framework, quantum information theory, has already shown a number of advantages. The greater power of quantum information theory is manifested in more secure cryptographic protocols, a completely new order of computing, quantum teleportation, and a number of other applications that were simply not possible according to Shannon’s view.
Conference papers on the topic "Quantum polarisation teleportation protocols":
1
Darras, Tom, Adrien Cavailles, Hanna Le Jeannic, Huazhuo Dong, Beate Asenbeck, Giovanni Guccione, and Julien Laurat. "Hybrid Teleportation Protocols for Heterogeneous Quantum Networks." In 2021 Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC). IEEE, 2021. http://dx.doi.org/10.1109/cleo/europe-eqec52157.2021.9542430.
Kamalov, N., and A. Klinskikh. "QUANTUM REPEATERS IN QUANTUM COMMUNICATION SYSTEMS." In PHYSICAL BASIS OF MODERN SCIENCE-INTENSIVE TECHNOLOGIES. FSBE Institution of Higher Education Voronezh State University of Forestry and Technologies named after G.F. Morozov, 2022. http://dx.doi.org/10.34220/pfmsit2022_95-100.
The paper considers the architecture of a quantum repeater based on the phenomenon of quantum teleportation with the implementation of the most entangled Bell states. Algorithms for quantum purification according to the Bennett and Deutsch protocols are given. As a result, a quantum repeater scheme with three nodes and entanglement exchange operations has been implemented. Quantum signals were simulated using the Qiskit package.
