Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

中国科学通报：英文版

Complete multiple round quantum dense coding with quantum logical network

LI ., Chunyan, XiHan, Deng, Fu-Guo, Zhou Zhou, Ping Ping, Hongyu

Published Jan 1, 2007• 0 citations
OpenAlex

Abstract

我们在场为改进那的来源能力的稠密的编码计划最近由张等介绍了的完全的多重圆量。接收装置为在每个回合存储四本地单一的操作诉诸二 qubits。量纠纷提供一些新奇方法播送并且处理量信息，例如它介绍的量计算和量通讯一个量系统的非地区。就算他们是差距很大的，由量系统组成的二个分系统不能被认为独立。二个分系统上的任何测量不能独立关于量系统给所有信息。量纠纷广泛地在量计算和量通讯被使用了，例如量稠密的编码，量钥匙分发，量安全直接通讯，并且量秘密分享。

Related papers

Complete multiple round quantum dense coding with quantum logical network

Chunyan Li, Xihan Li, Fu‐Guo Deng +2 more

Chinese Science Bulletin•May 1, 2007•17 citations

Implementation of a multiple round quantum dense coding using nuclear magnetic resonance

Jingfu ZHANG

•Jan 1, 2005•8 citations

Implementation of a multiple round quantum dense coding using nuclear magnetic resonance

Jingfu Zhang, Jingyi Xie, Chuan Xi Wang +3 more

Science China Physics Mechanics and Astronomy•Nov 1, 2005•5 citations

Implementation of a multiple round quantum dense coding using nuclear magnetic resonance

Jingfu Zhang, Jingyi Xie, Chuan Xi Wang +3 more

Science in China. Series G, Physics, mechanics & astronomy/Science in China. Series G, Physics, Mechanics & Astronomy•Mar 1, 2005•0 citations

Multiple Round Quantum Dense Coding And Its Implementation Using Nuclear Magnetic Resonance

Jingfu Zhang, Jingyi Xie, Chuan Xi Wang +3 more

A multiple round quantum dense coding (MRQDC) scheme based on the quantum phase estimation algorithm is proposed. Using an $m+1$ qubit system, Bob can transmit $2^{m+1}$ messages to Alice, through manipulating only one qubit and exchanging it between Alice and Bob for $m$ rounds. The information capacity is enhanced to $m+1$ bits. We have implemented the scheme in a three- qubit nuclear magnetic resonance (NMR) quantum computer. The experimental results show a good agreement between theory and experiment.

arXiv:quant-ph/0407104•Jul 14, 2004•0 citations

Dense packing of the surface code: code deformation procedures and hook-error-avoiding gate scheduling

Kohei Fujiu, Shota Nagayama, Shin Nishio +2 more

The surface code is one of the leading quantum error correction codes for realizing large-scale fault-tolerant quantum computing (FTQC). One major challenge in realizing surface-code-based FTQC is the extremely large number of qubits required. To mitigate this problem, fusing multiple codewords of the surface code into a densely packed configuration has been proposed. It is known that by using dense packing, the number of physical qubits required per logical qubit can be reduced to approximately three-fourths compared to simply placing surface-code patches side by side. Despite its potential, concrete deformation procedures and quantitative error-rate analyses have remained largely unexplored. In this work, we present a detailed code-deformation procedure that transforms multiple standard surface code patches into a densely packed, connected configuration, along with a conceptual microarchitecture to utilize this dense packing. We also propose a CNOT gate-scheduling for stabilizer measurement circuits that suppresses hook errors in the densely packed surface code. We performed circuit-level Monte Carlo noise simulation of densely packed surface codes using this gate scheduling. The numerical results demonstrate that as the code distance of the densely packed surface code increases and the physical error rate decreases, the logical error rate of the densely packed surface code becomes lower than that of the standard surface code. Furthermore, we find that only when employing hook-error-avoiding syndrome extraction can the densely packed surface code achieve a lower logical error rate than the standard surface code, while simultaneously reducing the space overhead.

quant-pharXiv:2511.06758•Physical Review A•Nov 11, 2025•0 citations
我们在场为改进那的来源能力的稠密的编码计划最近由张等介绍了的完全的多重圆量。接收装置为在每个回合存储四本地单一的操作诉诸二 qubits。量纠纷提供一些新奇方法播送并且处理量信息，例如它介绍的量计算和量通讯一个量系统的非地区。就算他们是差距很大的，由量系统组成的二个分系统不能被认为独立。二个分系统上的任何测量不能独立关于量系统给所有信息。量纠纷广泛地在量计算和量通讯被使用了，例如量稠密的编码，量钥匙分发，量安全直接通讯，并且量秘密分享。
A multiple round quantum dense coding (MRQDC) scheme based on the quantum phase estimation algorithm is proposed. Using an m+1m+1m+1 qubit system, Bob can transmit 2m+12^{m+1}2m+1 messages to Alice, through manipulating only one qubit and exchanging it between Alice and Bob for mmm rounds. The information capacity is enhanced to m+1m+1m+1 bits. We have implemented the scheme in a three- qubit nuclear magnetic resonance (NMR) quantum computer. The experimental results show a good agreement between theory and experiment.
The surface code is one of the leading quantum error correction codes for realizing large-scale fault-tolerant quantum computing (FTQC). One major challenge in realizing surface-code-based FTQC is the extremely large number of qubits required. To mitigate this problem, fusing multiple codewords of the surface code into a densely packed configuration has been proposed. It is known that by using dense packing, the number of physical qubits required per logical qubit can be reduced to approximately three-fourths compared to simply placing surface-code patches side by side. Despite its potential, concrete deformation procedures and quantitative error-rate analyses have remained largely unexplored. In this work, we present a detailed code-deformation procedure that transforms multiple standard surface code patches into a densely packed, connected configuration, along with a conceptual microarchitecture to utilize this dense packing. We also propose a CNOT gate-scheduling for stabilizer measurement circuits that suppresses hook errors in the densely packed surface code. We performed circuit-level Monte Carlo noise simulation of densely packed surface codes using this gate scheduling. The numerical results demonstrate that as the code distance of the densely packed surface code increases and the physical error rate decreases, the logical error rate of the densely packed surface code becomes lower than that of the standard surface code. Furthermore, we find that only when employing hook-error-avoiding syndrome extraction can the densely packed surface code achieve a lower logical error rate than the standard surface code, while simultaneously reducing the space overhead.