Relevant bibliographies by topics / Superdense coding

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Superdense coding'

Author: Grafiati
Published: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Superdense coding.'

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 "Superdense coding"

1

SHANG-GUAN, LI-YING, HONG-XIANG SUN, XIU-BO CHEN, HENG-YUE JIA, QIAO-YAN WEN, and FU-CHEN ZHU. "PERFECT TELEPORTATION, SUPERDENSE CODING VIA A KIND OF W-CLASS STATE." International Journal of Quantum Information 08, no. 08 (December 2010): 1411–20. http://dx.doi.org/10.1142/s0219749910006964.

Full text
Abstract:
Perfect teleportation and superdense coding are discussed via a special kind of W-state. It is shown that the state can be used for perfect teleportation of the state x|0〉⊗N + y|1〉⊗N. And the state can be utilized for superdense coding. Moreover, it is demonstrated that the sender can transmit N classical bits to the receiver by sending N − 1 qubits.
APA, Harvard, Vancouver, ISO, and other styles
2

Abeyesinghe, A., P. Hayden, G. Smith, and A. J. Winter. "Optimal Superdense Coding of Entangled States." IEEE Transactions on Information Theory 52, no. 8 (August 2006): 3635–41. http://dx.doi.org/10.1109/tit.2006.878174.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Yang, Wei, Liusheng Huang, An Liu, Miaomiao Tian, and Haibo Miao. "Quantum–classical hybrid quantum superdense coding." Physica Scripta 88, no. 1 (June 25, 2013): 015009. http://dx.doi.org/10.1088/0031-8949/88/01/015009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tao, Qin, Feng Mang, and Gao Ke-Lin. "Superdense Coding via Hot Trapped Ions." Communications in Theoretical Physics 41, no. 6 (June 15, 2004): 871–74. http://dx.doi.org/10.1088/0253-6102/41/6/871.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Dunningham, Jacob A. "Superdense coding with single-particle entanglement." Journal of Russian Laser Research 30, no. 5 (September 2009): 427–34. http://dx.doi.org/10.1007/s10946-009-9101-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhao, Rui-Tong, Qi Guo, Li Chen, Hong-Fu Wang, and Shou Zhang. "Quantum superdense coding based on hyperentanglement." Chinese Physics B 21, no. 8 (August 2012): 080303. http://dx.doi.org/10.1088/1674-1056/21/8/080303.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Farahmand, Mehrnoosh, Hosein Mohammadzadeh, Hossein Mehri-Dehnavi, and Robabeh Rahimi. "Superdense Coding with Uniformly Accelerated Particle." International Journal of Theoretical Physics 56, no. 3 (December 12, 2016): 706–19. http://dx.doi.org/10.1007/s10773-016-3212-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zhou, You-Sheng, Feng Wang, and Ming-Xing Luo. "Efficient Superdense Coding with W States." International Journal of Theoretical Physics 57, no. 7 (March 20, 2018): 1935–41. http://dx.doi.org/10.1007/s10773-018-3718-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Li, Yan–Ling, Dong–Mei Wei, Chuan–Jin Zu, and Xing Xiao. "Enhanced Superdense Coding Over Correlated Amplitude Damping Channel." Entropy 21, no. 6 (June 16, 2019): 598. http://dx.doi.org/10.3390/e21060598.

Full text
Abstract:
Quantum channels with correlated effects are realistic scenarios for the study of noisy quantum communication when the channels are consecutively used. In this paper, superdense coding is reexamined under a correlated amplitude damping (CAD) channel. Two techniques named as weak measurement and environment-assisted measurement are utilized to enhance the capacity of superdense coding. The results show that both of them enable us to battle against the CAD decoherence and improve the capacity with a certain probability. Remarkably, the scheme of environment-assisted measurement always outperforms the scheme of weak measurement in both improving the capacity and successful probability. These notable superiorities could be attributed to the fact that environment-assisted measurement can extract additional information from the environment and thus it performs much better.
APA, Harvard, Vancouver, ISO, and other styles
10

