A Unitary Operator Construction Solution Based on Pauli Group for Maximal Dense Coding

Abstract

Quantum dense coding plays an important role in quantum cryptography communication, and how to select a set of appropriate unitary operators to encode message is the primary work in the design of quantum communication protocols. Shukla et al. proposed a preliminary method for unitary operator construction based on Pauli group under multiplication, which is used for dense coding in quantum dialogue. However, this method lacks feasible steps or conditions, and cannot construct all the possible unitary operator sets. In this study, a feasible solution of constructing unitary operator sets for quantum maximal dense coding is proposed, which aims to use minimum qubits to maximally encode a class of t-qubit symmetric states. These states have an even number of superposition items, and there is at least one set of t/2 qubits whose superposition items are orthogonal to each other. Firstly, we propose the procedure and the corresponding algorithm for constructing 2^t-order multiplicative modified generalized Pauli subgroups (multiplicative MGP subgroups). Then, two conditions for t-qubit symmetric states are given to select appropriate unitary operator sets from the above subgroups. Finally, we take 3-qubit GHZ, 4-qubit W, 4-qubit cluster and 5-qubit cluster states as examples, and demonstrate how to find all unitary operator sets for maximal dense coding through our construction solution, which shows that our solution is feasible and convenient.

arXiv comment20 pages, 5 figures

References in corpus (17)

• Quantum Machine Learning
• Quantum cryptography: Public key distribution and coin tossing
• Three qubits can be entangled in two inequivalent ways
• Quantum secret sharing
• Persistent entanglement in arrays of interacting particles
• How to share a quantum secret
• Observation of three-photon Greenberger-Horne-Zeilinger entanglement
• Experimental demonstration of long-distance continuous-variable quantum key distribution
• On the Theory of Quantum Secret Sharing
• Trading classical communication, quantum communication, and entanglement in quantum Shannon theory
• Quantum key distribution with quantum walks
• On the group theoretic structure of a class of quantum dialogue protocols
• An Efficient and Secure Arbitrary N-Party Quantum Key Agreement Protocol Using Bell States
• Efficient quantum direct communication with authentication
• A Unitary Weights Based One-Iteration Quantum Perceptron Algorithm for Non-Ideal Training Sets
• Quantum Relief Algorithm
• Improving the capacity of quantum dense coding by weak measurement and reversal measurement