English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Quantum dense coding plays an important role in quantum cryptographycommunication, and how to select a set of appropriate unitary operators toencode message is the primary work in the design of quantum communicationprotocols. Shukla et al. proposed a preliminary method for unitary operatorconstruction based on Pauli group under multiplication, which is used for densecoding in quantum dialogue. However, this method lacks feasible steps orconditions, and cannot construct all the possible unitary operator sets. Inthis study, a feasible solution of constructing unitary operator sets forquantum maximal dense coding is proposed, which aims to use minimum qubits tomaximally encode a class of t-qubit symmetric states. These states have an evennumber of superposition items, and there is at least one set of t/2 qubitswhose superposition items are orthogonal to each other. Firstly, we propose theprocedure and the corresponding algorithm for constructing 2^t-ordermultiplicative modified generalized Pauli subgroups (multiplicative MGPsubgroups). Then, two conditions for t-qubit symmetric states are given toselect appropriate unitary operator sets from the above subgroups. Finally, wetake 3-qubit GHZ, 4-qubit W, 4-qubit cluster and 5-qubit cluster states asexamples, and demonstrate how to find all unitary operator sets for maximaldense coding through our construction solution, which shows that our solutionis feasible and convenient.

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