-
europepmc
2022
置信度 0.80
-
europepmc
2022
置信度 0.80
-
europepmc
2022
置信度 0.80
-
europepmc
2022
置信度 0.80
-
europepmc
2021
置信度 0.80
-
europepmc
2021
置信度 0.80
-
europepmc
2021
置信度 0.80
-
europepmc
2020
置信度 0.80
-
europepmc
2021
置信度 0.80
-
europepmc
2021
置信度 0.80
-
europepmc
2021
置信度 0.80
-
europepmc
2020
置信度 0.80
-
europepmc
2019
置信度 0.80
-
europepmc
2020
置信度 0.80
-
europepmc
2021
置信度 0.80
-
europepmc
2018
置信度 0.80
-
europepmc
2018
置信度 0.80
-
europepmc
2019
置信度 0.80
-
europepmc
2017
置信度 0.80
-
europepmc
2026
置信度 0.80
-
europepmc
2020
置信度 0.80
-
Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix $A$ and a vector $\stackrel{\ensuremath{\rightarrow}}{b}$, find a vector $\stackrel{\ensuremath{\rightarrow}}{x}$ s…
openalex
Aram W. Harrow, Avinatan Hassidim, Seth Lloyd
2009-10-07
置信度 0.72
CombinatoricsPhysicsQuantum algorithmMathematical physicsQuantum
-
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum computation is viewed a…
openalex
Richard Cleve, Artur Ekert, Chiara Macchiavello, Michele Mosca
1998-01-08
置信度 0.72
Quantum computerQuantum algorithmQuantumQuantum phase estimation algorithmAlgorithm
-
An unsorted database contains N records, of which just one satisfies a particular property. The problem is to identify that one record. Any classical algorithm, deterministic or probabilistic, will clearly take O (N) steps since on the average it will have to …
openalex
Lov K. Grover
1996-01-01
置信度 0.72
CitationComputer scienceInformation retrievalDatabaseAlgorithm
-
A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in computation time of at most a polynomial factor: It is not clear whether this is still true when q…
openalex
Peter W. Shor
2002-12-17
置信度 0.72
Discrete logarithmQuantum computerPost-quantum cryptographyComputer scienceCryptosystem
-
Abstract Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems and solving large systems of l…
openalex
Ashley Montanaro
2016-01-12
置信度 0.72
Quantum computerComputer scienceQuantum algorithmQuantum cryptographyAlgorithm
-
As we begin to reach the limits of classical computing, quantum computing has emerged as a technology that has captured the imagination of the scientific world. While for many years, the ability to execute quantum algorithms was only a theoretical possibility,…
openalex
Bela Bauer, Sergey Bravyi, Mario Motta, Garnet Kin-Lic Chan
2020-10-22
置信度 0.72
Quantum computerQuantum algorithmQuantum technologyQuantumComputer science
-
openalex
Isaac L. Chuang, Lieven M. K. Vandersypen, Xinlan Zhou, Debbie Leung 等
1998-05-01
置信度 0.72
Quantum computerQuantum algorithmRealization (probability)Computer scienceQuantum
-
openalex
Dominic W. Berry, Graeme Ahokas, Richard Cleve, Barry C. Sanders
2006-12-13
置信度 0.72
Sublinear functionScalingBounded functionHamiltonian (control theory)Quantum computer
-
Let U be a universe on n elements, let k be a positive integer, and let ℱ be a family of (implicitly defined) subsets of U. We consider the problems of partitioning U into k sets from ℱ, covering U with k sets from ℱ, and packing k non-intersecting sets from ℱ…
openalex
Gaspers, Serge, Li, Jerry Zirui
1996-07-18
置信度 0.72
QuantumComputer scienceAlgorithmQuantum algorithmPhysics
-
Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for classical computers. Un…
openalex
Andrew M. Childs, Wim van Dam
2010-01-15
置信度 0.72
PhysicsAlgebraic numberQuantum algorithmQuantum computerQuantum
-
Advances in theory and algorithms for electronic structure calculations must be incorporated into program packages to enable them to become routinely used by the broader chemical community. This work reviews advances made over the past five years or so that co…
openalex
Yihan Shao, Laszlo Fusti Molnar, Yousung Jung, Jörg Kußmann 等
2006-01-01
置信度 0.72
GeminalCoupled clusterWave functionQuantum chemistryDensity functional theory
-
Molecules are promising building blocks for Quantum information processing. Herein we describe how a molecular multilevel nuclear spin qubit (or qudit, where d = 4), known as TbPc 2 , showing all necessary requirements to perform as a molecular hardware platfo…
openalex
Eufemio Moreno Pineda, Clément Godfrin, Franck Balestro, Wolfgang Wernsdorfer 等
2017-11-17
置信度 0.72
QuantumSpin (aerodynamics)Quantum computerAlgorithmPhysics
-
Variational quantum algorithms are proposed to solve relevant computational problems on near term quantum devices. Popular versions are variational quantum eigensolvers and quantum approximate optimization algorithms that solve ground state problems from quant…
openalex
Lennart Bittel, Martin Kliesch
2021-09-17
置信度 0.72
Maxima and minimaQuantumQubitQuantum computerComputer science
-
This paper clarifies a recurrent structural confusion in advanced computation: the tendency to equate Quantum Mechanical (QM) computation and Cognitional Mechanics (CM) solely because both employ non-commutative structures. While the mathematical resemblance i…
openalex
Black, Mitchell, Maxwell, William
1995-11-20
置信度 0.72
Quantum Fourier transformAbelian groupPolynomialDiscrete logarithmMathematics
-
We present two new quantum algorithms that either find a triangle (a copy of $K_{3}$) in an undirected graph G on n nodes, or reject if G is triangle free. The first algorithm uses combinatorial ideas with Grover Search and makes $\tilde{O}(n^{10/7})$ queries.…
openalex
Frédéric Magniez, Miklós Sántha, Márió Szegedy
2007-01-01
置信度 0.72
Quantum algorithmQuantum computerSubroutineMathematicsCombinatorics
-
openalex
Berry, D. W., Ahokas, G., Cleve, R., Sanders, B.C.
2007-01-19
置信度 0.72
Sublinear functionQubitScalingHamiltonian (control theory)Constant (computer programming)
-
We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to be of exponential com…
openalex
Gerardo Ortíz, J. E. Gubernatis, Emanuel Knill, Raymond Laflamme
2001-07-18
置信度 0.72
Quantum computerQuantum algorithmSimple (philosophy)Invertible matrixTransformation (genetics)
-
We show that nonlinear problems including nonlinear partial differential equations can be efficiently solved by variational quantum computing. We achieve this by utilizing multiple copies of variational quantum states to treat nonlinearities efficiently and by…
openalex
Michael Lubasch, Jaewoo Joo, Pierre Moinier, Martin Kiffner 等
2020-01-06
置信度 0.72
Nonlinear systemQuantumAlgorithmQuantum algorithmComputer science
-
Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorit…
openalex
Neil Shenvi, Julia Kempe, K. Birgitta Whaley
2003-05-23
置信度 0.72
Quantum walkRandom walkQuantum algorithmOracleQuantum sort
-
Quantum computing shows great promise for the solution of many difficult problems, such as the simulation of quantum systems and the factorization of large numbers. While the theory of quantum computing is fairly well understood, it has proved difficult to imp…
openalex
J. A. Jones, M. Mosca
1998-08-01
置信度 0.72
Quantum computerQuantum algorithmQuantum error correctionPhysicsQuantum phase estimation algorithm
-
Current technology is beginning to allow us to manipulate rather than just observe individual quantum phenomena. This opens up the possibility of exploiting quantum effects to perform computations beyond the scope of any classical computer. Recently Peter Shor…
openalex
Artur Ekert, Richard Jozsa
1996-07-01
置信度 0.72
Quantum computerFactoringQuantum algorithmComputationAlgorithm
-
A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We tested one such algorithm by …
openalex
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Joshua M. Lapan 等
2001-04-20
置信度 0.72
Adiabatic quantum computationAdiabatic processHamiltonian (control theory)Quantum computerQuantum algorithm
-
The computational cost of exact methods for quantum simulation using classical computers grows exponentially with system size. As a consequence, these techniques can be applied only to small systems. By contrast, we demonstrate that quantum computers could exa…
openalex
Ivan Kassal, Stephen P. Jordan, Peter J. Love, Masoud Mohseni 等
2008-11-24
置信度 0.72
Quantum computerObservableQuantum algorithmQuadratic equationOperator (biology)
-
This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principles of quantum computing, such as a quantum bit and superposition of states. Like…
openalex
Kuk-Hyun Han, Jong-Hwan Kim
2002-12-01
置信度 0.72
Knapsack problemEvolutionary algorithmQuantum computerPopulationAlgorithm
-
We show in some detail how to implement Shor's efficient quantum algorithm for discrete logarithms for the particular case of elliptic curve groups. It turns out that for this problem a smaller quantum computer can solve problems further beyond current computi…
openalex
John Proos, Ch. Zalka
2003-07-01
置信度 0.72
Discrete logarithmPost-quantum cryptographyQuantum algorithmQuantum computerInteger factorization
-
We present a quantum algorithm for the dihedral hidden subgroup problem (DHSP) with time and query complexity $2^{O(\sqrt{\log\ N})}$. In this problem an oracle computes a function f on the dihedral group $D_N$ which is invariant under a hidden reflection in $…
openalex
Greg Kuperberg
2005-01-01
置信度 0.72
Dihedral groupQuantum algorithmMathematicsQuantum Fourier transformQubit
-
The Jones polynomial, discovered in 1984 [18], is an important knot invariant in topology. Among its many connections to various mathematical and physical areas, it is known (due to Witten [32]) to be intimately connected to Topological Quantum Field Theory (T…
openalex
Dorit Aharonov, Vaughan F. R. Jones, Zeph Landau
2008-03-18
置信度 0.72
Topological quantum field theoryMathematicsQuantum algorithmBraid groupRoot of unity
-
We construct a black box graph traversal problem that can be solved exponentially faster on a quantum computer than on a classical computer. The quantum algorithm is based on a continuous time quantum walk, and thus employs a different technique from previous …
openalex
Andrew M. Childs, Richard Cleve, E. Deotto, Edward Farhi 等
2003-06-09
置信度 0.72
Quantum walkQuantum algorithmQuantum computerTree traversalQuantum Fourier transform
-
openalex
Georg Kresse, J. Furthmüller
1996-07-01
置信度 0.72
Ab initioHamiltonian (control theory)Basis setPlane waveStatistical physics
-
Calculating the energy spectrum of a quantum system is an important task, for example to analyze reaction rates in drug discovery and catalysis. There has been significant progress in developing algorithms to calculate the ground state energy of molecules on n…
openalex
Tyson Jones, Suguru Endo, Sam McArdle, Xiao Yuan 等
2019-06-06
置信度 0.72
Excited stateQubitHamiltonian (control theory)QuantumQuantum computer
-
openalex
Lieven M. K. Vandersypen, Matthias Steffen, Gregory Breyta, Costantino S. Yannoni 等
2001-12-01
置信度 0.72
Quantum computerQuantum algorithmComputer scienceInteger factorizationQuantum phase estimation algorithm
-
Short-depth algorithms are crucial for reducing computational error on near-term quantum computers, for which decoherence and gate infidelity remain important issues. Here we present a machine-learning approach for discovering such algorithms. We apply our met…
openalex
Lukasz Cincio, Yiğit Subaşı, Andrew T Sornborger, Patrick J Coles
2018-10-18
置信度 0.72
Swap (finance)Quantum decoherencePhysicsQuantum computerQuantum
-
In this work we investigate methods to improve the efficiency and scalability of quantum algorithms for quantum chemistry applications. We propose a transformation of the electronic structure Hamiltonian in the second quantization framework into the particle-h…
openalex
Panagiotis Kl. Barkoutsos, Jérôme F. Gonthier, Igor O. Sokolov, Nikolaj Moll 等
2018-08-20
置信度 0.72
Hamiltonian (control theory)Wave functionElectronic structurePhysicsQuantum
-
We use quantum walks to construct a new quantum algorithm for element distinctness and its generalization. For element distinctness (the problem of finding two equal items among N given items), we get an $O(N^{2/3})$ query quantum algorithm. This improves the …
openalex
Andris Ambainis
2007-01-01
置信度 0.72
Element (criminal law)GeneralizationQuantum algorithmQuantumMathematics
-
Extracting useful information from large data sets can be a daunting task. Topological methods for analysing data sets provide a powerful technique for extracting such information. Persistent homology is a sophisticated tool for identifying topological feature…
openalex
Seth Lloyd, Silvano Garnerone, Paolo Zanardi
2016-01-25
置信度 0.72
Topological data analysisPersistent homologyBetti numberComputer scienceAlgorithm
-
openalex
Temple F. Smith, Michael S. Waterman
1981-03-01
置信度 0.72
Quantum computerComputer scienceQubitHuman genomeDNA sequencing
-
We discuss the fundamental role of entanglement as the essential nonclassical feature providing the computational speedup in the known quantum algorithms. We review the construction of the Fourier transform on an Abelian group and the principles underlying the…
openalex
Artur Ekert, Richard Jozsa
1998-08-15
置信度 0.72
Quantum Fourier transformQuantum algorithmAlgorithmQuantum entanglementFast Fourier transform
-
The finite element method is used to approximately solve boundary value problems for differential equations. The method discretizes the parameter space and finds an approximate solution by solving a large system of linear equations. Here we investigate the ext…
openalex
Ashley Montanaro, Sam Pallister
2016-03-17
置信度 0.72
Quantum algorithmQuantum algorithm for linear systems of equationsSpeedupQuantum phase estimation algorithmMathematics
-
The quantum algorithms of Deutsch, Simon and Shor are described in a way which highlights their dependence on the Fourier transform. The general construction of the Fourier transform on an Abelian group is outlined and this provides a unified way of understand…
openalex
Richard Jozsa
1997-01-01
置信度 0.72
Quantum Fourier transformAlgorithmQuantum algorithmFourier transformFactoring
-
openalex
Johannes Grotendorst
2000-01-01
置信度 0.72
Computer scienceAlgorithmChemistry
-
Abstract Parameterized quantum circuits (PQCs) play an essential role in the performance of many variational quantum algorithms. One challenge in implementing such algorithms is choosing an effective circuit that well represents the solution space while mainta…
openalex
Sukin Sim, Peter D. Johnson, Alán Aspuru‐Guzik
2019-10-14
置信度 0.72
AlgorithmQuantum circuitParameterized complexityElectronic circuitQubit
-
Quantum algorithms offer a dramatic speedup for computational problems in material science and chemistry. However, any near-term realizations of these algorithms will need to be optimized to fit within the finite resources offered by existing noisy hardware. H…
openalex
Brooks Foxen, Charles Neill, A. Dunsworth, P. Roushan 等
2020-09-15
置信度 0.72
QubitTerm (time)AlgorithmComputer scienceSet (abstract data type)
-
Quantum simulation of chemical systems is one of the most promising near-term applications of quantum computers. The variational quantum eigensolver, a leading algorithm for molecular simulations on quantum hardware, has a serious limitation in that it typical…
openalex
Harper R. Grimsley, Sophia E. Economou, Edwin Barnes, Nicholas J. Mayhall
2019-07-08
置信度 0.72
AnsatzWave functionQuantum computerAlgorithmQuantum
-
Abstract Variational quantum algorithms (VQAs) are expected to be a path to quantum advantages on noisy intermediate-scale quantum devices. However, both empirical and theoretical results exhibit that the deployed ansatz heavily affects the performance of VQAs…
openalex
Yuxuan Du, Tao Huang, Shan You, Min-Hsiu Hsieh 等
2022-05-23
置信度 0.72
Quantum computerComputer scienceQuantum algorithmAnsatzQuantum
-
As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available quantum computers have…
openalex
Patrick J. Coles, Stephan Eidenbenz, Scott Pakin, Adetokunbo Adedoyin 等
2018-04-10
置信度 0.72
Quantum computerComputer scienceQuantum algorithmQubitQuantum sort
-
We present a quantum algorithm for fitting a linear regression model to a given data set using the least-squares approach. Differently from previous algorithms which yield a quantum state encoding the optimal parameters, our algorithm outputs these numbers in …
openalex
Guoming Wang
2017-07-31
置信度 0.72
Linear regressionMathematicsRegressionQuantumStatistics
-
openalex
Jonathan A. Jones, Michele Mosca, Rasmus Hvass Hansen
1998-05-01
置信度 0.72
Quantum computerQuantum algorithmComputer scienceQubitQuantum
-
I show that for any number of oracle lookups up to about $\ensuremath{\pi}/4\sqrt{N},$ Grover's quantum searching algorithm gives the maximal possible probability of finding the desired element. I explain why this is also true for quantum algorithms which use …
openalex
Christof Zalka
1999-10-01
置信度 0.72
OracleQuantum algorithmQuantum computerQuantumAlgorithm
-
Abstract Implementing a gate-based quantum algorithm on an noisy intermediate scale quantum (NISQ) device has several challenges that arise from the fact that such devices are noisy and have limited quantum resources. Thus, various factors contributing to the …
openalex
Frank Leymann, Johanna Barzen
2020-08-12
置信度 0.72
Computer scienceExecutableQuantum computerAlgorithmOracle
-
As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available quantum computers have…
openalex
J. Abhijith, Adetokunbo Adedoyin, John Ambrosiano, Petr M. Anisimov 等
2022-03-28
置信度 0.72
Quantum computerComputer scienceQuantum algorithmQubitQuantum sort
-
Abstract Predicting the three-dimensional structure of a protein from its primary sequence of amino acids is known as the protein folding problem. Due to the central role of proteins’ structures in chemistry, biology and medicine applications, this subject has…
openalex
Anton Robert, Panagiotis Kl. Barkoutsos, Stefan Woerner, Ivano Tavernelli
2021-02-17
置信度 0.72
Quantum algorithmQuantum computerQuantumQubitComputer science
-
Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms to general inhomoge…
openalex
Dominic W Berry
2014-02-19
置信度 0.72
Quantum algorithm for linear systems of equationsQuantum algorithmQuantumMathematicsQuantum phase estimation algorithm
-
Quantum machine learning (QML) has been identified as one of the key fields that could reap advantages from near-term quantum devices, next to optimization and quantum chemistry. Research in this area has focused primarily on variational quantum algorithms (VQ…
openalex
Andrea Skolik, Sofiène Jerbi, Vedran Dunjko
2022-05-24
置信度 0.72
QuantumQuantum algorithmAlgorithmQ-learningComputer science
-
A novel evolutionary computing method-quantum inspired genetic algorithms-is introduced, where concepts and principles of quantum mechanics are used to inform and inspire more efficient evolutionary computing methods. The basic terminology of quantum mechanics…
openalex
A. Narayanan, Matthew Moore
2002-12-24
置信度 0.72
Quantum computerComputer scienceQuantum sortQuantum algorithmTheoretical computer science
-
Quantum walks are quantum counterparts of Markov chains. In this article, we give a brief overview of quantum walks, with emphasis on their algorithmic applications.
openalex
Andris Ambainis
2003-12-01
置信度 0.72
Computer scienceStatistical physicsQuantumTheoretical computer scienceQuantum mechanics
-
The Poisson equation occurs in many areas of science and engineering. Here we focus on its numerical solution for an equation in d dimensions. In particular we present a quantum algorithm and a scalable quantum circuit design which approximates the solution of…
openalex
Yudong Cao, Anargyros Papageorgiou, Iasonas Petras, Joseph Traub 等
2013-01-11
置信度 0.72
PhysicsPoisson's equationQuantum algorithmPoisson distributionQuantum
-
The quantum algorithms of Deutsch, Simon and Shor are described in a way which highlights their dependence on the Fourier transform. The general construction of the Fourier transform on an Abelian group is outlined and this provides a unified way of understand…
openalex
R. Jozsa
1998-01-08
置信度 0.72
Quantum Fourier transformFourier transformQuantum algorithmAlgorithmCyclotomic fast Fourier transform
-
We present two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state $|x⟩$ that is proportional to the solution of the system of linear equations $A\stackrel{\ensuremath{\rightarrow}}{x…
openalex
Yiğit Subaşı, Rolando D. Somma, Davide Orsucci
2019-02-14
置信度 0.72
Quantum algorithmHamiltonian (control theory)Quantum computerQuantum Fourier transformQuantum phase estimation algorithm
-
openalex
B. E. Kane
1998-05-01
置信度 0.72
SpinsQuantum computerSpin (aerodynamics)Computer scienceRealization (probability)
-
openalex
Gilles Brassard, Peter Høyer, Alain Tapp
2016-01-01
置信度 0.72
CollisionQuantumComputer scienceAlgorithmPhysics
-
Quantum computers can produce a quantum encoding of the solution of a system of differential equations exponentially faster than a classical algorithm can produce an explicit description. However, while high-precision quantum algorithms for linear ordinary dif…
openalex
Andrew M. Childs, Jinpeng Liu, Aaron Ostrander
2021-11-10
置信度 0.72
AlgorithmComputer scienceArtificial intelligence
-
Abstract This book treats the central physical concepts and mathematical techniques used to investigate the dynamics of open quantum systems. To provide a self-contained presentation, the text begins with a survey of classical probability theory and with an in…
openalex
Heinz‐Peter Breuer, Francesco Petruccione
2007-01-25
置信度 0.72
Open quantum systemQuantum probabilityQuantum processDensity matrixStatistical physics
-
openalex
Dominic W. Berry, Andrew M. Childs, Aaron Ostrander, Guoming Wang
2017-10-07
置信度 0.72
Quantum algorithm for linear systems of equationsQuantum algorithmMathematicsQuantum phase estimation algorithmLogarithm
-
The clock synchronization problem is to determine the time difference Delta between two spatially separated clocks. When message delivery times between the two clocks are uncertain, O(2(2n)) classical messages must be exchanged between the clocks to determine …
openalex
Isaac L. Chuang
2000-08-28
置信度 0.72
Clock synchronizationSynchronization (alternating current)Computer scienceQuantumAlgorithm
-
We present several improvements to the standard Trotter-Suzuki based algorithms used in the simulation of quantum chemistry on a quantum computer. First, we modify how Jordan-Wigner transformations are implemented to reduce their cost from linear or logarithmi…
openalex
Matthew B. Hastings, Dave Wecker, Bela Bauer, Matthias Troyer
2015-01-01
置信度 0.72
Quantum algorithmHamiltonian (control theory)Quantum computerAlgorithmQubit
-
Quantum cryptography could well be the first application of quantum mechanics at the single-quantum level. The rapid progress in both theory and experiment in recent years is reviewed, with emphasis on open questions and technological issues.
openalex
Nicolas Gisin, G. Ribordy, Wolfgang Tittel, Hugo Zbinden
2002-03-08
置信度 0.72
PhysicsQuantum cryptographyTheoretical physicsOpen quantum systemQuantum mechanics
-
openalex
Graeme Henkelman, Andri Arnaldsson, Hannes Jónsson
2005-07-20
置信度 0.72
Charge densityCharge (physics)Cluster (spacecraft)Atom (system on chip)Grid
-
Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. For quantum systems, where the physical dimension grows exponentially, finding the eigenvalues of certain operators is one such intractable probl…
openalex
Alberto Peruzzo, Jarrod R. McClean, Peter Shadbolt, Man‐Hong Yung 等
2014-07-23
置信度 0.72
Eigenvalues and eigenvectorsQuantumComputer scienceQuantum computerCoherence (philosophical gambling strategy)
-
We present quantum algorithms for performing nearest-neighbor learning and $k$--means clustering. At the core of our algorithms are fast and coherent quantum methods for computing the Euclidean distance both directly and via the inner product which we couple w…
openalex
Nathan Wiebe, Ashish Kapoor, Krysta M. Svore
2015-03-01
置信度 0.72
Nearest-neighbor chain algorithmLarge margin nearest neighborNearest neighbor graphQuantum algorithmk-nearest neighbors algorithm
-
The Schwinger model (quantum electrodynamics in 1+1 dimensions) is a testbed for the study of quantum gauge field theories. We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. …
openalex
Alexander F. Shaw, Pavel Lougovski, Jesse R. Stryker, Nathan Wiebe
2020-08-10
置信度 0.72
ObservableLattice (music)Quantum algorithmQuantum field theoryQuantum computer
-
The problem of Phase Estimation (or Amplitude Estimation) admits a quadratic quantum speedup. Wang, Higgott and Brierley [2019, Phys. Rev. Lett. 122 140504] have shown that there is a continuous trade-off between quantum speedup and circuit depth (by defining …
arxiv
Duarte Magano, Miguel Murça
2022-07-29T17:57:03Z
置信度 0.78
quant-ph
-
Ref.[BCOW17] introduced a pioneering quantum approach (coined BCOW algorithm) for solving linear differential equations with optimal error tolerance. Originally designed for a specific class of diagonalizable linear differential equations, the algorithm was ex…
arxiv
Xiaojing Dong, Yizhe Peng, Qili Tang, Yin Yang 等
2024-08-03T11:59:22Z
置信度 0.78
quant-ph
-
Quantum computers provide an opportunity to efficiently sample from probability distributions that include non-trivial interference effects between amplitudes. Using a simple process wherein all possible state histories can be specified by a binary tree, we co…
arxiv
Davide Provasoli, Benjamin Nachman, Wibe A. de Jong, Christian W Bauer
2019-01-23T22:06:35Z
置信度 0.78
quant-ph
-
Quantum algorithms are getting extremely popular due to their potential to significantly outperform classical algorithms. Yet, applying quantum algorithms to optimization problems meets challenges related to the efficiency of quantum algorithms training, the s…
arxiv
M. R. Perelshtein, A. I. Pakhomchik, Ar. A. Melnikov, M. Podobrii 等
2023-05-23T16:17:57Z
置信度 0.78
quant-phmath.OC
-
Topological data analysis (TDA) is an emergent field of data analysis. The critical step of TDA is computing the persistent Betti numbers. Existing classical algorithms for TDA are limited if we want to learn from high-dimensional topological features because …
arxiv
Ryu Hayakawa
2021-10-31T09:02:01Z
置信度 0.78
quant-ph
-
Simulating the dynamics and the non-equilibrium steady state of an open quantum system are hard computational tasks on conventional computers. For the simulation of the time evolution, several efficient quantum algorithms have recently been developed. However,…
arxiv
Nathan Ramusat, Vincenzo Savona
2020-08-17T07:45:42Z
置信度 0.78
quant-ph
-
In the context of evolutionary quantum computing in the literal meaning, a quantum crossover operation has not been introduced so far. Here, we introduce a novel quantum genetic algorithm which has a quantum crossover procedure performing crossovers among all …
arxiv
Akira SaiToh, Robabeh Rahimi, Mikio Nakahara
2012-02-09T16:04:52Z
置信度 0.78
cs.NEquant-ph
-
We initiate the study of quantum algorithms for escaping from saddle points with provable guarantee. Given a function $f\colon\mathbb{R}^{n}\to\mathbb{R}$, our quantum algorithm outputs an $ε$-approximate second-order stationary point using $\tilde{O}(\log^{2}…
arxiv
Chenyi Zhang, Jiaqi Leng, Tongyang Li
2020-07-20T16:42:53Z
置信度 0.78
quant-phcs.DScs.LGmath.OC
-
We present classical and quantum algorithms based on spectral methods for a problem in tensor principal component analysis. The quantum algorithm achieves a quartic speedup while using exponentially smaller space than the fastest classical spectral algorithm, …
arxiv
M. B. Hastings
2019-07-30T03:45:27Z
置信度 0.78
quant-phcs.DScs.LG