output
20192023
most citedQuantum computational advantage using photons

2.3k citations

Showing quant-phShow all

7 papers · 1 filter

quant-ph20251 cited

Speeding up adiabatic holonomic quantum gates via -pulse modulation

Jiang Zhang, Tonghao Xing, Guilu Long

Holonomic quantum computation (HQC) offers an inherently robust approach to quantum gate implementation by exploiting quantum holonomies. While adiabatic HQC benefits from robustne…

quant-ph202313 cited

Single-Photon-Memory Measurement-Device-Independent Quantum Secure Direct Communication -- Part I: Its Fundamentals and Evolution

Xiang-Jie Li, Dong Pan, Gui-Lu Long +1

Quantum secure direct communication (QSDC) has attracted a lot of attention, which exploits deep-rooted quantum physical principles to guarantee unconditional security of communica…

quant-ph202121 cited

Maximum Relative Entropy of Coherence for Quantum Channels

Zhi-Xiang Jin, Long-Mei Yang, Shao-Ming Fei +4

Based on the resource theory for quantifying the coherence of quantum channels, we introduce a new coherence quantifier for quantum channels via maximum relative entropy. We prove…

quant-ph202126 cited

Stable States with Non-Zero Entropy under Broken -Symmetry

Jingwei Wen, Chao Zheng, Zhangdong Ye +2

The -symmetric non-Hermitian systems have been widely studied and explored both in theory and in experiment these years due to various interesting features. In this w…

quant-ph20202.3k cited

Quantum computational advantage using photons

Han-Sen Zhong, Hui Wang, Yu-Hao Deng +21

Gaussian boson sampling exploits squeezed states to provide a highly efficient way to demonstrate quantum computational advantage. We perform experiments with 50 input single-mode…

quant-ph2020124 cited

Experimental free-space quantum secure direct communication and its security analysis

Dong Pan, Zaisheng Lin, Jiawei Wu +4

We report an experimental implementation of free-space quantum secure direct communication based on single photons. The quantum communication scheme uses phase encoding, and the as…