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
Flagged first, then by citations
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 501–600 of 686
Fundamental Physics and Computation: The Computer-Theoretic Framework
Miguel-Tomé, S., Lázaro, Á. L. S., & Alonso-Romero, L. (2022) · Universe · doi:10.3390/universe8010040 · Cited by 3
Correspondence between open bosonic systems and stochastic differential equations
Engel, A., & Parker, S. (2023) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-023-04205-9 · Cited by 3
Administration, U. A. S. F. H. R. A., Alexeev, Y., USDOE Office of Science (SC), Eidenbenz, S., Mezzacapo, A., & Pakin, S. (2023) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/2280557 · Cited by 3
Quantum spectroscopy of topological dynamics via a supersymmetric HamiltonianPreprint
Yamauchi, H., Kanno, S., Sato, Y., Tezuka, H., Shimada, Y.-A., Kaminishi, E., & Yamamoto, N. (2026) · Research Square · doi:10.21203/rs.3.rs-8563037/v1 · Cited by 3
Resource-efficient quantum phase estimation by randomization
Wang, Y. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/addee9 · Cited by 2
Deterministic Quantum Search on All Laplacian Integral Graphs
Li, G., Luo, J., Feng, S., & Li, L. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500606 · Cited by 2
End-to-End Quantum Algorithm for Nonlinear Fluid Dynamics with Bounded Quantum Advantage
Jennings, D., Korzekwa, K., Lostaglio, M., Ashworth, R., Marsili, E., & Rolston, S. (2026) · PRX Quantum · doi:10.1103/xysy-q3fp · Cited by 2
Treespilation: architecture- and state-optimised fermion-to-qubit mappings
Miller, A., Glos, A., & Zimborás, Z. (2026) · npj Quantum Information · doi:10.1038/s41534-025-01170-2 · Cited by 2
Quo Vadis, Quantum Machine Learning?: Quantum kernel methods meet Earth observation
Miroszewski, A., Nalepa, J., Wijata, A. M., B, J. M. A., Saux, B. L., & Sebastianelli, A. (2026) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2025.3596291 · Cited by 2
Anonymous, & Wei, T.-C. (2026) · Physical Review A · doi:10.1103/nbn3-vggs · Cited by 2
Quantum simulation of water-molecule bond angles using an NMR quantum computer
Xu, F., Yang, F., Wei, C., Chen, X., Wei, S., Wang, H., Li, J., & Xin, T. (2024) · Physical Review A · doi:10.1103/physreva.109.042618 · Cited by 2
Trotterless Simulation of Open Quantum Systems for NISQ Quantum Devices
Burdine, C., & Blair, E. P. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400240 · Cited by 3
Kendon, V. M. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1800-9_148 · Cited by 2
Quantum Variational Bayes on Manifolds
Lopatnikova, A., & Tran, M. (2023) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49357.2023.10096708 · Cited by 2
QRADCOM: Quantum Assisted Framework for Joint Detection and Estimation in Radar Communications
Laskar, M. R., Naskar, S., & Dutta, A. K. (2023) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2023-spring57618.2023.10200135 · Cited by 2
Dynamics of symmetry-protected topological matter on a quantum computer
Mercado, M., Chen, K. J., Darekar, P. H., Nakano, A., Felice, R. D., & Haas, S. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.110.075116 · Cited by 3
Existence and uniqueness of solutions of the Koopman–von Neumann equation on bounded domains
Stengl, M., Gelß, P., Klus, S., & Pokutta, S. (2024) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad6f7d · Cited by 8
Acceleration of rovibrational spectrum calculations through sparsity techniques
Das, S., & Rauhut, G. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0240689 · Cited by 2
High-order schemes for solving partial differential equations on a quantum computer
Arseniev, B., Guskov, D., Sengupta, R., & Zacharov, I. (2025) · Physical Review A · doi:10.1103/physreva.111.042625 · Cited by 2
Quantum and classical algorithms for nonlinear unitary dynamics
Brüstle, N., & Wiebe, N. (2025) · Quantum · doi:10.22331/q-2025-05-13-1741 · Cited by 2
Seneviratne, A., Walters, P., & Wang, F. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0258227 · Cited by 3
Gapped Clique Homology on Weighted Graphs Is \({\text{QMA}_1}\)-Hard and Contained in QMA
King, R., & Kohler, T. (2026) · SIAM Journal on Computing · doi:10.1137/24m1710243 · Cited by 2
Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores
Liu, Y., & Zhang, S. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-19647-3_20 · Cited by 2
A method for exact simulation of quantum dynamics
D’Alessandro, D., & Romano, R. (2011) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/45/2/025308 · Cited by 2
Optimization of quantum Hamiltonian evolution: From two projection operators to local Hamiltonians
Patel, A. D., & Priyadarsini, A. (2016) · International Journal of Quantum Information · doi:10.1142/s0219749916500271 · Cited by 2
Optimal control protocols can be exponentially accelerated by quantum algorithms
Sun, H., Zhang, J., Wu, R.-B., RABITZ, H. A., & Tarn, T. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798682 · Cited by 2
A quantum eigensolver for symmetric tridiagonal matrices
Wang, H., & Xiang, H. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2211-z · Cited by 2
Laskar, M. R., & Dutta, A. K. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3329213 · Cited by 2
Quantum Algorithm for the Linear Vlasov Equation with Collisions
Ameri, A., Ye, E., Cappellaro, P., Krovi, H., & Loureiro, N. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.10185 · Cited by 3
Shadow-based quantum subspace algorithm for the nuclear shell model
Yang, R., Wang, T., Lu, B.-N., Li, Y., & Xu, X. (2025) · Physical Review A · doi:10.1103/physreva.111.012620 · Cited by 5
Quantum approximated cloning-assisted density matrix exponentiation
Rodriguez-Grasa, P., Ibarrondo, R., Gonzalez-Conde, J., Ban, Y., Rebentrost, P., & Sanz, M. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013264 · Cited by 2
Universal computation with quantum fields
Ikeda, K. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02811-5 · Cited by 2
Developing electron dynamics into a tool for 21st century chemistry simulations
Bande, A. (2022) · Royal Society of Chemistry eBooks · doi:10.1039/9781839169342-00091 · Cited by 2
Multiple Network Alignment on Quantum ComputersPreprint
Daskin, A., Grama, A. Y., & Kais, S. (2016) · Cited by 2
(2014) · Elsevier eBooks · doi:10.1016/b978-0-12-800953-6.00020-7 · Cited by 2
Quantum Algorithms and Complexity for Continuous Problems
Papageorgiou, A., & Traub, J. F. (2009) · Springer eBooks · doi:10.1007/978-0-387-30440-3_424 · Cited by 2
Cracking chemistry with quantum simulations
Schleich, P., & Aspuru‐Guzik, A. (2025) · Science · doi:10.1126/science.ado6686 · Cited by 2
Variational quantum multidimensional scaling algorithm
Zhang, X., Zhang, F., Guo, Y., & Chen, F. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04289-x · Cited by 1
Dense outputs from quantum simulations
Liu, J.-P., & Lin, L. (2024) · Journal of Computational Physics · doi:10.1016/j.jcp.2024.113213 · Cited by 2
Huffman-Code-Based Ternary Tree Transformation
Li, Q., Liu, H., Wang, Q., Wu, Y.-C., & Guo, G. (2025) · Chinese Physics Letters · doi:10.1088/0256-307x/42/10/100001 · Cited by 2
HHL Algorithm for Tensor-Decomposable Matrices
Pilaszewicz, C., & Margraf, M. (2025) · Quantum Reports · doi:10.3390/quantum7030037 · Cited by 1
Calculation of the Green’s Function on Near-term Quantum Computers via Cartan Decomposition
Wan, L., Liu, J., & Yang, J. (2025) · Chemical Research in Chinese Universities · doi:10.1007/s40242-025-5149-y · Cited by 1
Correcting and Extending Trotterized Quantum Many-Body Dynamics
Gentinetta, G., Metz, F., & Carleo, G. (2025) · PRX Quantum · doi:10.1103/1nqt-x5xh · Cited by 3
Quantum simulation algorithms based on quantum trajectories
Borras, E., & Marvian, M. (2026) · Quantum · doi:10.22331/q-2026-04-13-2063 · Cited by 1
A Review of Quantum Scientific Computing Algorithms Relevant to Computational Mechanics
Raisuddin, O. M., & De, S. (2025) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-025-10321-9 · Cited by 2
Benchmarking quantum simulation of chemical Hamiltonians using the sorted-list encoding
Ku, C., Chen, Y., Hu, A., & Hsieh, M.-H. (2026) · Physical Review Research · doi:10.1103/6q7b-h9db · Cited by 5
Nghiem, N. A. (2025) · Physical Review A · doi:10.1103/98x7-9z98 · Cited by 1
qblaze: An Efficient and Scalable Sparse Quantum Simulator
Venev, H., Udomsrirungruang, T., Dimitrov, D., Gehr, T., & Vechev, M. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3763066 · Cited by 1
Trotter error and gate complexity of the SYK and sparse SYK models
Chen, Y., Helsen, J., & Ozols, M. (2026) · Quantum · doi:10.22331/q-2026-02-09-1999 · Cited by 1
Phase estimation with compressed controlled time evolution
Karacan, E. (2026) · Physical Review A · doi:10.1103/j26w-w48j · Cited by 1
Random State Approach to Quantum Computation of Electronic-Structure Properties
Bai, Y., Xiong, F., & Kuang, X. (2025) · Chinese Physics Letters · doi:10.1088/0256-307x/43/1/010604 · Cited by 2
Lee, Y., Choi, M., Min, Y., Bae, E., & Bae, S. (2025) · Physical Review A · doi:10.1103/x6j4-gnww · Cited by 3
Trotter transition in Bardeen-Cooper-Schrieffer pairing dynamics
Patra, A., Yuzbashyan, E. A., Altshuler, B. L., & Flach, S. (2025) · Physical review. E · doi:10.1103/gn7q-9byy · Cited by 1
Quantum algorithm for estimating Olivier-Ricci curvature
Nghiem, N. A., Nguyen, L., Do, K. T., Wei, T.-C., & Phan, T. V. (2026) · Physical Review Research · doi:10.1103/hj52-lksk · Cited by 3
Digital Dissipative State Preparation for Frustration-Free Gapless Quantum Systems
Anonymous, Liu, Y., Lukin, M. D., & Choi, S. (2026) · Physical Review Letters · doi:10.1103/bpc2-zlx5 · Cited by 1
Approximating ground and excited state energies on a quantum computer
Hadfield, S., & Papageorgiou, A. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-0927-y · Cited by 1
Quantum simulation hits the open road
Browne, D. E. (2011) · Physics · doi:10.1103/physics.4.72 · Cited by 1
Zenchuk, A. I. (2020) · International Journal of Quantum Information · doi:10.1142/s0219749920500070 · Cited by 1
Exploring Quantum Engineering from Resource Perspective
Zenglin, T., Hongyi, D., & Zhang, M. (2021) · Chinese Control Conference (CCC) · doi:10.23919/ccc52363.2021.9549513 · Cited by 1
Kendon, V. M. (2018) · Springer eBooks · doi:10.1007/978-1-4939-6883-1_429 · Cited by 1
Quantum radial basis function method for scattered data interpolation
Cui, L., Wu, Z., & Xiang, H. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03833-5 · Cited by 1
Quantum Algorithm for Solving the Wave Equation on a Hexagonal Grid
Novak, R. (2024) · IEEE Access · doi:10.1109/access.2024.3459471 · Cited by 1
Universal quantum computing models: a perspective of resource theory
Wang, D. (2024) · Acta Physica Sinica · doi:10.7498/aps.73.20240893 · Cited by 1
Quantum Computational Complexity of Matrix Functions
Cifuentes, S., Wang, S., Silva, T. D. L., Berta, M., & Aolita, L. (2026) · PRX Quantum · doi:10.1103/g5x4-jcsz · Cited by 1
General Framework for Error Interference in Quantum Simulation
Chen, B., Xu, J., Yuan, X., & Zhao, Q. (2026) · Physical Review Letters · doi:10.1103/g2n5-qdxh · Cited by 1
Principal Trotter observation error with truncated commutators
Li, L. (2024) · Physical Review A · doi:10.1103/physreva.110.062614 · Cited by 1
An Efficient Quantum Algorithm for the Traveling Salesman Problem
Sharma, A., Deshpande, N., Ghosh, S. P., Das, S., & Roy, S. (2025) · Quantum Information and Computation · doi:10.2478/qic-2025-0004 · Cited by 1
Robust and Optimal Loading of General Classical Data Into Quantum Computers
Zhang, X. (2025) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2025.3600368 · Cited by 1
Error convergence of quantum linear system solvers
Ginzburg, M. D., & Marzolino, U. (2026) · Physical Review A · doi:10.1103/rjvs-sj7h · Cited by 2
Analysis of Classical and Quantum Resources for the Quantum Linear Systems Algorithm
Inouye, J. (2013) · International Conference on Information Technology: New Generations · doi:10.1109/itng.2013.117 · Cited by 1
Simulation of Quantum Walks via Hamiltonian Reduction
Gregory, A., & Chiang, C.-F. (2018) · IEEE Nanotechnology Symposium · doi:10.1109/nanotech.2018.8653568 · Cited by 2
Bridging gaps between random approaches to quantum simulation
Novo, L. (2020) · doi:10.22331/qv-2020-03-19-33 · Cited by 1
Wittek, P. (2014) · Elsevier eBooks · doi:10.1016/b978-0-12-800953-6.00012-8 · Cited by 1
Jakhodia, S., & Jajodia, B. (2022) · International Conference on Innovative Trends in Information Technology (ICITIIT) · doi:10.1109/icitiit54346.2022.9744239 · Cited by 1
Quantum simulation of quantum mechanical system with spatial noncommutativity
Chowdhury, S. H. H., Chowdhury, T. A., Nasri, S., Nazim, O. I., & Saad, S. (2023) · International Journal of Quantum Information · doi:10.1142/s0219749923500284 · Cited by 1
Ollive, R., & Louise, S. (2025) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw66978.2025.00083 · Cited by 2
Quantum Algorithms and Complexity for Continuous Problems
Papageorgiou, A., & Traub, J. F. (2013) · Springer eBooks · doi:10.1007/978-3-642-27737-5_424-3 · Cited by 1
Kendon, V. M. (2017) · Springer eBooks · doi:10.1007/978-3-642-27737-5_429-4 · Cited by 1
Kendon, V. M. (2015) · Springer eBooks · doi:10.1007/978-3-642-27737-5_429-3 · Cited by 1
A Menagerie of Symmetry Testing Quantum Algorithms
LaBorde, M. L. (2023) · doi:10.31390/gradschool_dissertations.6134 · Cited by 1
Dense Outputs from Quantum SimulationsPreprint
Liu, J.-P., & Lin, L. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4534378 · Cited by 2
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0003 · Cited by 1
Sanders, B. C. (2024) · Elsevier eBooks · doi:10.1016/b978-0-323-95703-8.00259-7 · Cited by 1
Self-citationPenchev, V. D. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5083035 · Cited by 1
Wang, W.-T., Chang, Y.-J., & Chang, C. R. (2024) · arXiv · doi:10.48550/arxiv.2411.04540
“By using Trotter-Suzuki expansion [19], the second-order approximation of the time evolution operator with a small-time interval 𝛿𝑡 is 𝑈6(𝛿𝑡) ≈ 8𝑄: ’() where 𝑄: * = 𝑒 ’+, , 𝑄: ’ = 𝑄: *- = 𝑒 +, , 𝜃 = 𝑚𝛿𝑡 and 𝐼 is an identity matrix with the same size as 𝑄: ’ and 𝑄: * .”
Error analysis of molecular dynamics and fractal time approximants from a combinatorial perspective
Paul, R. (2011) · The Journal of Chemical Physics · doi:10.1063/1.3575584
Approximability of Optimization Problems through Adiabatic Quantum Computation
Cruz-Santos, W., & Morales-Luna, G. B. (2014) · Synthesis lectures on quantum computing · doi:10.2200/s00596ed1v01y201409qmc009 · Cited by 1
Quantum approach to the unique sink orientation problem
Bacon, D. (2017) · Physical Review A · doi:10.1103/physreva.96.012323
Robustness of digital quantum simulators against Trotter errors
Hauke, P., Heyl, M., & Zoller, P. (2017) · Quantum Information and Measurement (QIM) · doi:10.1364/qim.2017.qt5a.1
Making fermionic quantum simulators more affordable
Leykam, D. (2021) · doi:10.22331/qv-2021-08-17-57
Romeiro, J. H., & Brito, F. (2023) · Physical Review A · doi:10.1103/physreva.107.012431
Bosonic Random Walk Neural Networks for Graph Learning
Shankar, S. S., & Towsley, D. (2022) · Studies in computational intelligence · doi:10.1007/978-3-030-93413-2_34
Towards Solution of Integral Equations in Electromagnetics on Quantum Computers
Phillips, C., & Okhmatovski, V. (2021) · Digest - IEEE Antennas and Propagation Society. International Symposium · doi:10.1109/aps/ursi47566.2021.9703909
Glisic, S., & Lorenzo, B. (2022) · Wiley eBooks · doi:10.1002/9781119790327.ch13
Quantum Algorithms and Complexity for Continuous Problems
Papageorgiou, A., & Traub, J. F. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1800-9_145
Kendon, V. M. (2009) · Springer eBooks · doi:10.1007/978-0-387-30440-3_429
Quantum Fuzzy Least Squares Algorithm for Uncertain Environment
Yu, S., Chang, Y. Z., Zhang, S., & Wang, Q. (2022) · Communications in computer and information science · doi:10.1007/978-3-031-06767-9_42
Djordjević, I. B. (2022) · Elsevier eBooks · doi:10.1016/b978-0-12-822942-2.00010-8
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0006
Microwave resonators for superconducting devices
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0013
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
