scholarly journals Quantum algorithms for powering stable Hermitian matrices

2021 ◽  
Vol 103 (6) ◽  
Author(s):  
Guillermo González ◽  
Rahul Trivedi ◽  
J. Ignacio Cirac
2018 ◽  
Author(s):  
Rajendra K. Bera

It now appears that quantum computers are poised to enter the world of computing and establish its dominance, especially, in the cloud. Turing machines (classical computers) tied to the laws of classical physics will not vanish from our lives but begin to play a subordinate role to quantum computers tied to the enigmatic laws of quantum physics that deal with such non-intuitive phenomena as superposition, entanglement, collapse of the wave function, and teleportation, all occurring in Hilbert space. The aim of this 3-part paper is to introduce the readers to a core set of quantum algorithms based on the postulates of quantum mechanics, and reveal the amazing power of quantum computing.


Author(s):  
Lee Braine ◽  
Daniel Egger ◽  
Jennifer Glick ◽  
Stefan Woerner

Author(s):  
Constanze Liaw ◽  
Sergei Treil ◽  
Alexander Volberg

Abstract The classical Aronszajn–Donoghue theorem states that for a rank-one perturbation of a self-adjoint operator (by a cyclic vector) the singular parts of the spectral measures of the original and perturbed operators are mutually singular. As simple direct sum type examples show, this result does not hold for finite rank perturbations. However, the set of exceptional perturbations is pretty small. Namely, for a family of rank $d$ perturbations $A_{\boldsymbol{\alpha }}:= A + {\textbf{B}} {\boldsymbol{\alpha }} {\textbf{B}}^*$, ${\textbf{B}}:{\mathbb C}^d\to{{\mathcal{H}}}$, with ${\operatorname{Ran}}{\textbf{B}}$ being cyclic for $A$, parametrized by $d\times d$ Hermitian matrices ${\boldsymbol{\alpha }}$, the singular parts of the spectral measures of $A$ and $A_{\boldsymbol{\alpha }}$ are mutually singular for all ${\boldsymbol{\alpha }}$ except for a small exceptional set $E$. It was shown earlier by the 1st two authors, see [4], that $E$ is a subset of measure zero of the space $\textbf{H}(d)$ of $d\times d$ Hermitian matrices. In this paper, we show that the set $E$ has small Hausdorff dimension, $\dim E \le \dim \textbf{H}(d)-1 = d^2-1$.


2021 ◽  
Vol 3 (1) ◽  
Author(s):  
Davide Pastorello ◽  
Enrico Blanzieri ◽  
Valter Cavecchia

2021 ◽  
Vol 3 (1) ◽  
Author(s):  
Zhikuan Zhao ◽  
Jack K. Fitzsimons ◽  
Patrick Rebentrost ◽  
Vedran Dunjko ◽  
Joseph F. Fitzsimons

AbstractMachine learning has recently emerged as a fruitful area for finding potential quantum computational advantage. Many of the quantum-enhanced machine learning algorithms critically hinge upon the ability to efficiently produce states proportional to high-dimensional data points stored in a quantum accessible memory. Even given query access to exponentially many entries stored in a database, the construction of which is considered a one-off overhead, it has been argued that the cost of preparing such amplitude-encoded states may offset any exponential quantum advantage. Here we prove using smoothed analysis that if the data analysis algorithm is robust against small entry-wise input perturbation, state preparation can always be achieved with constant queries. This criterion is typically satisfied in realistic machine learning applications, where input data is subjective to moderate noise. Our results are equally applicable to the recent seminal progress in quantum-inspired algorithms, where specially constructed databases suffice for polylogarithmic classical algorithm in low-rank cases. The consequence of our finding is that for the purpose of practical machine learning, polylogarithmic processing time is possible under a general and flexible input model with quantum algorithms or quantum-inspired classical algorithms in the low-rank cases.


Author(s):  
Kai Li ◽  
Qing-yu Cai

AbstractQuantum algorithms can greatly speed up computation in solving some classical problems, while the computational power of quantum computers should also be restricted by laws of physics. Due to quantum time-energy uncertainty relation, there is a lower limit of the evolution time for a given quantum operation, and therefore the time complexity must be considered when the number of serial quantum operations is particularly large. When the key length is about at the level of KB (encryption and decryption can be completed in a few minutes by using standard programs), it will take at least 50-100 years for NTC (Neighbor-only, Two-qubit gate, Concurrent) architecture ion-trap quantum computers to execute Shor’s algorithm. For NTC architecture superconducting quantum computers with a code distance 27 for error-correcting, when the key length increased to 16 KB, the cracking time will also increase to 100 years that far exceeds the coherence time. This shows the robustness of the updated RSA against practical quantum computing attacks.


2021 ◽  
Vol 2 (1) ◽  
pp. 1-35
Author(s):  
Adrien Suau ◽  
Gabriel Staffelbach ◽  
Henri Calandra

In the last few years, several quantum algorithms that try to address the problem of partial differential equation solving have been devised: on the one hand, “direct” quantum algorithms that aim at encoding the solution of the PDE by executing one large quantum circuit; on the other hand, variational algorithms that approximate the solution of the PDE by executing several small quantum circuits and making profit of classical optimisers. In this work, we propose an experimental study of the costs (in terms of gate number and execution time on a idealised hardware created from realistic gate data) associated with one of the “direct” quantum algorithm: the wave equation solver devised in [32]. We show that our implementation of the quantum wave equation solver agrees with the theoretical big-O complexity of the algorithm. We also explain in great detail the implementation steps and discuss some possibilities of improvements. Finally, our implementation proves experimentally that some PDE can be solved on a quantum computer, even if the direct quantum algorithm chosen will require error-corrected quantum chips, which are not believed to be available in the short-term.


2021 ◽  
Vol 2021 (2) ◽  
Author(s):  
Andreas Blommaert ◽  
Thomas G. Mertens ◽  
Henri Verschelde

Abstract It was proven recently that JT gravity can be defined as an ensemble of L × L Hermitian matrices. We point out that the eigenvalues of the matrix correspond in JT gravity to FZZT-type boundaries on which spacetimes can end. We then investigate an ensemble of matrices with 1 ≪ N ≪ L eigenvalues held fixed. This corresponds to a version of JT gravity which includes N FZZT type boundaries in the path integral contour and which is found to emulate a discrete quantum chaotic system. In particular this version of JT gravity can capture the behavior of finite-volume holographic correlators at late times, including erratic oscillations.


Sign in / Sign up

Export Citation Format

Share Document