Chunhao Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Chunhao Wang has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Xiantao Li
Pennsylvania State University
7 shared publications - Patrick Rall
IBM Quantum, MIT-IBM Watson AI Lab, Cambridge, Massachusetts 02142, USA
2 shared publications - Pawel Wocjan
IBM Quantum, Thomas J Watson Research Center, Yorktown Heights, New York 10598, USA
2 shared publications - Tongyang Li
Peking University
2 shared publications - Andrew M. Childs
Joint Center for Quantum Information and Computer Science
1 shared publication - András Gilyén
Alfréd Rényi Institute of Mathematics
1 shared publication
Latest Publications
- Open Access
Quantum Regression Theory and Efficient Computation of Response Functions for Non-Markovian Open Systems
Linear response functions are a cornerstone concept in physics as they enable efficient estimation of many dynamical properties. In addition to predicting dynamics of observables under perturbations without resimulating the system, these response functions lead to electric conductivity, magnetic susceptibility, dielectric constants, etc. Estimating two-time correlation functions is a key ingredient of measuring linear response functions. However, for open quantum systems, simulating the reduced density operator with a quantum master equation only yields \emph{one-point} observables and is insufficient for this task. In this paper, we develop a memoryless, system-only formulation of two-point correlations for open quantum systems that extends the standard quantum regression theorem (QRT) beyond the Markov limit. We further incorporate the spectral property of the bath and express the time propagators in the response function as the memoryless generators in Lindblad-type forms. The resulting expressions recast the total response function into evolutions generated by time-dependent Hamiltonian and Lindblad primitives together with the more challenging propagation of commutators and anti-commutators. In addition to the derivation of the new QRT, we present quantum algorithms for these primitives and obtain an estimator for two-time correlations whose cost scales poly-logarithmically in the system dimension and $1/ε^{1.25}$ in the target accuracy $ε$. The framework removes the separability (Born-Markov) assumption and offers a pathway to efficient computation of nonequilibrium properties from open quantum systems.Open AccessQuantum Regression Theory and Efficient Computation of Response Functions for Non-Markovian Open Systems
Linear response functions are a cornerstone concept in physics as they enable efficient estimation of many dynamical properties. In addition to predicting dynamics of observables under perturbations without resimulating the system, these response functions lead to electric conductivity, magnetic susceptibility, dielectric constants, etc. Estimating two-time correlation functions is a key ingredient of measuring linear response functions. However, for open quantum systems, simulating the reduced density operator with a quantum master equation only yields \emph{one-point} observables and is insufficient for this task. In this paper, we develop a memoryless, system-only formulation of two-point correlations for open quantum systems that extends the standard quantum regression theorem (QRT) beyond the Markov limit. We further incorporate the spectral property of the bath and express the time propagators in the response function as the memoryless generators in Lindblad-type forms. The resulting expressions recast the total response function into evolutions generated by time-dependent Hamiltonian and Lindblad primitives together with the more challenging propagation of commutators and anti-commutators. In addition to the derivation of the new QRT, we present quantum algorithms for these primitives and obtain an estimator for two-time correlations whose cost scales poly-logarithmically in the system dimension and $1/ε^{1.25}$ in the target accuracy $ε$. The framework removes the separability (Born-Markov) assumption and offers a pathway to efficient computation of nonequilibrium properties from open quantum systems. - Open Access
Time-Dependent Hamiltonian Simulation via Time-Independent Dynamics in a Larger Space
In this paper, we present a proof-of-concept quantum algorithm for simulating time-dependent Hamiltonian evolution by reducing the problem to simulating a time-independent Hamiltonian in a larger space using a discrete clock Hamiltonian construction. A similar construction was first explored for this simulation problem by Watkins, Wiebe, Roggero, and Lee [PRX Quantum, 2024]. Our algorithm improves upon their work in terms of the dependence on evolution time and precision. In addition, the complexity matches the state-of-the-art simulation algorithms using other approaches. To achieve this improvement, we use Duhamel's principle to treat the clock and system Hamiltonians separately and exploit properties of Gaussian quadrature to reduce the simulation cost. Our approach demonstrates that time-dependent Hamiltonian simulation can be as efficient in a simpler framework and hence provides a new angle to model and simulate time-dependent systems.
Open AccessTime-Dependent Hamiltonian Simulation via Time-Independent Dynamics in a Larger Space
In this paper, we present a proof-of-concept quantum algorithm for simulating time-dependent Hamiltonian evolution by reducing the problem to simulating a time-independent Hamiltonian in a larger space using a discrete clock Hamiltonian construction. A similar construction was first explored for this simulation problem by Watkins, Wiebe, Roggero, and Lee [PRX Quantum, 2024]. Our algorithm improves upon their work in terms of the dependence on evolution time and precision. In addition, the complexity matches the state-of-the-art simulation algorithms using other approaches. To achieve this improvement, we use Duhamel's principle to treat the clock and system Hamiltonians separately and exploit properties of Gaussian quadrature to reduce the simulation cost. Our approach demonstrates that time-dependent Hamiltonian simulation can be as efficient in a simpler framework and hence provides a new angle to model and simulate time-dependent systems.
- 17 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 42, 37-40
Trustworthy Data Sharing Scheme Based on Decentralized Oracle Networks
Data sharing is the core of the development of the digital economy, but the traditional scheme faces problems such as centralization, security and spatial efficiency. In traditional data sharing schemes, data providers are required to preemptively upload and store the data before sharing it with data users. This scheme faces threats such as monopolistic attacks and data privacy breaches due to its centralized nature. Ensuring the confidentiality and integrity of the data is becoming challenging. Moreover, real-time upload and storage of all changing data would consume significant storage space, leading to a diminished timeliness in data sharing. This paper proposes a trusted data sharing model based on blockchain and decentralized oracle network, and uses threshold signature and homomorphic encryption to improve data reliability. The scheme does not need to upload data to the central database, and achieves high quality assurance of data tamper-proof, anonymity and traceability. At the same time, the system meets the transmission requirements of existing common data types, and can provide solutions in the scenario of real-time data sharing. With the maturity of blockchain technology and the increase of application scenarios, the scheme can be promoted and applied in cross-chain data sharing, financial data sharing, IoT data sharing and other fields.
- 17 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 42, 37-40
Trustworthy Data Sharing Scheme Based on Decentralized Oracle Networks
Data sharing is the core of the development of the digital economy, but the traditional scheme faces problems such as centralization, security and spatial efficiency. In traditional data sharing schemes, data providers are required to preemptively upload and store the data before sharing it with data users. This scheme faces threats such as monopolistic attacks and data privacy breaches due to its centralized nature. Ensuring the confidentiality and integrity of the data is becoming challenging. Moreover, real-time upload and storage of all changing data would consume significant storage space, leading to a diminished timeliness in data sharing. This paper proposes a trusted data sharing model based on blockchain and decentralized oracle network, and uses threshold signature and homomorphic encryption to improve data reliability. The scheme does not need to upload data to the central database, and achieves high quality assurance of data tamper-proof, anonymity and traceability. At the same time, the system meets the transmission requirements of existing common data types, and can provide solutions in the scenario of real-time data sharing. With the maturity of blockchain technology and the increase of application scenarios, the scheme can be promoted and applied in cross-chain data sharing, financial data sharing, IoT data sharing and other fields.
- Open Access
Stochastic Quantum Sampling for Non-Logconcave Distributions and Estimating Partition Functions
We present quantum algorithms for sampling from non-logconcave probability distributions in the form of $\pi(x) \propto \exp(-\beta f(x))$. Here, $f$ can be written as a finite sum $f(x):= \frac{1}{N}\sum_{k=1}^N f_k(x)$. Our approach is based on quantum simulated annealing on slowly varying Markov chains derived from unadjusted Langevin algorithms, removing the necessity for function evaluations which can be computationally expensive for large data sets in mixture modeling and multi-stable systems. We also incorporate a stochastic gradient oracle that implements the quantum walk operators inexactly by only using mini-batch gradients. As a result, our stochastic gradient based algorithm only accesses small subsets of data points in implementing the quantum walk. One challenge of quantizing the resulting Markov chains is that they do not satisfy the detailed balance condition in general. Consequently, the mixing time of the algorithm cannot be expressed in terms of the spectral gap of the transition density, making the quantum algorithms nontrivial to analyze. To overcome these challenges, we first build a hypothetical Markov chain that is reversible, and also converges to the target distribution. Then, we quantified the distance between our algorithm's output and the target distribution by using this hypothetical chain as a bridge to establish the total complexity. Our quantum algorithms exhibit polynomial speedups in terms of both dimension and precision dependencies when compared to the best-known classical algorithms.Open AccessStochastic Quantum Sampling for Non-Logconcave Distributions and Estimating Partition Functions
We present quantum algorithms for sampling from non-logconcave probability distributions in the form of $\pi(x) \propto \exp(-\beta f(x))$. Here, $f$ can be written as a finite sum $f(x):= \frac{1}{N}\sum_{k=1}^N f_k(x)$. Our approach is based on quantum simulated annealing on slowly varying Markov chains derived from unadjusted Langevin algorithms, removing the necessity for function evaluations which can be computationally expensive for large data sets in mixture modeling and multi-stable systems. We also incorporate a stochastic gradient oracle that implements the quantum walk operators inexactly by only using mini-batch gradients. As a result, our stochastic gradient based algorithm only accesses small subsets of data points in implementing the quantum walk. One challenge of quantizing the resulting Markov chains is that they do not satisfy the detailed balance condition in general. Consequently, the mixing time of the algorithm cannot be expressed in terms of the spectral gap of the transition density, making the quantum algorithms nontrivial to analyze. To overcome these challenges, we first build a hypothetical Markov chain that is reversible, and also converges to the target distribution. Then, we quantified the distance between our algorithm's output and the target distribution by using this hypothetical chain as a bridge to establish the total complexity. Our quantum algorithms exhibit polynomial speedups in terms of both dimension and precision dependencies when compared to the best-known classical algorithms. - Top Cited PapersOpen Access
- 10 October 2023
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 7, 1132
Thermal State Preparation via Rounding Promises
A promising avenue for the preparation of Gibbs states on a quantum computer is to simulate the physical thermalization process. The Davies generator describes the dynamics of an open quantum system that is in contact with a heat bath. Crucially, it does not require simulation of the heat bath itself, only the system we hope to thermalize. Using the state-of-the-art techniques for quantum simulation of the Lindblad equation, we devise a technique for the preparation of Gibbs states via thermalization as specified by the Davies generator. In doing so, we encounter a severe technical challenge: implementation of the Davies generator demands the ability to estimate the energy of the system unambiguously. That is, each energy of the system must be deterministically mapped to a unique estimate. Previous work showed that this is only possible if the system satisfies an unphysical 'rounding promise' assumption. We solve this problem by engineering a random ensemble of rounding promises that simultaneously solves three problems: First, each rounding promise admits preparation of a 'promised' thermal state via a Davies generator. Second, these Davies generators have a similar mixing time as the ideal Davies generator. Third, the average of these promised thermal states approximates the ideal thermal state.
- 10 October 2023
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 7, 1132
Top Cited PapersOpen AccessThermal State Preparation via Rounding Promises
A promising avenue for the preparation of Gibbs states on a quantum computer is to simulate the physical thermalization process. The Davies generator describes the dynamics of an open quantum system that is in contact with a heat bath. Crucially, it does not require simulation of the heat bath itself, only the system we hope to thermalize. Using the state-of-the-art techniques for quantum simulation of the Lindblad equation, we devise a technique for the preparation of Gibbs states via thermalization as specified by the Davies generator. In doing so, we encounter a severe technical challenge: implementation of the Davies generator demands the ability to estimate the energy of the system unambiguously. That is, each energy of the system must be deterministically mapped to a unique estimate. Previous work showed that this is only possible if the system satisfies an unphysical 'rounding promise' assumption. We solve this problem by engineering a random ensemble of rounding promises that simultaneously solves three problems: First, each rounding promise admits preparation of a 'promised' thermal state via a Davies generator. Second, these Davies generators have a similar mixing time as the ideal Davies generator. Third, the average of these promised thermal states approximates the ideal thermal state.
- Open Access
Thermal State Preparation via Rounding Promises
A promising avenue for the preparation of Gibbs states on a quantum computer is to simulate the physical thermalization process. The Davies generator describes the dynamics of an open quantum system that is in contact with a heat bath. Crucially, it does not require simulation of the heat bath itself, only the system we hope to thermalize. Using the state-of-the-art techniques for quantum simulation of the Lindblad equation, we devise a technique for the preparation of Gibbs states via thermalization as specified by the Davies generator. In doing so, we encounter a severe technical challenge: implementation of the Davies generator demands the ability to estimate the energy of the system unambiguously. That is, each energy of the system must be deterministically mapped to a unique estimate. Previous work showed that this is only possible if the system satisfies an unphysical 'rounding promise' assumption. We solve this problem by engineering a random ensemble of rounding promises that simultaneously solves three problems: First, each rounding promise admits preparation of a 'promised' thermal state via a Davies generator. Second, these Davies generators have a similar mixing time as the ideal Davies generator. Third, the average of these promised thermal states approximates the ideal thermal state.
Open AccessThermal State Preparation via Rounding Promises
A promising avenue for the preparation of Gibbs states on a quantum computer is to simulate the physical thermalization process. The Davies generator describes the dynamics of an open quantum system that is in contact with a heat bath. Crucially, it does not require simulation of the heat bath itself, only the system we hope to thermalize. Using the state-of-the-art techniques for quantum simulation of the Lindblad equation, we devise a technique for the preparation of Gibbs states via thermalization as specified by the Davies generator. In doing so, we encounter a severe technical challenge: implementation of the Davies generator demands the ability to estimate the energy of the system unambiguously. That is, each energy of the system must be deterministically mapped to a unique estimate. Previous work showed that this is only possible if the system satisfies an unphysical 'rounding promise' assumption. We solve this problem by engineering a random ensemble of rounding promises that simultaneously solves three problems: First, each rounding promise admits preparation of a 'promised' thermal state via a Davies generator. Second, these Davies generators have a similar mixing time as the ideal Davies generator. Third, the average of these promised thermal states approximates the ideal thermal state.
- Open Access
Efficient Quantum Algorithms for Quantum Optimal Control
In this paper, we present efficient quantum algorithms that are exponentially faster than classical algorithms for solving the quantum optimal control problem. This problem involves finding the control variable that maximizes a physical quantity at time $T$, where the system is governed by a time-dependent Schrödinger equation. This type of control problem also has an intricate relation with machine learning. Our algorithms are based on a time-dependent Hamiltonian simulation method and a fast gradient-estimation algorithm. We also provide a comprehensive error analysis to quantify the total error from various steps, such as the finite-dimensional representation of the control function, the discretization of the Schrödinger equation, the numerical quadrature, and optimization. Our quantum algorithms require fault-tolerant quantum computers.Open AccessEfficient Quantum Algorithms for Quantum Optimal Control
In this paper, we present efficient quantum algorithms that are exponentially faster than classical algorithms for solving the quantum optimal control problem. This problem involves finding the control variable that maximizes a physical quantity at time $T$, where the system is governed by a time-dependent Schrödinger equation. This type of control problem also has an intricate relation with machine learning. Our algorithms are based on a time-dependent Hamiltonian simulation method and a fast gradient-estimation algorithm. We also provide a comprehensive error analysis to quantify the total error from various steps, such as the finite-dimensional representation of the control function, the discretization of the Schrödinger equation, the numerical quadrature, and optimization. Our quantum algorithms require fault-tolerant quantum computers. - Open Access
Implementation of the Density-functional Theory on Quantum Computers with Linear Scaling with respect to the Number of Atoms
Density-functional theory (DFT) has revolutionized computer simulations in chemistry and material science. A faithful implementation of the theory requires self-consistent calculations. However, this effort involves repeatedly diagonalizing the Hamiltonian, for which a classical algorithm typically requires a computational complexity that scales cubically with respect to the number of electrons. This limits DFT's applicability to large-scale problems with complex chemical environments and microstructures. This article presents a quantum algorithm that has a linear scaling with respect to the number of atoms, which is much smaller than the number of electrons. Our algorithm leverages the quantum singular value transformation (QSVT) to generate a quantum circuit to encode the density-matrix, and an estimation method for computing the output electron density. In addition, we present a randomized block coordinate fixed-point method to accelerate the self-consistent field calculations by reducing the number of components of the electron density that needs to be estimated. The proposed framework is accompanied by a rigorous error analysis that quantifies the function approximation error, the statistical fluctuation, and the iteration complexity. In particular, the analysis of our self-consistent iterations takes into account the measurement noise from the quantum circuit. These advancements offer a promising avenue for tackling large-scale DFT problems, enabling simulations of complex systems that were previously computationally infeasible.
Open AccessImplementation of the Density-functional Theory on Quantum Computers with Linear Scaling with respect to the Number of Atoms
Density-functional theory (DFT) has revolutionized computer simulations in chemistry and material science. A faithful implementation of the theory requires self-consistent calculations. However, this effort involves repeatedly diagonalizing the Hamiltonian, for which a classical algorithm typically requires a computational complexity that scales cubically with respect to the number of electrons. This limits DFT's applicability to large-scale problems with complex chemical environments and microstructures. This article presents a quantum algorithm that has a linear scaling with respect to the number of atoms, which is much smaller than the number of electrons. Our algorithm leverages the quantum singular value transformation (QSVT) to generate a quantum circuit to encode the density-matrix, and an estimation method for computing the output electron density. In addition, we present a randomized block coordinate fixed-point method to accelerate the self-consistent field calculations by reducing the number of components of the electron density that needs to be estimated. The proposed framework is accompanied by a rigorous error analysis that quantifies the function approximation error, the statistical fluctuation, and the iteration complexity. In particular, the analysis of our self-consistent iterations takes into account the measurement noise from the quantum circuit. These advancements offer a promising avenue for tackling large-scale DFT problems, enabling simulations of complex systems that were previously computationally infeasible.
- Open Access
Simulating Markovian open quantum systems using higher-order series expansion
We present an efficient quantum algorithm for simulating the dynamics of Markovian open quantum systems. The performance of our algorithm is similar to the previous state-of-the-art quantum algorithm, i.e., it scales linearly in evolution time and poly-logarithmically in inverse precision. However, our algorithm is conceptually cleaner, and it only uses simple quantum primitives without compressed encoding. Our approach is based on a novel mathematical treatment of the evolution map, which involves a higher-order series expansion based on Duhamel's principle and approximating multiple integrals using scaled Gaussian quadrature. Our method easily generalizes to simulating quantum dynamics with time-dependent Lindbladians. Furthermore, our method of approximating multiple integrals using scaled Gaussian quadrature could potentially be used to produce a more efficient approximation of time-ordered integrals, and therefore can simplify existing quantum algorithms for simulating time-dependent Hamiltonians based on a truncated Dyson series.
Open AccessSimulating Markovian open quantum systems using higher-order series expansion
We present an efficient quantum algorithm for simulating the dynamics of Markovian open quantum systems. The performance of our algorithm is similar to the previous state-of-the-art quantum algorithm, i.e., it scales linearly in evolution time and poly-logarithmically in inverse precision. However, our algorithm is conceptually cleaner, and it only uses simple quantum primitives without compressed encoding. Our approach is based on a novel mathematical treatment of the evolution map, which involves a higher-order series expansion based on Duhamel's principle and approximating multiple integrals using scaled Gaussian quadrature. Our method easily generalizes to simulating quantum dynamics with time-dependent Lindbladians. Furthermore, our method of approximating multiple integrals using scaled Gaussian quadrature could potentially be used to produce a more efficient approximation of time-ordered integrals, and therefore can simplify existing quantum algorithms for simulating time-dependent Hamiltonians based on a truncated Dyson series.
- Open Access
- 8 May 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 4 (3) , 1-60
Quantum Algorithm for Estimating Volumes of Convex Bodies
Estimating the volume of a convex body is a central problem in convex geometry and can be viewed as a continuous version of counting. We present a quantum algorithm that estimates the volume of an n -dimensional convex body within multiplicative error ε using Õ(n 3 + n 2.5 /ε ) queries to a membership oracle and Õ(n 5 +n 4.5 /ε) additional arithmetic operations. For comparison, the best known classical algorithm uses Õ(n 3.5 +n 3 /ε 2 ) queries and Õ(n 5.5 +n 5 /ε 2 ) additional arithmetic operations. To the best of our knowledge, this is the first quantum speedup for volume estimation. Our algorithm is based on a refined framework for speeding up simulated annealing algorithms that might be of independent interest. This framework applies in the setting of “Chebyshev cooling,” where the solution is expressed as a telescoping product of ratios, each having bounded variance. We develop several novel techniques when implementing our framework, including a theory of continuous-space quantum walks with rigorous bounds on discretization error. To complement our quantum algorithms, we also prove that volume estimation requires Ω (√ n+1/ε) quantum membership queries, which rules out the possibility of exponential quantum speedup in n and shows optimality of our algorithm in 1/ε up to poly-logarithmic factors.
- 8 May 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 4 (3) , 1-60
Open AccessQuantum Algorithm for Estimating Volumes of Convex Bodies
Estimating the volume of a convex body is a central problem in convex geometry and can be viewed as a continuous version of counting. We present a quantum algorithm that estimates the volume of an n -dimensional convex body within multiplicative error ε using Õ(n 3 + n 2.5 /ε ) queries to a membership oracle and Õ(n 5 +n 4.5 /ε) additional arithmetic operations. For comparison, the best known classical algorithm uses Õ(n 3.5 +n 3 /ε 2 ) queries and Õ(n 5.5 +n 5 /ε 2 ) additional arithmetic operations. To the best of our knowledge, this is the first quantum speedup for volume estimation. Our algorithm is based on a refined framework for speeding up simulated annealing algorithms that might be of independent interest. This framework applies in the setting of “Chebyshev cooling,” where the solution is expressed as a telescoping product of ratios, each having bounded variance. We develop several novel techniques when implementing our framework, including a theory of continuous-space quantum walks with rigorous bounds on discretization error. To complement our quantum algorithms, we also prove that volume estimation requires Ω (√ n+1/ε) quantum membership queries, which rules out the possibility of exponential quantum speedup in n and shows optimality of our algorithm in 1/ε up to poly-logarithmic factors.