Chenfeng Cao

Chenfeng Cao

Auto-generated profile, based on publicly available information

Chenfeng Cao

The University of Hong Kong

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
6 May 2021 in Physical Review Applied
Verified
Journal Article
Closed access
PDF file
CCChenfeng Cao
Chenfeng Cao
XWXin Wang
Xin Wang
Quantum autoencoder is an efficient variational quantum algorithm for quantum data compression. However, previous quantum autoencoders fail to compress and recover high-rank mixed states. In this work, we discuss the fundamental properties and limitations of the standard quantum-autoencoder model in more depth, and provide an information-theoretic solution to its recovering fidelity. Based on this understanding, we present a noise-assisted quantum-autoencoder algorithm to go beyond the limitations, our model can achieve high recovering fidelity for general input states. Appropriate noise channels are used to make the input mixedness and output mixedness consistent, the noise setup is determined by measurement results of the trash system. Compared with the original quantum-autoencoder model, the measurement information is fully used in our algorithm. In addition to the circuit model, we design a (noise-assisted) adiabatic model of quantum autoencoder that can be implemented on quantum annealers. We verify the validity of our methods through compressing the thermal states of the transverse-field Ising model and Werner states. For pure-state ensemble compression, we also introduce a projected quantum-autoencoder algorithm.

1 April 2021 in Physical Review Research
Verified
Journal Article
Open access
PDF file
SCSONG CHENG
SONG CHENG
CCChenfeng Cao
Chenfeng Cao
CZChao Zhang
Chao Zhang
YLYongxiang Liu
Yongxiang Liu
SHShi-Yao Hou
Shi-Yao Hou
BZBei Zeng
Bei Zeng
Simulating quantum circuits with classical computers requires resources growing exponentially in terms of system size. Real quantum computer with noise, however, may be simulated polynomially with various methods considering different noise models. In this work, we simulate random quantum circuits in one dimension with matrix product density operators (MPDOs), for different noise models such as dephasing, depolarizing, and amplitude damping. We show that the method based on matrix product states (MPSs) fails to approximate the noisy output quantum states for any of the noise models considered, while the MPDO method approximates them well. Compared with the method of matrix product operators (MPOs), the MPDO method reflects a clear physical picture of noise (with inner indices taking care of the noise simulation) and quantum entanglement (with bond indices taking care of two-qubit gate simulation). Consequently, in case of weak system noise, the resource cost of the MPDO will be significantly less than that of the MPO due to a relatively small inner dimension needed for the simulation. In case of strong system noise, a relatively small bond dimension may be sufficient to simulate the noisy circuits, indicating a regime that the noise is large enough for an “easy” classical simulation, which is further supported by a comparison with the experimental results on an IBM cloud device. Moreover, we propose a more effective tensor updates scheme with optimal truncations for both the inner and the bond dimensions, performed after each layer of the circuit, which enjoys a canonical form of the MPDO for improving simulation accuracy. With truncated inner dimension to a maximum value κ and bond dimension to a maximum value χ, the cost of our simulation scales as ∼NDκ3χ3, for an N-qubit circuit with depth D.

14 March 2022 in Communications Physics
Verified
Journal Article
Open access
PDF file
CCChenfeng Cao
Chenfeng Cao
ZAZheng An
Zheng An
SHShi-Yao Hou
Shi-Yao Hou
DZD. L. Zhou
D. L. Zhou
BZBei Zeng
Bei Zeng
The quantum imaginary time evolution is a powerful algorithm for preparing the ground and thermal states on near-term quantum devices. However, algorithmic errors induced by Trotterization and local approximation severely hinder its performance. Here we propose a deep reinforcement learning-based method to steer the evolution and mitigate these errors. In our scheme, the well-trained agent can find the subtle evolution path where most algorithmic errors cancel out, enhancing the fidelity significantly. We verified the method’s validity with the transverse-field Ising model and the Sherrington-Kirkpatrick model. Numerical calculations and experiments on a nuclear magnetic resonance quantum computer illustrate the efficacy. The philosophy of our method, eliminating errors with errors, sheds light on error reduction on near-term quantum devices.

