Shi Jin, Nana Liu, Yue Yu
Dec 28, 2022·quant-ph·PDF We present a simple new way - called Schrodingerisation - to simulate general linear partial differential equations via quantum simulation. Using a simple new transform, referred to as the warped phase transformation, any linear partial differential equation can be recast into a system of Schrodinger's equations - in real time - in a straightforward way. This can be seen directly on the level of the dynamical equations without more sophisticated methods. This approach is not only applicable to PDEs for classical problems but also those for quantum problems - like the preparation of quantum ground states, Gibbs states and the simulation of quantum states in random media in the semiclassical limit.
Francois Golse, Shi Jin, Nana Liu
Sep 22, 2022·quant-ph·PDF Most problems in uncertainty quantification, despite its ubiquitousness in scientific computing, applied mathematics and data science, remain formidable on a classical computer. For uncertainties that arise in partial differential equations (PDEs), large numbers M>>1 of samples are required to obtain accurate ensemble averages. This usually involves solving the PDE M times. In addition, to characterise the stochasticity in a PDE, the dimension L of the random input variables is high in most cases, and classical algorithms suffer from curse-of-dimensionality. We propose new quantum algorithms for PDEs with uncertain coefficients that are more efficient in M and L in various important regimes, compared to their classical counterparts. We introduce transformations that transfer the original d-dimensional equation (with uncertain coefficients) into d+L (for dissipative equations) or d+2L (for wave type equations) dimensional equations (with certain coefficients) in which the uncertainties appear only in the initial data. These transformations also allow one to superimpose the M different initial data, so the computational cost for the quantum algorithm to obtain the ensemble average from M different samples is then independent of M, while also showing potential advantage in d, L and precision in computing ensemble averaged solutions or physical observables.
Nana Liu
This thesis is an exploration of the power of photonic resources, as viewed from several different but related perspectives. They range from quantum computation, precision parameter estimation to the thermodynamics of relativistic quantum systems, as applied to cosmology in particular. In chapter 1, we propose a new quantum computational model, called the `power of one qumode', that relies mainly on a single-mode photonic squeezed state. In particular, we show the amount of squeezing can quantitatively relate the resource requirements of factoring to the problem of finding the trace of large unitary matrices, a result with consequences for understanding how powerful quantum computation really is. Furthermore, we can connect squeezing to other known resources like precision, energy, qudit dimensionality and qubit number, which is a useful stepping stone to finding the resources that enable quantum computation. In chapter 2, we exploit the quantum mechanical properties of photonic states for use in precision parameter estimation of general linear optical processes, which is useful for a diverse number of applications, from characterising an unknown process in a photonic quantum computer to biological imaging. We introduce a formalism that quantifies this improvement in precision. We also provide conditions under which one can easily check for photonic states that are optimal to use in this context, which is a potentially important result for future experimental efforts. In chapter 3, we explore the connection between two-mode squeezed states, commonly used in quantum optics, and relativistic quantum processes, in particular in cosmology. Using this connection, we apply recently developed tools from the thermodynamics of quantum systems perturbed far from equilibrium to address an old question of entropy production in cosmology from a surprising new angle.
Yu Cao, Shi Jin, Nana Liu
Non-autonomous dynamical systems appear in a very wide range of interesting applications, both in classical and quantum dynamics, where in the latter case it corresponds to having a time-dependent Hamiltonian. However, the quantum simulation of these systems often needs to appeal to rather complicated procedures involving the Dyson series, considerations of time-ordering, requirement of time steps to be discrete and/or requiring multiple measurements and postselection. These procedures are generally much more complicated than the quantum simulation of time-independent Hamiltonians. Here we propose an alternative formalism that turns any non-autonomous unitary dynamical system into an autonomous unitary system, i.e., quantum system with a time-independent Hamiltonian, in one higher dimension, while keeping time continuous. This makes the simulation with time-dependent Hamiltonians not much more difficult than that of time-independent Hamiltonians, and can also be framed in terms of an analogue quantum system evolving continuously in time. We show how our new quantum protocol for time-dependent Hamiltonians can be performed in a resource-efficient way and without measurements, and can be made possible on either continuous-variable, qubit or hybrid systems. Combined with a technique called Schrodingerisation, this dilation technique can be applied to the quantum simulation of any linear ODEs and PDEs, and nonlinear ODEs and certain nonlinear PDEs, with time-dependent coefficients.
Shi Jin, Nana Liu
We present a simplified analog quantum simulation protocol for preparing quantum states that embed solutions of parabolic partial differential equations, including the heat, Black-Scholes and Fokker-Planck equations. The key idea is to approximate the heat equations by a system of hyperbolic heat equations that involve only first-order differential operators. This scheme requires relatively simple interaction terms in the Hamiltonian, which are the electric and magnetic dipole moment-like interaction terms that would be present in a Jaynes-Cummings-like model. For a d-dimensional problem, we show that it is much more appropriate to use a single d-level quantum system - a qudit - instead of its qubit counterpart, and d+1 qumodes. The total resource cost is efficient in d and precision error, and has potential for realisability for instance in cavity and circuit QED systems.
Nana Liu, Peter Wittek
May 10, 2019·quant-ph·PDF High-dimensional quantum systems are vital for quantum technologies and are essential in demonstrating practical quantum advantage in quantum computing, simulation and sensing. Since dimensionality grows exponentially with the number of qubits, the potential power of noisy intermediate-scale quantum (NISQ) devices over classical resources also stems from entangled states in high dimensions. An important family of quantum protocols that can take advantage of high-dimensional Hilbert space are classification tasks. These include quantum machine learning algorithms, witnesses in quantum information processing and certain decision problems. However, due to counter-intuitive geometrical properties emergent in high dimensions, classification problems are vulnerable to adversarial attacks. We demonstrate that the amount of perturbation needed for an adversary to induce a misclassification scales inversely with dimensionality. This is shown to be a fundamental feature independent of the details of the classification protocol. Furthermore, this leads to a trade-off between the security of the classification algorithm against adversarial attacks and quantum advantages we expect for high-dimensional problems. In fact, protection against these adversarial attacks require extra resources that scale at least polynomially with the Hilbert space dimension of the system, which can erase any significant quantum advantage that we might expect from a quantum protocol. This has wide-ranging implications in the use of both near-term and future quantum technologies for classification.
Nana Liu, Patrick Rebentrost
Oct 20, 2017·quant-ph·PDF Anomaly detection is used for identifying data that deviate from `normal' data patterns. Its usage on classical data finds diverse applications in many important areas like fraud detection, medical diagnoses, data cleaning and surveillance. With the advent of quantum technologies, anomaly detection of quantum data, in the form of quantum states, may become an important component of quantum applications. Machine learning algorithms are playing pivotal roles in anomaly detection using classical data. Two widely-used algorithms are kernel principal component analysis and one-class support vector machine. We find corresponding quantum algorithms to detect anomalies in quantum states. We show that these two quantum algorithms can be performed using resources logarithmic in the dimensionality of quantum states. For pure quantum states, these resources can also be logarithmic in the number of quantum states used for training the machine learning algorithm. This makes these algorithms potentially applicable to big quantum data applications.
Nana Liu, John Goold, Ivette Fuentes, Vlatko Vedral, Kavan Modi, David Edward Bruschi
Sep 18, 2014·quant-ph·PDF We investigate the thermodynamical properties of quantum fields in curved spacetime. Our approach is to consider quantum fields in curved spacetime as a quantum system undergoing an out-of-equilibrium transformation. The non-equilibrium features are studied by using a formalism which has been developed to derive fluctuation relations and emergent irreversible features beyond the linear response regime. We apply these ideas to an expanding universe scenario, therefore avoiding assumptions on the relation between entropy and quantum matter. We provide a fluctuation theorem which allows us to understand particle production due to the expansion of the universe as an entropic increase. Our results pave the way towards a different understanding of the thermodynamics of relativistic and quantum systems in our universe.
Nana Liu, Jayne Thompson, Christian Weedbrook, Seth Lloyd, Vlatko Vedral, Mile Gu, Kavan Modi
Oct 16, 2015·quant-ph·PDF Although quantum computers are capable of solving problems like factoring exponentially faster than the best-known classical algorithms, determining the resources responsible for their computational power remains unclear. An important class of problems where quantum computers possess an advantage is phase estimation, which includes applications like factoring. We introduce a new computational model based on a single squeezed state resource that can perform phase estimation, which we call the power of one qumode. This model is inspired by an interesting computational model known as deterministic quantum computing with one quantum bit (DQC1). Using the power of one qumode, we identify that the amount of squeezing is sufficient to quantify the resource requirements of different computational problems based on phase estimation. In particular, it establishes a quantitative relationship between the resources required for factoring and DQC1. For example, we find the squeezing required to factor has an exponential scaling whereas no squeezing (i.e., a coherent state) is already sufficient to solve the hardest problem in DQC1.
Shi Jin, Nana Liu, Maria Lukacova-Medvidova, Yuhuan Yuan
Apr 11, 2026·quant-ph·PDF Many nonlinear PDEs have singular or oscillatory solutions or may exhibit physical instabilities or uncertainties. This requires a suitable concept of physically relevant generalized solutions. Dissipative measure-valued solutions have been an effective analytical tool to characterize PDE behavior in such singular regimes. They have also been used to characterize limits of standard numerical schemes on classical computers. The measure-valued formulation of a nonlinear PDE yields an optimization problem with a linear cost functional and linear constraints, which can be formulated as a linear programming problem. However, this linear programming problem can suffer from the curse of dimensionality. In this article, we propose solving it using quantum linear programming (QLP) algorithms and discuss whether this approach can reduce costs compared to classical algorithms. We show that some QLP algorithms, such as the quantum central path algorithm, have up to polynomial advantage over the classical interior point method. For problems where one is interested in the dissipative weak solution, namely the expected values of the Young measure, we show that the QLP algorithms offer no advantage over direct classical solvers. Moreover, for random PDEs, there can be up to polynomial advantage in obtaining the Young measure over direct classical PDE solvers. This is a significant advantage over standard PDE solvers, since the Young measure provides a more detailed description of the solution. We also propose some open questions for future development in this direction.
Nana Liu, Tommaso F. Demarie, Si-Hui Tan, Leandro Aolita, Joseph F. Fitzsimons
Jun 24, 2018·quant-ph·PDF We present a verifiable and blind protocol for assisted universal quantum computing on continuous-variable (CV) platforms. This protocol is highly experimentally-friendly to the client, as it only requires Gaussian-operation capabilities from the latter. Moreover, the server is not required universal quantum-computational power either, its only function being to supply the client with copies of a single-mode non-Gaussian state. Universality is attained based on state-injection of the server's non-Gaussian supplies. The protocol is automatically blind because the non-Gaussian resource requested to the server is always the same, regardless of the specific computation. Verification, in turn, is possible thanks to an efficient non-Gaussian state fidelity test where we assume identical state preparation by the server. It is based on Gaussian measurements by the client on the injected states, which is potentially interesting on its own. The division of quantum hardware between client and server assumed here is in agreement with the experimental constraints expected in realistic schemes for CV cloud quantum computing.
Shi Jin, Nana Liu
Quantum simulation is known to be capable of simulating certain dynamical systems in continuous time -- Schrodinger's equations being the most direct and well-known -- more efficiently than classical simulation. Any linear dynamical system can in fact be transformed into a system of Schrodinger's equations via a method called Schrodingerisation. Building on the observation that iterative methods in linear algebra, and more generally discrete linear dynamical systems, can be viewed as discrete time approximations of dynamical systems which evolve continuously in time, we can apply the Schrodingerisation technique. Thus quantum simulation can be directly applied to the continuous-time limits of some of the simplest iterative methods. This applies to general (explicit) iterative schemes or discrete linear dynamical systems. In particular, we introduce the quantum Jacobi and quantum power methods for solving the quantum linear systems of equations and for estimating the maximum eigenvector and eigenvalue of a matrix respectively. The proposed quantum simulation can be performed on either discrete-variable quantum systems or on hybrid continuous-variable and discrete-variable quantum systems. This framework provides an interesting alternative method to solve linear algebra problems using quantum simulation.
Shi Jin, Nana Liu, Yue Yu
Dec 30, 2022·quant-ph·PDF We study a new method - called Schrodingerisation introduced in [Jin, Liu, Yu, arXiv: 2212.13969] - for solving general linear partial differential equations with quantum simulation. This method converts linear partial differential equations into a `Schrodingerised' or Hamiltonian system, using a new and simple transformation called the warped phase transformation. Here we provide more in-depth technical discussions and expand on this approach in a more detailed and pedagogical way. We apply this to more examples of partial differential equations, including heat, convection, Fokker-Planck, linear Boltzmann and Black-Scholes equations. This approach can also be extended to Schrodingerise general linear partial differential equations, including the Vlasov-Fokker-Planck equation and the Liouville representation equation for nonlinear ordinary differential equations.
Shi Jin, Nana Liu
Feb 16, 2022·quant-ph·PDF We construct quantum algorithms to compute physical observables of nonlinear PDEs with M initial data. Based on an exact mapping between nonlinear and linear PDEs using the level set method, these new quantum algorithms for nonlinear Hamilton-Jacobi and scalar hyperbolic PDEs can be performed with a computational cost that is independent of M, for arbitrary nonlinearity. Depending on the details of the initial data, it can also display up to exponential advantage in both the dimension of the PDE and the error in computing its observables. For general nonlinear PDEs, quantum advantage with respect to M is possible in the large M limit.
Nana Liu
Feb 16, 2026·quant-ph·PDF This chapter introduces and investigates some fundamental questions on the relationship between accuracy and robustness in both classical and quantum classification algorithms under noisy and adversarial conditions. We introduce and clarify various definitions of robustness and accuracy, including corrupted-instance robustness accuracy and prediction-change robustness, distinguishing them from conventional accuracy and robustness measures. Through theoretical analysis and toy models, we establish conditions under which trade-offs between accuracy and robustness accuracy arise and identify scenarios where such trade-offs can be avoided. The framework developed highlights the nuanced interplay between model bias, noise characteristics, and perturbation types, including relevant and irrelevant perturbations. We explore the implications of some of these results for incompatible noise, adversarial quantum perturbations, the no free lunch theorem, and suggest future methods to examine these problems from the lens of dynamical systems.
Yu Cao, Shi Jin, Nana Liu
Aug 24, 2025·quant-ph·PDF We introduce a unified framework -- Quantum Neural Ordinary and Partial Differential Equations (QNODEs and QNPDEs) -- which extends the continuous-time formalism of classical neural ordinary and partial differential equations into quantum machine learning and quantum control. QNODEs denote the evolution of finite-dimensional quantum systems, whereas QNPDEs denote their infinite-dimensional (continuous-variable) counterparts; both are governed by generalised Schrödinger-type Hamiltonian dynamics, coupled with a corresponding loss function. This formalism permits gradient estimation via an adjoint-state method, facilitating efficient learning of quantum dynamics, and other dynamics that can be mapped (relatively easily) to quantum dynamics. Using this method, we present quantum algorithms for computing gradients with and without time discretisation, achieving efficient gradient computation that would otherwise be intractable on classical devices. We provide detailed resource estimates for these algorithms and investigate the local energy landscape for training. The formalism subsumes a wide array of applications, including quantum state preparation, Hamiltonian learning, learning dynamics in open systems, and the learning of both autonomous and non-autonomous classical ODEs and PDEs. In many cases of interest, the Hamiltonian is composed of a relatively small number of local operators, yet the corresponding classical simulation remains inefficient, making quantum approaches advantageous for gradient estimation. This continuous-time perspective can also serve as a blueprint for designing novel quantum neural network architectures, generalising discrete-layered models into continuous-depth models.
Nana Liu, Ningyan Cheng, Chengwu Yang, Weichang Hao, Yi Du
An effective biosensor based on two-dimensional (2D) Co-ZIF-L nanosheets for sensitive electrochemical non-enzymatic glucose detection is developed, which exhibits high electrocalalytic activities towards glucose due to the ordered porous structure as well as ultrahigh specific surface area. The fabricated Co-ZIF-L nanosheets electrodes present an outstanding performance with higher sensitivity of 769.5 *10$^{-6}$ A mM$^{-1}$ cm$^{-2}$ and lower detect limit of 90.4 nM, while the constructed 3D ZIF-67 nanoparticles electrodes show a weaker sensitivity of 697.4 *10$^{-6}$ A mM$^{-1}$ cm$^{-2}$ and a limited detection range from 2 *10$^{-6}$ M to 414 *10$^{-6}$ M. Furthermore, the Co-ZIF-L based non-enzymatic glucose biosensors possess an acceptable selectivity, long-term stability as well as reproducibility. This work may offer a new approach to develop 2D ZIF nanosheets as a potential candidate in electrochemical biosensors.
Yuxuan Du, Min-Hsiu Hsieh, Tongliang Liu, Dacheng Tao, Nana Liu
Mar 20, 2020·quant-ph·PDF Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. However, noise has often played beneficial roles, from enhancing weak signals in stochastic resonance to protecting the privacy of data in differential privacy. It is then natural to ask, can we harness the power of quantum noise that is beneficial to quantum computing? An important current direction for quantum computing is its application to machine learning, such as classification problems. One outstanding problem in machine learning for classification is its sensitivity to adversarial examples. These are small, undetectable perturbations from the original data where the perturbed data is completely misclassified in otherwise extremely accurate classifiers. They can also be considered as `worst-case' perturbations by unknown noise sources. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived where the robustness improves with increasing noise. This robustness property is intimately connected with an important security concept called differential privacy which can be extended to quantum differential privacy. For the protection of quantum data, this is the first quantum protocol that can be used against the most general adversaries. Furthermore, we show how the robustness in the classical case can be sensitive to the details of the classification model, but in the quantum case the details of classification model are absent, thus also providing a potential quantum advantage for classical data that is independent of quantum speedups. This opens the opportunity to explore other ways in which quantum noise can be used in our favour, as well as identifying other ways quantum algorithms can be helpful that is independent of quantum speedups.
Nana Liu, Hugo Cable
Dec 12, 2016·quant-ph·PDF Precise device characterization is a fundamental requirement for a large range of applications using photonic hardware, and constitutes a multi-parameter estimation problem. Estimates based on measurements using single photons or classical light have precision which is limited by shot-noise, while quantum resources can be used to achieve sub-shot-noise precision. However, there are many open questions with regard to the best quantum protocols for multi-parameter estimation, including the ultimate limits to achievable precision, as well as optimal choices for probe states and measurements. In this paper, we develop a formalism based on Fisher information to tackle these questions for set-ups based on linear-optical components and photon-counting measurements. A key ingredient of our analysis is a mapping for equivalent protocols defined for photonic and spin systems, which allows us to draw upon results in the literature for general finite-dimensional systems. Motivated by the protocol in X.-Q. Zhou, et al., Optica 2, 510 (2015), we present new results for quantum-enhanced tomography of unitary processes, including a comparison of Holland-Burnett and NOON probe states.
Nana Liu, Qisheng Wang, Mark M. Wilde, Zhicheng Zhang
Matrix geometric means between two positive definite matrices can be defined from distinct perspectives - as solutions to certain nonlinear systems of equations, as points along geodesics in Riemannian geometry, and as solutions to certain optimisation problems. We devise quantum subroutines for the matrix geometric means, and construct solutions to the algebraic Riccati equation - an important class of nonlinear systems of equations appearing in machine learning, optimal control, estimation, and filtering. Using these subroutines, we present a new class of quantum learning algorithms, for both classical and quantum data, called quantum geometric mean metric learning, for weakly supervised learning and anomaly detection. The subroutines are also useful for estimating geometric Rényi relative entropies and the Uhlmann fidelity, in particular achieving optimal dependence on precision for the Uhlmann and Matsumoto fidelities. Finally, we provide a BQP-complete problem based on matrix geometric means that can be solved by our subroutines.