Guo-Zhu, Pan, Yang Ming, and Cao Zhuo-Liang. "Quantum superdense coding via cavity-assisted interactions." Chinese Physics B 18, no. 6 (June 2009): 2319–23. http://dx.doi.org/10.1088/1674-1056/18/6/034.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Superdense coding"

1

Raina, Ankur. "Protocols for quantum information processing on graph states." Thesis, 2019. https://etd.iisc.ac.in/handle/2005/5053.

Full text
Abstract:
Quantum entanglement is a unique phenomenon that occurs in quantum systems and ensures the feasibility of tasks considered impossible in the classical world. Two such important tasks are superdense coding and quantum teleportation. The strength of these protocols rests on the availability of entangled quantum states, such as the bipartite Bell states. When entanglement is shared among many systems, it gives rise to a richer class of multipartite entangled states. One of the popular multipartite quantum states that are successfully prepared by experimentalists are the graph states. Construction of graph states is as follows: Every node has a qubit and the nodes are connected by edges. All the qubits are initially prepared in the so-called $\ket{+}$ state. All the qubits are entangled using controlled-Z (CZ) operations between every pair of qubits that have an edge in the original graph. In our work, we restrict our study to graph states. In this thesis, we discuss our contribution of quantum information processing protocols using graph states that includes: 1) Recovery from a quantum erasure: We consider the problem of a node failure occurring in a network modeled by a graph. By describing the loss of a qubit due to the failure of a node as a quantum erasure, we present a recovery mechanism for distributed quantum information using purification followed by an error correction procedure. 2) Eavesdropping on the graph state: An eavesdropper uses probe qubits and entangles them with the qubits of the graph state via unitary operations. Following the unitary interaction, the eavesdropper performs measurement on the probe qubits. We investigate the behavior of mutual information between the source and the eavesdropper and that between the source and the destination. We define the disturbance caused to the original graph state and study the efficacy of entanglement. We also come up with a scheme to detect the presence of the eavesdropper and recover from the disturbance caused to the graph state using ideas from coding theory. 3) Quantum channels on a graph state: Measurement based quantum computing is an alternative way of quantum information processing that describes the unitary evolution of a quantum state using the cluster state and well-defined measurements. We use the measurement based quantum computing (MBQC) formalism to describe memoryless quantum channels between any two nodes of a network and also come up with the expressions of the capacity of transmission.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Superdense coding"

1

Westfall, Lewis, and Avery Leider. "SuperDense Coding Step by Step." In Lecture Notes in Networks and Systems, 357–72. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-12385-7_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hidary, Jack D. "Teleportation, Superdense Coding and Bell’s Inequality." In Quantum Computing: An Applied Approach, 81–93. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-23922-0_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hidary, Jack D. "Teleportation, Superdense Coding and Bell’s Inequality." In Quantum Computing: An Applied Approach, 87–99. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-83274-2_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

"Superdense Coding." In Nonequilibrium Quantum Transport Physics in Nanosystems, 680–86. WORLD SCIENTIFIC, 2009. http://dx.doi.org/10.1142/9789812835376_0050.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
6

"Quantum teleportation and superdense coding." In Elements of Quantum Computation and Quantum Communication, 257–82. CRC Press, 2013. http://dx.doi.org/10.1201/b15007-11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Flarend, Alice, and Bob Hilborn. "Quantum Circuits and Multi-Qubit Applications." In Quantum Computing: From Alice to Bob, 135–58. Oxford University Press, 2022. http://dx.doi.org/10.1093/oso/9780192857972.003.0010.

Full text
Abstract:
The devices that carry out manipulations on qubit states are called quantum circuits, built from collections of quantum gates. Alice and Bob describe several two-qubit quantum gates and illustrate their actions on quantum states. They show that it is impossible to clone an unknown quantum state—the so-called No-Cloning Theorem. That theorem severely limits an eavesdropper’s ability to listen in on quantum communications without being detected. Alice and Bob then introduce and explain in detail two quantum communications algorithms: Superdense Coding (transmitting two bits of classical information with only one qubit) and Quantum State Teleportation (the ability to send enough information over a long distance to reconstruct a quantum state). Each of these applications highlights the book’s leitmotif of state preparation, state manipulation, and state measurement.
APA, Harvard, Vancouver, ISO, and other styles
8

