Quick Navigation
Topics
Trapped Ion Quantum Computing
General Quantum Instruction for Communication via Maximally Entangled n-Qubit States
arXiv
Authors: Saba Arife Bozpolat
Year
2025
Paper ID
6079
Status
Preprint
Abstract Read
~2 min
Abstract Words
192
Citations
N/A
Abstract
This study presents a generalized n-bit superdense coding protocol that enables the transmission of n classical bits of information using an entangled n--qubit quantum system and the transmission of n-1 qubits. The protocol involves creating a maximally entangled n--qubit state, encoding the classical message with Pauli--Z and Pauli--X gates, and then transmitting and decoding the message via quantum communication, quantum operations, and measurements. The key novelty of this work lies in the proposed n--bit encoding routine, which, to the best of our knowledge, is the first explicit and scalable recipe for constructing quantum circuits for n--bit Superdense Coding, minimizing errors through a simple circuit design. The protocol was tested on real quantum hardware using Qiskit 2.0 and the IBM--Torino quantum computer for message lengths of 4, 6, 8, and 10 bits. Results show that success rates decrease as message length, circuit depth, and gate count increase, largely due to increased Pauli--X gate usage for messages with more "1" bits. Strategies to improve performance include sending messages in shorter segments and advances in qubit coherence and gate fidelity. This work offers a practical and easily scalable quantum communication instruction with potential applications in quantum networks and communication systems.
Why This Paper Matters
- This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
- It adds a 2025 reference point for readers tracking recent quantum research.
- This study presents a generalized n-bit superdense coding protocol that enables the transmission of n classical bits of information using an entangled n--qubit quantum system...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.