**3** Publications

- Page
**1**of**1**

Sci Rep 2022 Jun 25;12(1):10817. Epub 2022 Jun 25.

Institute of High Performance Computing, Agency for Science, Technology and Research (A*STAR), Singapore, 138632, Singapore.

Variational quantum algorithms offer a promising new paradigm for solving partial differential equations on near-term quantum computers. Here, we propose a variational quantum algorithm for solving a general evolution equation through implicit time-stepping of the Laplacian operator. The use of encoded source states informed by preceding solution vectors results in faster convergence compared to random re-initialization. Through statevector simulations of the heat equation, we demonstrate how the time complexity of our algorithm scales with the Ansatz volume for gradient estimation and how the time-to-solution scales with the diffusion parameter. Our proposed algorithm extends economically to higher-order time-stepping schemes, such as the Crank-Nicolson method. We present a semi-implicit scheme for solving systems of evolution equations with non-linear terms, such as the reaction-diffusion and the incompressible Navier-Stokes equations, and demonstrate its validity by proof-of-concept results.

## Download full-text PDF |
Source |
---|---|

http://dx.doi.org/10.1038/s41598-022-14906-3 | DOI Listing |

http://www.ncbi.nlm.nih.gov/pmc/articles/PMC9233714 | PMC |

June 2022

Phys Rev Lett 2019 Oct;123(17):170502

Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA.

We investigate the problem of evaluating the output probabilities of Clifford circuits with nonstabilizer product input states. First, we consider the case when the input state is mixed, and give an efficient classical algorithm to approximate the output probabilities, with respect to the l_{1} norm, of a large fraction of Clifford circuits. The running time of our algorithm decreases as the inputs become more mixed. Second, we consider the case when the input state is a pure nonstabilizer product state, and show that a similar efficient algorithm exists to approximate the output probabilities, when a suitable restriction is placed on the number of qubits measured. This restriction depends on a magic monotone that we call the Pauli rank. We apply our results to give an efficient output probability approximation algorithm for some restricted quantum computation models, such as Clifford circuits with solely magic state inputs, Pauli-based computation, and instantaneous quantum polynomial time circuits. Finally, we discuss the relationship between Pauli rank and stabilizer rank.

## Download full-text PDF |
Source |
---|---|

http://dx.doi.org/10.1103/PhysRevLett.123.170502 | DOI Listing |

October 2019

Phys Rev Lett 2012 Oct;109(16):160404

Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543, Singapore.

With the advent of quantum information, the violation of a Bell inequality is used to witness the absence of an eavesdropper in cryptographic scenarios such as key distribution and randomness expansion. One of the key assumptions of Bell's theorem is the existence of experimental "free will," meaning that measurement settings can be chosen at random and independently by each party. The relaxation of this assumption potentially shifts the balance of power towards an eavesdropper. We consider a no-signaling model with reduced "free will" and bound the adversary’s capabilities in the task of randomness expansion.

## Download full-text PDF |
Source |
---|---|

http://dx.doi.org/10.1103/PhysRevLett.109.160404 | DOI Listing |

October 2012

-->