6 October 2022 in Quantum
Verified
Journal Article
Open access
PDF file
CCChenfeng Cao
Chenfeng Cao
CZChao Zhang
Chao Zhang
ZWZipeng Wu
Zipeng Wu
MGMarkus Grassl
Markus Grassl
BZBei Zeng
Bei Zeng
Quantum error correction is believed to be a necessity for large-scale fault-tolerant quantum computation. In the past two decades, various constructions of quantum error-correcting codes (QECCs) have been developed, leading to many good code families. However, the majority of these codes are not suitable for near-term quantum devices. Here we present VarQEC, a noise-resilient variational quantum algorithm to search for quantum codes with a hardware-efficient encoding circuit. The cost functions are inspired by the most general and fundamental requirements of a QECC, the Knill-Laflamme conditions. Given the target noise channel (or the target code parameters) and the hardware connectivity graph, we optimize a shallow variational quantum circuit to prepare the basis states of an eligible code. In principle, VarQEC can find quantum codes for any error model, whether additive or non-additive, degenerate or non-degenerate, pure or impure. We have verified its effectiveness by (re)discovering some symmetric and asymmetric codes, e.g., ((n,2n−6,3))2 for n from 7 to 14. We also found new ((6,2,3))2 and ((7,2,3))2 codes that are not equivalent to any stabilizer code, and extensive numerical evidence with VarQEC suggests that a ((7,3,3))2 code does not exist. Furthermore, we found many new channel-adaptive codes for error models involving nearest-neighbor correlated errors. Our work sheds new light on the understanding of QECC in general, which may also help to enhance near-term device performance with channel-adaptive error-correcting codes.

10 February 2020 in Journal of Physics: Condensed Matter
Verified
Journal Article
Closed access
CCChenfeng Cao
Chenfeng Cao
SHShi-Yao Hou
Shi-Yao Hou
NCNingping Cao
Ningping Cao
BZBei Zeng
Bei Zeng
Reconstructing a system Hamiltonian through measurements on its eigenstates is an important inverse problem in quantum physics. Recently, it was shown that generic many-body local Hamiltonians can be recovered by local measurements without knowing the values of the correlation functions. In this work, we discuss this problem in more depth for different systems and apply supervised learning method via neural networks to solve it. For low-lying eigenstates, the inverse problem is well-posed, neural networks turn out to be efficient and scalable even with a shallow network and a small data set. For middle-lying eigenstates, the problem is ill-posed, we present a modified method based on transfer learning accordingly. Neural networks can also efficiently generate appropriate initial points for numerical optimization based on the BFGS method.

20 July 2021 in Quantum Science and Technology
Verified
Journal Article
Closed access
PDF file
JZJinfeng Zeng
Jinfeng Zeng
CCChenfeng Cao
Chenfeng Cao
CZChao Zhang
Chao Zhang
PXPengxiang Xu
Pengxiang Xu
BZBei Zeng
Bei Zeng
Hamiltonian diagonalization is at the heart of understanding physical properties and practical applications of quantum systems. It is highly desired to design quantum algorithms that can speedup Hamiltonian diagonalization, especially those can be implemented on near-term quantum devices. In this work, we propose a variational quantum algorithm for Hamiltonian diagonalization (VQHD) of quantum systems, which explores the important physical properties, such as temperature, locality, and correlation, of the system. The key idea is that the thermal states of the system encode the information of eigenvalues and eigenstates of the system Hamiltonian. To obtain the full spectrum of the Hamiltonian, we use a quantum imaginary time evolution algorithm with high temperature, which prepares a thermal state with a small correlation length. With Trotterization, this then allows us to implement each step of imaginary time evolution by a local unitary transformation on only a small number of sites. Diagonalizing these thermal states hence leads to a full knowledge of the Hamiltonian eigensystem. We apply our algorithm to diagonalize local Hamiltonians and return results with high precision. Our VQHD algorithm sheds new light on the applications of near-term quantum computers.