The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The operators b i k , b † i k can always be mapped to products of Pauli matrices, i.e., nonlocal spin operators, using the Jordan-Wigner transformation”
From Quantum Simulation of Interacting Fermion Lattice Models in Trapped Ions (2012) · cites this paper as [28]
In the citing paper
“Only in one spatial dimension, and for couplings extended to a reduced number of neighbors, the correspondence is from a local model to a similar one [28].”
From Quantum Simulation of Interacting Fermion Lattice Models in Trapped Ions (2012) · cites this paper as [28]
In the citing paper
“We map products of fermionic operators onto nonlocal spin operators and decompose the resulting dynamics in efficient steps with Trotter methods, yielding an overall protocol that employs only polynomial resources.”
From Quantum Simulation of Interacting Fermion Lattice Models in Trapped Ions (2012) · cites this paper as [28]
In the citing paper
“This technique establishes a correspondence between a set of fermionic operators and a set of spin operators, transforming a local Hamiltonian of fermions onto a nonlocal Hamiltonian of spins.”
From Quantum Simulation of Interacting Fermion Lattice Models in Trapped Ions (2012) · cites this paper as [28]
In the citing paper
“After the four photons pass through PBS 3 , PBS 4 and PBS 5 , we observed the Hong-Ou-Mandel type interference among the four photons [20, 21].”
From Experimental Quantum Computing to Solve Systems of Linear Equations (2013) · cites this paper as [20]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306 · cited 1×
“There are three main applications of quantum computer algorithms: the hidden subgroup problem, with Shor’s factorization algorithm one important example [1], search problems [2], and simulation of quantum systems [3, 4].”
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 4×
“Here we apply the higher-order integrators of Suzuki [12, 13] to reduce the temporal scaling from t 3 / 2 [5] or t 2 [4] to the slightly superlinear scaling t 1+1 / 2 k , where k is the order of the integrator and may be an arbitrarily large integer.”
BackgroundMethodInfluentialQuantum random-walk search algorithm
Shenvi, N., Kempe, J., & Whaley, K. B. (2003) · Physical Review A · doi:10.1103/physreva.67.052307 · Cited by 1,150
Locality in Distributed Graph Algorithms
Linial, N. (1992) · SIAM Journal on Computing · doi:10.1137/0221015 · Cited by 870
Suzuki, M. (1990) · Physics Letters A · doi:10.1016/0375-9601(90)90962-n · Cited by 842
Exponential algorithmic speedup by a quantum walk
Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D. A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780552 · Cited by 825
Self-citationSuzuki, M. (1991) · Journal of Mathematical Physics · doi:10.1063/1.529425 · Cited by 761
Spatial search by quantum walk
Childs, A. M., & Goldstone, J. (2004) · Physical Review A · doi:10.1103/physreva.70.022314 · Cited by 725
The Complexity of the Local Hamiltonian Problem
Kempe, J., Kitaev, A., & Regev, O. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704445226 · Cited by 648
Research works printed but not linked: 6
- Shor, P. W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: Proc. 35th Symp. on Foundations of Computer Science, Los Alamitos, CA:IEEE, 1994, pp. 124–134
- Ambainis, A.: Quantum walk algorithm for element distinctness. In: Proc. 45th Symp. on Foundations of Computer Science, Los Alamitos, CA: IEEE, 2004, pp. 22–31
- Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proc. 16th ACM-SIAM SODA, Philadelphia, PA:SIAM, 2005, pp. 1099–1108
- Childs A.M. Quantum information processing in continuous time. Ph.D. Thesis, Massachusetts Institute of Technology, 2004
- Ahokas, G.: Improved algorithms for approximate quantum Fourier transforms and sparse Hamiltonian simulations. M.Sc. Thesis, University of Calgary, 2004
- Nielsen M.A., Chuang I.L., (2000) Quantum Computation and Quantum Information. Cambridge, Cambridge University Press
Cited by
Sorted by citations
Items 201–300 of 686
Quantum Permutation Synchronization
Birdal, T., Golyanik, V., Theobalt, C., & Guibas, L. J. (2021) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr46437.2021.01292 · Cited by 38
Bauman, N. P., Chládek, J., Veis, L., Pittner, J., & Kowalski, K. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abf602 · Cited by 38
Embedding classical dynamics in a quantum computer
Giannakis, D., Ourmazd, A., Pfeffer, P., Schumacher, J., & Sławińska, J. (2022) · Physical Review A · doi:10.1103/physreva.105.052404 · Cited by 40
Efficient Hamiltonian simulation for solving option price dynamics
Gonzalez-Conde, J., Rodríguez‐Rozas, Á., Solano, E., & Sanz, M. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043220 · Cited by 36
Hamiltonian simulation with nearly optimal dependence on spectral norm
Low, G. H. (2019) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3313276.3316386 · Cited by 35
Quantum algorithm for the nonlinear dimensionality reduction with arbitrary kernel
Li, Y., Zhou, R., Xu, R., Hu, W., & Fan, P. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abbe66 · Cited by 35
Design and analysis of quantum powered support vector machines for malignant breast cancer diagnosis
Vashisth, S., Dhall, I., & Aggarwal, G. (2021) · Journal of Intelligent Systems · doi:10.1515/jisys-2020-0089 · Cited by 35
Quantum computing for fusion energy science applications
Joseph, I., Shi, Y. C., Porter, M. D., Castelli, A. R., Geyko, V., Graziani, F. R., Libby, S. B., & DuBois, J. L. (2023) · Physics of Plasmas · doi:10.1063/5.0123765 · Cited by 42
A Trotter-Suzuki approximation for Lie groups with applications to Hamiltonian simulation
Somma, R. D. (2016) · Journal of Mathematical Physics · doi:10.1063/1.4952761 · Cited by 33
Simulation of single-qubit open quantum systems
Sweke, R., Sinayskiy, I., & Petruccione, F. (2014) · Physical Review A · doi:10.1103/physreva.90.022331 · Cited by 33
Chowdhury, T. A., Yu, K., Shamim, M. A., Kabir, M. L., & Sufian, R. S. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033107 · Cited by 45
Efficient quantum circuits for Szegedy quantum walks
Loke, T., & Wang, J. B. (2017) · Annals of Physics · doi:10.1016/j.aop.2017.04.006 · Cited by 35
EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
Berry, D. W., Childs, A. M., Cleve, R., Kothari, R., & Somma, R. D. (2017) · Forum of Mathematics Sigma · doi:10.1017/fms.2017.2 · Cited by 39
Self-citationLin, J., Bao, W., Zhang, S., Li, T., & Wang, X. (2019) · Physics Letters A · doi:10.1016/j.physleta.2019.06.026 · Cited by 32
Faster quantum and classical SDP approximations for quadratic binary optimization
Brandão, F. G. S. L., Kueng, R., & França, D. S. (2022) · Quantum · doi:10.22331/q-2022-01-20-625 · Cited by 43
Heisenberg-limited quantum phase estimation of multiple eigenvalues with few control qubits
Dutkiewicz, A., Terhal, B. M., & Brien, T. E. O. A. (2022) · Quantum · doi:10.22331/q-2022-10-06-830 · Cited by 32
Quantum simulation of real-space dynamics
Childs, A. M., Leng, J., Li, T., Liu, J.-P., & Zhang, C. (2022) · Quantum · doi:10.22331/q-2022-11-17-860 · Cited by 55
Accelerated Quantum Monte Carlo with Mitigated Error on Noisy Quantum Computer
Yang, Y., Lu, B.-N., & Li, Y. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040361 · Cited by 32
Quantum algorithms from fluctuation theorems: Thermal-state preparation
Holmes, Z., Muraleedharan, G., Somma, R. D., Subaşı, Y., & Şahinoğlu, B. (2022) · Quantum · doi:10.22331/q-2022-10-06-825 · Cited by 40
Bauman, N. P., & Kowalski, K. (2022) · Materials Theory · doi:10.1186/s41313-022-00046-8 · Cited by 31
Efficient quantum circuits for arbitrary sparse unitaries
Jordan, S. P., & Wocjan, P. (2009) · Physical Review A · doi:10.1103/physreva.80.062301 · Cited by 31
Efficient discrete-time simulations of continuous-time quantum query algorithms
Cleve, R., Gottesman, D., Mosca, M., Somma, R. D., & Yonge-Mallo, D. L. (2009) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1536414.1536471 · Cited by 40
Self-citationProgrammable quantum simulation by dynamic Hamiltonian engineering
Hayes, D., Flammia, S. T., & Biercuk, M. J. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/8/083027 · Cited by 36
Quantum Circuits for partial differential equations via Schrödingerisation
Hu, J., Jin, S., Liu, N., & Zhang, L. (2024) · Quantum · doi:10.22331/q-2024-12-12-1563 · Cited by 30
Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation
Vazquez, A. C., Egger, D. J., Ochsner, D., & Woerner, S. (2023) · Quantum · doi:10.22331/q-2023-07-25-1067 · Cited by 38
Complexity of Implementing Trotter Steps
Low, G. H., Su, Y., Tong, Y., & Tran, M. C. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020323 · Cited by 41
Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions
Moosa, M., Watts, T. W., Chen, Y., Sarma, A., & McMahon, P. L. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acfc62 · Cited by 29
Quantum simulations employing connected moments expansions
Kowalski, K., & Peng, B. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0030688 · Cited by 29
Liu, Z., Shen, P.-X., Li, W., Duan, L.-M., & Deng, D.-L. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/aca55d · Cited by 29
Quantum Algorithm for Boolean Equation Solving and Quantum Algebraic Attack on Cryptosystems
Chen, Y.-A., & Gao, X.-S. (2021) · Journal of Systems Science and Complexity · doi:10.1007/s11424-020-0028-6 · Cited by 28
Time-Dependent Hamiltonian Simulation Using Discrete-Clock Constructions
Watkins, J., Wiebe, N., Roggero, A., & Lee, D. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.040316 · Cited by 42
Quantum interactive proofs and the complexity of separability testing
Gutoski, G., Hayden, P. M., Milner, K., & Wilde, M. M. (2015) · Theory of Computing · doi:10.4086/toc.2015.v011a003 · Cited by 39
Wang, Q., Li, M., Monroe, C. R., & Nam, Y. (2021) · Quantum · doi:10.22331/q-2021-07-26-509 · Cited by 27
Error-resilient Monte Carlo quantum simulation of imaginary time
Huo, M., & Li, Y. (2023) · Quantum · doi:10.22331/q-2023-02-09-916 · Cited by 29
Projection algorithm for state preparation on quantum computers
Stetcu, I., Baroni, A., & Carlson, J. (2023) · Physical Review C · doi:10.1103/physrevc.108.l031306 · Cited by 27
High-Order Randomized Compiler for Hamiltonian Simulation
Nakaji, K., Bagherimehrab, M., & Aspuru‐Guzik, A. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020330 · Cited by 27
Quantum-enhanced analysis of discrete stochastic processes
Blank, C., Park, D. K., & Petruccione, F. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00459-2 · Cited by 27
Quantum Algorithm for Linear Non-unitary Dynamics with Near-Optimal Dependence on All Parameters
An, D., Childs, A. M., & Lin, L. (2025) · Communications in Mathematical Physics · doi:10.1007/s00220-025-05509-w · Cited by 99
Quantum circuit design for accurate simulation of qudit channels
Wang, D., & Sanders, B. C. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/4/043004 · Cited by 26
Self-citationQuantum algorithm for the simulation of open-system dynamics and thermalization
Su, H.-Y., & Li, Y. (2020) · Physical Review A · doi:10.1103/physreva.101.012328 · Cited by 27
Compiling basic linear algebra subroutines for quantum computers
Zhao, L., Zhao, Z., Rebentrost, P., & Fitzsimons, J. F. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-021-00048-8 · Cited by 26
A quantum hamiltonian simulation benchmark
Dong, Y., Whaley, K. B., & Lin, L. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00636-x · Cited by 31
Quantum algorithms for grid-based variational time evolution
Ollitrault, P. J., Jandura, S., Miessen, A., Burghardt, I., Martinazzo, R., Tacchino, F., & Tavernelli, I. (2023) · Quantum · doi:10.22331/q-2023-10-12-1139 · Cited by 31
Fragmented imaginary-time evolution for early-stage quantum signal processors
Silva, T. D. L., Taddei, M. M., Carrazza, S., & Aolita, L. (2023) · Scientific Reports · doi:10.1038/s41598-023-45540-2 · Cited by 34
Fermionic models with superconducting circuits
Heras, U. L., García-Álvarez, L., Mezzacapo, A., Solano, E., & Lamata, L. (2015) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-015-0021-5 · Cited by 26
Bauman, N. P., & Kowalski, K. (2022) · The Journal of Chemical Physics · doi:10.1063/5.0076260 · Cited by 28
Effective light cone and digital quantum simulation of interacting bosons
Kuwahara, T., Vu, T. V., & Saito, K. (2024) · Nature Communications · doi:10.1038/s41467-024-46501-7 · Cited by 33
Compact quantum algorithms for time-dependent differential equations
Bharadwaj, S. S., & Sreenivasan, K. R. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.023262 · Cited by 25
Quantum Simulation of Tunneling in Small Systems
Sornborger, A. T. (2012) · Scientific Reports · doi:10.1038/srep00597 · Cited by 25
Continuous-variable gate decomposition for the Bose-Hubbard model
Kalajdzievski, T. Z., Weedbrook, C., & Rebentrost, P. (2018) · Physical Review A · doi:10.1103/physreva.97.062311 · Cited by 27
Divide and conquer approach to quantum Hamiltonian simulation
Hadfield, S., & Papageorgiou, A. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aab1ef · Cited by 25
Quantum Algorithms for Similarity Measurement Based on Euclidean Distance
Yu, K., Guo, G., Li, J., & Lin, S. (2020) · International Journal of Theoretical Physics · doi:10.1007/s10773-020-04567-1 · Cited by 25
Algorithmic Shadow Spectroscopy
Chan, H. H. S., Meister, R., Goh, M. L., & Koczor, B. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010352 · Cited by 36
Quantum Algorithms for Quantum Molecular Systems: A Survey
Zhang, Y., Zhang, X., Sun, J., Lin, H., Huang, Y., Lv, D., & Yuan, X. (2025) · Wiley Interdisciplinary Reviews Computational Molecular Science · doi:10.1002/wcms.70020 · Cited by 30
Simulating Effective QED on Quantum Computers
Stetina, T. F., Ciavarella, A. N., Li, X., & Wiebe, N. (2022) · Quantum · doi:10.22331/q-2022-01-18-622 · Cited by 29
A universal quantum circuit scheme for finding complex eigenvalues
Daskin, A., Grama, A. Y., & Kais, S. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0654-1 · Cited by 24
Efficient quantum circuits for dense circulant and circulant like operators
Zhou, S., & Wang, J. B. (2017) · Royal Society Open Science · doi:10.1098/rsos.160906 · Cited by 24
Quantum second-order optimization algorithm for general polynomials
Gao, P., Li, K., Wei, S., & Long, G. (2021) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-021-1725-9 · Cited by 25
Preparing topological projected entangled pair states on a quantum computer
Schwarz, M., Temme, K., Verstraete, F., Pérez-Garcı́a, D., & Cubitt, T. S. (2013) · Physical Review A · doi:10.1103/physreva.88.032321 · Cited by 24
Programmable Quantum Simulation by Dynamic Hamiltonian EngineeringPreprint
Hayes, D., Flammia, S. T., & Biercuk, M. J. (2016) · Cited by 24
Hagan, M., & Wiebe, N. (2023) · Quantum · doi:10.22331/q-2023-11-14-1181 · Cited by 33
Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation
Rendon, G., Watkins, J., & Wiebe, N. (2024) · Quantum · doi:10.22331/q-2024-02-26-1266 · Cited by 34
Algorithms for Quantum Computers
Smith, J., & Mosca, M. (2012) · Springer eBooks · doi:10.1007/978-3-540-92910-9_43 · Cited by 24
Entanglement accelerates quantum simulation
Zhao, Q., Zhou, Y., & Childs, A. M. (2025) · Nature Physics · doi:10.1038/s41567-025-02945-2 · Cited by 22
Efficient quantum thermal simulation
Chen, C.-F., Kastoryano, M. J., Brandão, F. G. S. L., & Gilyén, A. (2025) · Nature · doi:10.1038/s41586-025-09583-x · Cited by 45
Product formulas for exponentials of commutators
Childs, A. M., & Wiebe, N. (2013) · Journal of Mathematical Physics · doi:10.1063/1.4811386 · Cited by 22
Quantum Computing Method for Solving Electromagnetic Problems Based on the Finite Element Method
Zhang, J., Feng, F., & Zhang, Q. (2023) · IEEE Transactions on Microwave Theory and Techniques · doi:10.1109/tmtt.2023.3297406 · Cited by 22
Simulating lossy Gaussian boson sampling with matrix-product operators
Liu, M., Oh, C., Liu, J., Jiang, L., & Alexeev, Y. (2023) · Physical Review A · doi:10.1103/physreva.108.052604 · Cited by 28
Average-Case Speedup for Product Formulas
Chen, C.-F., & Brandão, F. G. S. L. (2024) · Communications in Mathematical Physics · doi:10.1007/s00220-023-04912-5 · Cited by 36
Circuit complexity of quantum access models for encoding classical data
Zhang, X., & Yuan, X. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00835-8 · Cited by 33
Doubling the efficiency of Hamiltonian simulation via generalized quantum signal processing
Berry, D. W., Motlagh, D., Pantaleoni, G., & Wiebe, N. (2024) · Physical Review A · doi:10.1103/physreva.110.012612 · Cited by 21
Self-citationA hybrid quantum-classical framework for computational fluid dynamics
Ye, C.-C., An, N.-B., Ma, T.-Y., Dou, M., Bai, W., Sun, D.-J., Chen, Z., & Guo, G. (2024) · Physics of Fluids · doi:10.1063/5.0238193 · Cited by 26
Generic detection-based error mitigation using quantum autoencoders
Zhang, X., Kong, W., Farooq, M. U., Yung, M., Guo, G., & Wang, X. (2021) · Physical Review A · doi:10.1103/physreva.103.l040403 · Cited by 24
Stability of the Trotter–Suzuki decomposition
Dhand, I., & Sanders, B. C. (2014) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/47/26/265206 · Cited by 21
Self-citationOptimal Trotterization in universal quantum simulators under faulty control
Knee, G. C., & Munro, W. J. (2015) · Physical Review A · doi:10.1103/physreva.91.052327 · Cited by 21
Cohn, J., Yang, F., Najafi, K., Jones, B., & Freericks, J. K. (2020) · Physical Review A · doi:10.1103/physreva.102.022622 · Cited by 20
Simple digital quantum algorithm for symmetric first-order linear hyperbolic systems
Fillion‐Gourdeau, F., & Lorin, E. (2018) · Numerical Algorithms · doi:10.1007/s11075-018-0639-3 · Cited by 20
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0002 · Cited by 20
Rančić, M. J. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.l012021 · Cited by 19
Efficient quantum circuits for continuous-time quantum walks on composite graphs
Loke, T., & Wang, J. B. (2017) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aa53a9 · Cited by 21
Simulating Energy Transfer in Molecular Systems with Digital Quantum Computers
Lee, C., Lau, J. W. Z., Shi, L., & Kwek, L. C. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.1c01296 · Cited by 20
Quantum simulation of second-quantized Hamiltonians in compact encoding
Kirby, W. M., Hadi, S., Kreshchuk, M., & Love, P. J. (2021) · Physical Review A · doi:10.1103/physreva.104.042607 · Cited by 19
What the foundations of quantum computer science teach us about chemistry
McClean, J. R., Rubin, N. C., Lee, J., Harrigan, M. P., O’Brien, T. E., Babbush, R., Huggins, W. J., & Huang, H.-Y. (2021) · The Journal of Chemical Physics · doi:10.1063/5.0060367 · Cited by 20
Implications of Quantum Science on Industry 4.0: Challenges and Opportunities
Ahuja, N. J., & Dutt, S. (2022) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-3-031-04613-1_6 · Cited by 19
Digital Quantum Simulation of the Spin-Boson Model under Markovian Open-System Dynamics
Burger, A., Kwek, L. C., & Poletti, D. (2022) · Entropy · doi:10.3390/e24121766 · Cited by 20
Synthesizing efficient circuits for Hamiltonian simulation
Mukhopadhyay, P., Wiebe, N., & Zhang, H. T. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00697-6 · Cited by 20
Probabilistic Interpolation of Quantum Rotation Angles
Koczor, B., Morton, J. J. L., & Benjamin, S. C. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.130602 · Cited by 27
Zhao, H., Bukov, M., Heyl, M., & Moessner, R. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.010603 · Cited by 22
Zeng, P., Sun, J., Jiang, L., & Zhao, Q. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010359 · Cited by 32
Analyzing Many-Body Localization with a Quantum Computer
Bauer, B., & Nayak, C. (2014) · Physical Review X · doi:10.1103/physrevx.4.041021 · Cited by 18
Two-Message Quantum Interactive Proofs and the Quantum Separability Problem
Hayden, P. M., Milner, K., & Wilde, M. M. (2013) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2013.24 · Cited by 18
Doronin, S. I., Fel’dman, E. B., & Zenchuk, A. I. (2020) · Quantum Information Processing · doi:10.1007/s11128-019-2570-5 · Cited by 18
Quantum computation of thermal averages in the presence of a sign problem
Clemente, G., Cardinali, M., Bonati, C., Calore, E., Cosmai, L., D’Elia, M., Gabbana, A., Rossini, D., Schifano, S. F., Tripiccione, R., et al. (2020) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.101.074510 · Cited by 24
Quantum linear system solvers: A survey of algorithms and applications
Morales, M. E. S., Pira, L., Schleich, P., Koor, K., Costa, P. C. S., An, D., Aspuru‐Guzik, A., Lin, L., Rebentrost, P., & Berry, D. W. (2026) · Reviews of Modern Physics · doi:10.1103/x6gh-d8gh · Cited by 70
Self-citationVariational quantum solver employing the PDS energy functional
Peng, B., & Kowalski, K. (2021) · Quantum · doi:10.22331/q-2021-06-10-473 · Cited by 18
O’Brien, T. E., Ioffe, L. B., Su, Y., Fushman, D., Neven, H., Babbush, R., & Smelyanskiy, V. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030345 · Cited by 25
Quantum spectral clustering algorithm for unsupervised learning
Li, Q., Huang, Y., Jin, S., Hou, X., & Wang, X. (2022) · Science China Information Sciences · doi:10.1007/s11432-022-3492-x · Cited by 17
Schuld, M., & Petruccione, F. (2018) · Quantum science and technology · doi:10.1007/978-3-319-96424-9_5 · Cited by 17
Obtaining a linear combination of the principal components of a matrix on quantum computers
Daskin, A. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1388-7 · Cited by 17
Magic state distillation and gate compilation in quantum algorithms for quantum chemistry
Trout, C. J., & Brown, K. R. (2015) · International Journal of Quantum Chemistry · doi:10.1002/qua.24856 · Cited by 17
Metadata
- Authors
- Berry, D. W., Ahokas, G., Cleve, R., & Sanders, B. C.
- Affiliations
- The University of Queensland (AU)
- University of Calgary (CA)
- University of Waterloo (CA)
- Venue
- Communications in Mathematical Physics
- Published
- 2006-12-14
- Volume
- 270
- Issue
- 2
- Pages
- 359-371
- ISSN
- 0010-3616 (ISSN-L)
- 1432-0916
- OpenAlex
- W2064906820
- Cited by
- 692
- References
- 15
- Citations by year
- 2026: 47 · 2025: 109 · 2024: 83 · 2023: 95 · 2022: 54 · 2021: 63 · 2020: 38 · 2019: 36 · 2018: 23 · 2017: 22 · 2016: 14 · 2015: 18 · 2014: 23 · 2013: 14 · 2012: 18
- FWCI
- 6.09
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Communications in Mathematical Physics (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- quantum simulation, sparse Hamiltonians, quantum algorithms, quantum state evolution, sublinear time complexity, time complexity lower bounds
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