Rau, Jochen. "Communication." In Quantum Theory, 223–60. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780192896308.003.0005.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Superdense coding"

1

Geru, Ion. "Superdense Coding of Information in Quantum Computer in the Paired Bosons Representation." In 11th International Conference on Electronics, Communications and Computing. Technical University of Moldova, 2022. http://dx.doi.org/10.52326/ic-ecco.2021/tap.04.

Full text
Abstract:
An alternative approach to superdense coding of information in quantum computing is proposed on the basis of Schwinger’s two-boson representation of angular momentum. Since the effective spin S = 2n-1 - ½ corresponds to the n-qubit system, this representation can be used in the quantum computing. Operators of the logical elements of the quantum circuit were found, performing superdense coding of information in the paired bosons representation. It is shown that for superdense coding of information, the results obtained in the spinor representation and in the representation of paired bosons coincide. For one-qubit systems, one of the two representations cannot be favored. In the case of n-qubit systems for n >> 1, the representation of paired bosons is probably more convenient for applications, since in this representation the explicit form of the Pauli operators X, Y, and Z does not depend on n.
APA, Harvard, Vancouver, ISO, and other styles
2

Sadlier, Ronald J., Travis S. Humble, and Brian P. Williams. "Superdense coding for quantum networking environments." In Advances in Photonics of Quantum Computing, Memory, and Communication XI, edited by Zameer U. Hasan, Philip R. Hemmer, Alan L. Migdall, and Alan E. Craig. SPIE, 2018. http://dx.doi.org/10.1117/12.2295016.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bezzateev, S. V., S. G. Fomicheva, and G. A. Zhemelev. "Quantum Control Mechanisms of Superdense Coding." In 2022 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF). IEEE, 2022. http://dx.doi.org/10.1109/weconf55058.2022.9803617.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zamir, Nida, Muhammad Fasih Uddin Butt, Zunaira Babar, and Soon Xin Ng. "Secure Quantum Turbo Coded Superdense Coding Scheme." In 2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC). IEEE, 2018. http://dx.doi.org/10.1109/pimrc.2018.8580740.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Guo, Ying, and Moon Ho Lee. "Quantum Secure Direct Intercommunication with Superdense Coding." In 2008 International Conference on Security Technology (SECTECH). IEEE, 2008. http://dx.doi.org/10.1109/sectech.2008.54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mao, Duolu, Guoqing Jia, and Haiqin Li. "Probabilistic Superdense Coding Based on the Mixed Entangled State." In 2014 6th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC). IEEE, 2014. http://dx.doi.org/10.1109/ihmsc.2014.152.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gawand, Nilambari, Mayssaa El Rifai, Gregory MacDonald, and Pramode K. Verma. "Superdense Coding for Dual-Quantum Channel Quantum Key Distribution." In Quantum Information and Measurement. Washington, D.C.: OSA, 2013. http://dx.doi.org/10.1364/qim.2013.w6.46.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Smith, James F. "Superdense coding facilitated by hyper-entanglement and quantum networks." In SPIE Defense + Security, edited by Michael K. Rafailov. SPIE, 2017. http://dx.doi.org/10.1117/12.2261686.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Berces, Marton, and Sandor Imre. "Extension and analysis of modified superdense-coding in multi-user environment." In 2015 IEEE 19th International Conference on Intelligent Engineering Systems (INES). IEEE, 2015. http://dx.doi.org/10.1109/ines.2015.7329723.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pavičić, Mladen. "New Near-Deterministic All-Optical Teleportation, Superdense Coding, and Cryptography Scheme." In Quantum Information and Measurement. Washington, D.C.: OSA, 2012. http://dx.doi.org/10.1364/qim.2012.qt4a.5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Superdense coding' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography