Ming-Cheng Chen

Dr. Ming-Cheng Chen


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 September 2024 in National Science Review
Verified
Journal Article
Open access
PDF file
XZXian-He Zhao
Xian-He Zhao
HZHan-Sen Zhong
Han-Sen Zhong
FPFeng Pan
Feng Pan
ZCZi-Han Chen
Zi-Han Chen
RFRong Fu
Rong Fu
MCMing-Cheng Chen
Ming-Cheng Chen
Random quantum circuit sampling serves as a benchmark to demonstrate quantum computational advantage. Recent progress in classical algorithms, especially those based on tensor network methods, has significantly reduced the classical simulation time and challenged the claim of the first-generation quantum advantage experiments. However, in terms of generating uncorrelated samples, time-to-solution, and energy consumption, previous classical simulation experiments still underperform the Sycamore processor. Here we report an energy-efficient classical simulation algorithm, using 1432 GPUs to simulate quantum random circuit sampling which generates uncorrelated samples with higher linear cross entropy score and is 7 times faster than the Sycamore 53 qubits experiment. We propose a post-processing algorithm to reduce the overall complexity, and integrate state-of-the-art high-performance general-purpose GPU to achieve two orders of lower energy consumption compared to previous works. Our work provides the first unambiguous experimental evidence to refute Sycamore’s claim of quantum advantage, and redefines the boundary of quantum computational advantage using random circuit sampling.

3 July 2023 in Science Bulletin
Verified
Journal Article
Closed access
FLFeng-Ming Liu
Feng-Ming Liu
CWCan Wang
Can Wang
MCMing-Cheng Chen
Ming-Cheng Chen
HCHe Chen
He Chen
SLShao-Wei Li
Shao-Wei Li
JPJian-Wei Pan
Jian-Wei Pan

1 January 2024 in Acta Physica Sinica
Verified
Journal Article
Closed access
PDF file
CWCan Wang
Can Wang
CLChaoyang Lu
Chaoyang Lu
MCMing-Cheng Chen
Ming-Cheng Chen
Quantum computing can solve problems that are difficult to solve in classical computing, expanding the range of problems that can be effectively computed within the allowable range of classical physical principles, and posing a challenge to the extended Church-Turing thesis in classical computing. Here, we discuss an interesting question: how to achieve more powerful computers by breaking through the limitations of physical principles, further enhancing the capabilities of quantum computers. To extend quantum computing, novel operations related to relativistic physics are a crucial candidate. Among them, the concept of closed time-like curve has aroused widespread interest, and it introduces the ability for time travel. Mathematically, quantum state along the closed time-like curve is determined through self-consistent equations, which has been demonstrated in simulations. Here, we consider a novel manipulation capability that allows quantum computing to achieve time-travelling quantum control gate. This is an intuitive extension of the graphical language of quantum circuits. Explaining quantum circuits as tensor networks, we first explain how to experimentally simulate the output of such a circuit in a system without time-travel capability. Then, we take an example to demonstrate an extended quantum algorithm that can efficiently solve SAT problems, indicating that with the involvement of time-travelling quantum gates, the computational complexity class P = NP. We also anticipate that the time-travelling quantum gates will play a facilitating role in accomplishing other quantum tasks, including achieving deterministic non-orthogonal quantum state discrimination, and quantum state cloning. Our results contribute to a more in-depth understanding of the relationship between computation and physical principles.

15 January 2019 in arXiv
Verified
Preprint
Open access
PDF file
MCMing-Cheng Chen
Ming-Cheng Chen
RLRiling Li
Riling Li
LGLin Gan
Lin Gan
XZXiaobo Zhu
Xiaobo Zhu
GYGuangwen Yang
Guangwen Yang
JPJian-Wei Pan
Jian-Wei Pan
We show that low-depth random quantum circuits can be efficiently simulated by a quantum teleportation-inspired algorithm. By using logical qubits to redirect and teleport the quantum information in quantum circuits, the original circuits can be renormalized to new circuits with a smaller number of logical qubits. We demonstrate the algorithm to simulate several random quantum circuits, including 1D-chain 1000-qubit 42-depth, 2D-grid 125*8-qubit 42-depth and 2D-Bristlecone 72-qubit 32-depth circuits. Our results present a memory-efficient method with a clear physical picture to simulate low-depth random quantum circuits.

14 October 2024 in arXiv
Verified
Preprint
Open access
PDF file
YZYu-Chen Zhang
Yu-Chen Zhang
HCHao-Wen Cheng
Hao-Wen Cheng
ZZZhao-Qiu Zengxu
Zhao-Qiu Zengxu
ZWZhan Wu
Zhan Wu
RLRui Lin
Rui Lin
JPJian-Wei Pan
Jian-Wei Pan
In 1927, during the fifth Solvay Conference, Einstein and Bohr described a double-slit interferometer with a "movable slit" that can detect the momentum recoil of one photon. Here, we report a faithful realization of the Einstein-Bohr interferometer using a single atom in an optical tweezer, cooled to the motional ground state in three dimensions. The single atom has an intrinsic momentum uncertainty comparable to a single photon, which serves as a movable slit obeying the minimum Heisenberg uncertainty principle. The atom's momentum wavefunction is dynamically tunable by the tweezer laser power, which enables observation of an interferometric visibility reduction at a shallower trap, demonstrating the quantum nature of this interferometer. We further identify classical noise due to atom heating and precession, illustrating a quantum-to-classical transition.