Development of research network on Quantum Annealing Computation and Information using Google Scholar data

Abstract

We build and analyze the network of hundred top cited nodes (research papers and books from Google Scholar; strength or citation of the nodes range from about 44000 up to 100) starting early 1980 to till last year. These searched publications (papers, books) are based on Quantum Annealing Computation and Information categorized in four different sets: A) Quantum/Transverse Field Spin Glass Model, B) Quantum Annealing, C) Quantum Adiabatic Computation and D) Quantum Computation Information in the title or abstract of the searched publications. We fitted the growth in the annual number of publication ($n_p$) in each of these four categories A to D to the form $n_p\sim \exp (t/\tau )$ where $t$ denotes the time in year. We found the scaling time $\tau$ to be of order about 10 years for category A and C whereas $\tau$ is order of about 5 years for category B and D.

In press, Phil. Tran. A

References in corpus (18)

• Simulated Quantum Computation of Molecular Energies
• Fault-tolerant quantum computation with high threshold in two dimensions
• Mathematical Foundation of Quantum Annealing
• Bounds for the adiabatic approximation with applications to quantum computation
• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• Simple proof of equivalence between adiabatic quantum computation and the circuit model
• How Powerful is Adiabatic Quantum Computation?
• Quantum Adiabatic Brachistochrone
• Decoherence in adiabatic quantum computation
• Many-body mobility edge in a mean-field quantum spin glass
• Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
• Towards Fault Tolerant Adiabatic Quantum Computation
• Noise resistance of adiabatic quantum computation using random matrix theory
• Quantum and Classical Glass Transitions in $LiH{o}_x{Y}_{1-x}{F}_4$
• Existence of replica-symmetry breaking in quantum glasses
• A Variational Ansatz for the Ground State of the Quantum Sherrington-Kirkpatrick Model
• A comparison between D-wave and a classical approximation algorithm and a heuristic for computing the ground state of an Ising spin glass
• Unraveling the origin of higher success probabilities in quantum versus semi-classical annealing