pith. sign in

arxiv: 2606.28169 · v1 · pith:VGEXYAAInew · submitted 2026-06-26 · 🪐 quant-ph

Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm

Pith reviewed 2026-06-29 03:48 UTC · model grok-4.3

classification 🪐 quant-ph
keywords hybrid tensor networksmatrix product statestime evolutionquantum-classical hybridBUG integratorparallel algorithmquantum simulation
0
0 comments X

The pith

Hybrid tensor networks enable a modular and parallel time-evolution algorithm for matrix product states by splitting classical boundary tensors from quantum inner ones.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper presents a time-evolution algorithm for matrix product states that leverages the hybrid tensor network framework. It keeps tensors near the boundary on a classical computer using the BUG integrator and moves the more entangled central tensors to a quantum computer. A coupling scheme connects the two parts, allowing the use of any quantum time-evolution method and dynamic changes to the classical-quantum ratio. The quantum and classical computations can proceed in parallel within each time step without synchronization or mid-circuit measurements. This approach is detailed with steps and pseudocode for the matrix product state case.

Core claim

The paper claims that a hybrid tensor network can be used to evolve matrix product states in time by retaining boundary tensors classically and evolving them with the Basis Update and Galerkin integrator while offloading inner tensors to quantum hardware for evolution with any chosen quantum method. The framework includes a coupling scheme that permits parallel execution and dynamic adjustment of the number of classical versus quantum tensors during the simulation.

What carries the argument

The hybrid tensor network (hTN) framework, which partitions the matrix product state into classical and quantum tensor components with a coupling scheme for time evolution.

If this is right

  • Modular combination with any quantum time-evolution method such as Trotterization is possible.
  • The ratio of classical and quantum tensor degrees of freedom can be dynamically adjusted.
  • Quantum and classical components can run in parallel during a single time step.
  • No synchronization barriers or mid-circuit measurements are required.
  • Detailed algorithm steps and pseudocode are provided for matrix product state Ansatz.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The method could extend reachable system sizes for quantum dynamics simulations when classical memory limits are hit.
  • Shifting the classical-quantum split over time might handle growing entanglement without full quantum hardware.
  • Parallel execution within time steps could lower total runtime on available hybrid devices.

Load-bearing premise

The hybrid tensor network framework can be effectively coupled with the BUG integrator for classical tensors and quantum time-evolution methods without introducing prohibitive errors or requiring mid-circuit measurements or synchronization.

What would settle it

A direct comparison of the hybrid algorithm's output state with a fully classical simulation for a small system size and short time would reveal if the coupling introduces significant errors.

read the original abstract

We develop a novel time-evolution algorithm for matrix product states based on the recently introduced hybrid tensor network (hTN) framework. We retain the tensors close to the boundary on the classical computer and offload the highly entangled inner ones to the quantum computer. In our variant, we employ the Basis Update and Galerkin (BUG) integrator to time-evolve the classical tensors, and we develop a coupling scheme between the classical and quantum parts. Our framework admits modular combination with any quantum time-evolution method, such as (classically pre-optimized) Trotterization. The ratio of classical and quantum tensor degrees of freedom can be dynamically adjusted during the time evolution, which can be advantageous when the classical memory requirements become prohibitive. The quantum and classical components can run in parallel during a single time step and are not constrained by synchronization barriers or mid-circuit measurements. We describe the detailed steps and pseudocode for our algorithm specialized for tensor networks originating from the matrix product state Ansatz.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper develops a novel time-evolution algorithm for matrix product states (MPS) within the hybrid tensor network (hTN) framework. Boundary tensors are retained and evolved classically using the Basis Update and Galerkin (BUG) integrator, while highly entangled inner tensors are offloaded to a quantum computer. The approach claims modularity with any quantum time-evolution method (e.g., Trotterization), dynamic adjustment of the classical/quantum tensor ratio during evolution, and parallel execution of classical and quantum components in a single time step without synchronization barriers or mid-circuit measurements. Detailed steps and pseudocode are provided for the MPS Ansatz.

Significance. If the hybrid coupling is validated to reproduce accurate MPS dynamics with controllable truncation error, the result would be significant for hybrid quantum-classical simulations. It could extend the reach of tensor-network methods to larger systems by dynamically balancing memory demands and enabling parallelism, building on the hTN framework with a concrete integrator choice and modular design.

major comments (2)
  1. [Algorithm description and pseudocode] The coupling scheme between the BUG integrator on boundary tensors and the quantum evolution on inner hTN tensors (described in the algorithm steps and pseudocode section): no derivation, error bound, or proof is given that the interface preserves the overall Schrödinger evolution to a controllable order. This is load-bearing for the central claim that the method reproduces correct MPS time evolution, as the modularity and accuracy assertions rest on an unverified assumption that the hybrid update introduces only negligible or bounded error.
  2. [Results or numerical examples] No numerical validation or benchmarks (e.g., against TEBD or exact diagonalization) are presented to confirm that the hybrid updates maintain accuracy or that the parallel execution yields the claimed advantages without prohibitive overhead. This undermines the practical claims of dynamic ratio adjustment and parallelism.
minor comments (2)
  1. [Algorithm steps] Clarify the notation for the dynamic ratio adjustment parameter and how it is updated without disrupting the MPS canonical form.
  2. [Pseudocode] The pseudocode could include explicit handling of the boundary between classical and quantum tensors to improve reproducibility.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their thoughtful and constructive report on our manuscript. We address each major comment point by point below.

read point-by-point responses
  1. Referee: [Algorithm description and pseudocode] The coupling scheme between the BUG integrator on boundary tensors and the quantum evolution on inner hTN tensors (described in the algorithm steps and pseudocode section): no derivation, error bound, or proof is given that the interface preserves the overall Schrödinger evolution to a controllable order. This is load-bearing for the central claim that the method reproduces correct MPS time evolution, as the modularity and accuracy assertions rest on an unverified assumption that the hybrid update introduces only negligible or bounded error.

    Authors: We agree that the manuscript does not provide a formal derivation, error bound, or proof for the hybrid coupling scheme. The algorithm is constructed so that the BUG integrator evolves the boundary tensors variationally while the inner tensors are updated via a modular quantum method, with the hTN structure ensuring consistency of the overall MPS representation. The design assumes that errors remain controlled by the individual approximations (BUG truncation and quantum method accuracy) without additional interface errors, but this is not rigorously proven. We will revise the manuscript to add a dedicated subsection discussing the coupling assumptions, expected error sources, and how the interface is designed to preserve the variational structure to the order of the individual integrators. revision: yes

  2. Referee: [Results or numerical examples] No numerical validation or benchmarks (e.g., against TEBD or exact diagonalization) are presented to confirm that the hybrid updates maintain accuracy or that the parallel execution yields the claimed advantages without prohibitive overhead. This undermines the practical claims of dynamic ratio adjustment and parallelism.

    Authors: The referee correctly observes that the manuscript contains no numerical benchmarks or validation. This work is an algorithmic proposal centered on the development of the hybrid time-evolution method, the coupling scheme, and the provision of detailed pseudocode within the hTN framework. Numerical experiments to verify accuracy, parallelism benefits, and dynamic ratio adjustment would strengthen the practical claims but are not included, as the focus was on the theoretical and algorithmic description. We will revise the manuscript to add a discussion section outlining how such benchmarks could be constructed and the theoretical expectations for overhead and accuracy based on the method's properties. revision: partial

Circularity Check

0 steps flagged

No circularity: algorithm description is self-contained with explicit new coupling steps

full rationale

The paper introduces a new time-evolution procedure for hTN-MPS by specifying the BUG integrator on boundary tensors, a modular interface to any quantum evolution method on inner tensors, dynamic ratio adjustment, and parallel execution without synchronization. These elements are presented via pseudocode and step descriptions rather than derived from or reduced to prior self-citations, fitted parameters, or self-definitional relations. The hTN framework is referenced as recently introduced external input, and the central claims concern the novel coupling scheme itself, which does not collapse to its own inputs by construction. No load-bearing uniqueness theorem or ansatz smuggling is invoked.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract provides no specific details on free parameters, axioms, or invented entities; the algorithm description implies standard tensor network assumptions but none are explicitly listed.

pith-pipeline@v0.9.1-grok · 5704 in / 995 out tokens · 39810 ms · 2026-06-29T03:48:40.657765+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

183 extracted references · 147 canonical work pages · 32 internal anchors

  1. [1]

    Biamonte, Jacob and Bergholm, Ville , date =. Tensor. 1708.00006 , eprinttype =

  2. [2]

    Gerez and Wind, Peter and Eikås, Roberto Di Remigio and Dinvay, Evgueni and Frediani, Luca , date =

    Bjørgve, Magnar and Tantardini, Christian and Jensen, Stig Rune and S., Gabriel A. Gerez and Wind, Peter and Eikås, Roberto Di Remigio and Dinvay, Evgueni and Frediani, Luca , date =. doi:10.1063/5.0203401 , url =. 2402.08377 , eprinttype =

  3. [3]

    An analytical decomposition protocol for optimal implementation of two-qubit entangling gates

    An Analytical Decomposition Protocol for Optimal Implementation of Two-Qubit Entangling Gates , author =. doi:10.48550/arXiv.cond-mat/0609750 , url =. cond-mat/0609750 , eprinttype =

  4. [4]

    Characterizing Quantum Supremacy in Near-Term Devices

    Boixo, Sergio and Isakov, Sergei V. and Smelyanskiy, Vadim N. and Babbush, Ryan and Ding, Nan and Jiang, Zhang and Bremner, Michael J. and Martinis, John M. and Neven, Hartmut , date =. Characterizing. doi:10.1038/s41567-018-0124-x , url =. 1608.00263 , eprinttype =

  5. [5]

    doi:10.1103/PhysRevA.111.012207 , url =

    Generating Multipartite Nonlocality to Benchmark Quantum Computers , author =. doi:10.1103/PhysRevA.111.012207 , url =. 2406.07659 , eprinttype =

  6. [6]

    Boulebnane, Sami and Montanaro, Ashley , date =. Solving. doi:10.1103/PRXQuantum.5.030348 , url =

  7. [7]

    A practical scheme for quantum computation with any two-qubit entangling gate

    A Practical Scheme for Quantum Computation with Any Two-Qubit Entangling Gate , author =. doi:10.1103/PhysRevLett.89.247902 , url =. quant-ph/0207072 , eprinttype =

  8. [8]

    Hand-Waving and Interpretive Dance: An Introductory Course on Tensor Networks , shorttitle =

    Bridgeman, Jacob C and Chubb, Christopher T , date =. Hand-Waving and Interpretive Dance: An Introductory Course on Tensor Networks , shorttitle =. doi:10.1088/1751-8121/aa6dc3 , url =

  9. [9]

    Bell nonlocality

    Bell Nonlocality , author =. doi:10.1103/RevModPhys.86.419 , url =. 1303.2849 , eprinttype =

  10. [10]

    quant-ph/0108062 , eprinttype =

    Universal Quantum Gates , author =. quant-ph/0108062 , eprinttype =

  11. [11]

    Incentivizing

    Bucher, David and Nüßlein, Jonas and O'Meara, Corey and Angelov, Ivan and Wimmer, Benedikt and Ghosh, Kumar and Cortiana, Giorgio and Linnhoff-Popien, Claudia , date =. Incentivizing. doi:10.1109/TQE.2024.3407236 , url =

  12. [12]

    Bucher, David and Kraus, Nico and Blenninger, Jonas and Lachner, Michael and Stein, Jonas and Linnhoff-Popien, Claudia , date =. Towards. doi:10.48550/arXiv.2405.07624 , url =. 2405.07624 , eprinttype =

  13. [13]

    Rank-Adaptive Time Integration of Tree Tensor Networks , volume =. SIAM J. Numer. Anal. , author =. doi:10.1137/22M1473790 , number =

  14. [14]

    Ceruti, Gianluca and Kusch, Jonas and Lubich, Christian and Sulz, Dominik , date =. A. doi:10.1137/24M1714502 , url =

  15. [15]

    doi:10.48550/arXiv.2104.05247 , url =

    A Rank-Adaptive Robust Integrator for Dynamical Low-Rank Approximation , author =. doi:10.48550/arXiv.2104.05247 , url =. 2104.05247 , eprinttype =

  16. [16]

    Optimizing

    Chai, Yahui and Tucci, Alice Di , date =. Optimizing. doi:10.48550/arXiv.2505.22924 , url =. 2505.22924 , eprinttype =

  17. [17]

    Chatterjee, Avimita and Das, Subrata and Ghosh, Swaroop , date =. Lattice. doi:10.48550/arXiv.2404.13202 , url =. 2404.13202 , eprinttype =

  18. [18]

    and White, Steven R

    Chen, Jielun and Stoudenmire, E.M. and White, Steven R. , date =. Quantum. doi:10.1103/PRXQuantum.4.040318 , url =

  19. [19]

    Quantum Information Theory , author =

  20. [20]

    and Javadi-Abhari, Ali and Alexander, Thomas and family=Beaudrap, given=Niel, prefix=de, useprefix=true and Bishop, Lev S

    Cross, Andrew W. and Javadi-Abhari, Ali and Alexander, Thomas and family=Beaudrap, given=Niel, prefix=de, useprefix=true and Bishop, Lev S. and Heidel, Steven and Ryan, Colm A. and Sivarajah, Prasahnt and Smolin, John and Gambetta, Jay M. and Johnson, Blake R. , date =. doi:10.1145/3505636 , url =. 2104.14722 , eprinttype =

  21. [21]

    Open Quantum Assembly Language

    Cross, Andrew W. and Bishop, Lev S. and Smolin, John A. and Gambetta, Jay M. , date =. Open. doi:10.48550/arXiv.1707.03429 , url =. 1707.03429 , eprinttype =

  22. [22]

    doi:10.1103/PhysRevA.100.032328 , url =

    Validating Quantum Computers Using Randomized Model Circuits , author =. doi:10.1103/PhysRevA.100.032328 , url =. 1811.12926 , eprinttype =

  23. [23]

    and Brandão, Fernando , doi =

    Dalzell, Alexander M. and Brandão, Fernando , doi =. Locally Accurate

  24. [24]

    doi:10.1002/cpa.3160410705 , url =

    Orthonormal Bases of Compactly Supported Wavelets , author =. doi:10.1002/cpa.3160410705 , url =

  25. [25]

    family=Delft, given=Jan, prefix=von, useprefix=false , url =. Tensor

  26. [26]

    The Determination of

  27. [27]

    Heat Semigroup Representation of

    Dinvay, Evgueni , date =. Heat Semigroup Representation of. doi:10.48550/arXiv.2501.08820 , url =. 2501.08820 , eprinttype =

  28. [28]

    Multiresolution of the One Dimensional Free-Particle Propagator

    Dinvay, Evgueni and Zabelina, Yuliya and Frediani, Luca , date =. Multiresolution of the One Dimensional Free-Particle Propagator. doi:10.1016/j.cpc.2024.109436 , url =. 2405.08115 , eprinttype =

  29. [29]

    Domínguez, Federico and Fellner, Michael and Klaver, Berend and Rombouts, Stefan and Ertler, Christian and Lechner, Wolfgang , date =. Runtime. doi:10.48550/arXiv.2410.16382 , url =. 2410.16382 , eprinttype =

  30. [30]

    Simulating

    Dubey, Aditya and Zeybek, Zeki and Schmelcher, Peter , date =. Simulating. doi:10.48550/arXiv.2504.16718 , url =. 2504.16718 , eprinttype =

  31. [31]

    Efficient bond-adaptive approach for finite-temperature open quantum dynamics using the one-site time-dependent variational principle for matrix product states , volume =. Phys. Rev. B , author =. doi:10.1103/PhysRevB.104.214302 , number =

  32. [32]

    Dutta, Sanchayan , langid =

  33. [33]

    and Huang, Hsin-Yuan and Kueng, Richard and Preskill, John and Vermersch, Beno

    Elben, Andreas and Flammia, Steven T. and Huang, Hsin-Yuan and Kueng, Richard and Preskill, John and Vermersch, Beno. The randomized measurement toolbox , volume =. Nature Reviews Physics , publisher =. doi:10.1038/s42254-022-00535-2 , number =

  34. [34]

    Local Hamiltonians Whose Ground States are Hard to Approximate

    Eldar, Lior and Harrow, Aram W. , date =. Local. 2017. doi:10.1109/FOCS.2017.46 , url =. 1510.02082 , eprinttype =

  35. [35]

    Representation and design of wavelets using unitary circuits

    Representation and Design of Wavelets Using Unitary Circuits , author =. doi:10.1103/PhysRevA.97.052314 , url =. 1605.07312 , eprinttype =

  36. [36]

    Farhi, Edward and Goldstone, Jeffrey and Gutmann, Sam , date =. A. 1411.4028 , eprinttype =

  37. [37]

    Fernández, Yuriel Núñez and Ritter, Marc K. and Jeannin, Matthieu and Li, Jheng-Wei and Kloss, Thomas and Louvet, Thibaud and Terasaki, Satoshi and Parcollet, Olivier and family=Delft, given=Jan, prefix=von, useprefix=false and Shinaoka, Hiroshi and Waintal, Xavier , date =. Learning Tensor Networks with Tensor Cross Interpolation: New Algorithms and Libr...

  38. [38]

    doi:10.1103/PhysRevB.85.165146 , url =

    Perfect Sampling with Unitary Tensor Networks , author =. doi:10.1103/PhysRevB.85.165146 , url =

  39. [39]

    Tensor Networks and Quantum Error Correction

    Ferris, Andrew J. and Poulin, David , date =. Tensor. doi:10.1103/PhysRevLett.113.030501 , url =. 1312.4578 , eprinttype =

  40. [40]

    Tensor operators: constructions and applications for long-range interaction systems

    Fröwis, F. and Nebendahl, V. and Dür, W. , date =. Tensor Operators: Constructions and Applications for Long-Range Interaction Systems , shorttitle =. doi:10.1103/PhysRevA.81.062337 , url =. 1003.1047 , eprinttype =

  41. [41]

    , date =

    Fujii, Keisuke and Mizuta, Kaoru and Ueda, Hiroshi and Mitarai, Kosuke and Mizukami, Wataru and Nakagawa, Yuya O. , date =. Deep. doi:10.48550/arXiv.2007.10917 , url =. 2007.10917 , eprinttype =

  42. [42]

    Quantum Multi-Output

    Ganeshamurthy, Priyanka Arkalgud and Ghosh, Kumar and O'Meara, Corey and Cortiana, Giorgio and Schiefelbein-Lach, Jan and Monti, Antonello , date =. Quantum Multi-Output. doi:10.48550/arXiv.2411.09123 , url =. 2411.09123 , eprinttype =

  43. [43]

    2205.09882 , eprinttype =

    Low-Rank Tensor Decompositions of Quantum Circuits , author =. 2205.09882 , eprinttype =

  44. [44]

    Ghasemi, Alireza and Hager, Georg , langid =. An

  45. [45]

    Ghosh, Kumar and Yogaraj, Kavitha and Agliardi, Gabriele and Sabino, Piergiacomo and Fernández-Campoamor, Marina and Bernabé-Moreno, Juan and Cortiana, Giorgio and Shehab, Omar and O'Meara, Corey , date =. Energy. doi:10.1109/TQE.2024.3425969 , url =

  46. [46]

    doi:10.48550/arXiv.2105.03406 , url =

    Covariant Quantum Kernels for Data with Group Structure , author =. doi:10.48550/arXiv.2105.03406 , url =. 2105.03406 , eprinttype =

  47. [47]

    Giurgica-Tiron, Y

    Gokhale, Pranav and Angiuli, Olivia and Ding, Yongshan and Gui, Kaiwen and Tomesh, Teague and Suchara, Martin and Martonosi, Margaret and Chong, Frederic T. , date =. Optimization of. 2020. doi:10.1109/QCE49297.2020.00054 , url =

  48. [48]

    Golub, Pavlo and Yang, Chao and Vlček, Vojtěch and Veis, Libor , date =. Quantum. doi:10.1021/acs.jpclett.5c00207 , url =. 40126916 , eprinttype =

  49. [49]

    doi:10.1038/s41467-019-10988-2 , url =

    An Adaptive Variational Algorithm for Exact Molecular Simulations on a Quantum Computer , author =. doi:10.1038/s41467-019-10988-2 , url =

  50. [50]

    and Becker, Stephen and Eisert, Jens , date =

    Gross, David and Liu, Yi-Kai and Flammia, Steven T. and Becker, Stephen and Eisert, Jens , date =. Quantum. doi:10.1103/PhysRevLett.105.150401 , url =

  51. [51]

    Why Do We Climb Mountains?

    Habelt, Leonie and Kemmler, Georg and Defrancesco, Michaela and Spanier, Bianca and Henningsen, Peter and Halle, Martin and Sperner-Unterweger, Barbara and Hüfner, Katharina , date =. Why Do We Climb Mountains?. doi:10.1007/s00406-022-01476-8 , url =

  52. [52]

    Hackbusch, Wolfgang , file =. Tensor

  53. [53]

    From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz

    Hadfield, Stuart and Wang, Zhihui and O'Gorman, Bryan and Rieffel, Eleanor G. and Venturelli, Davide and Biswas, Rupak , date =. From the. doi:10.3390/a12020034 , url =. 1709.03489 , eprinttype =

  54. [54]

    Ignacio and Osborne, Tobias J

    Haegeman, Jutho and Cirac, J. Ignacio and Osborne, Tobias J. and Pižorn, Iztok and Verschelde, Henri and Verstraete, Frank , date =. Time-. doi:10.1103/PhysRevLett.107.070601 , url =

  55. [55]

    doi:10.1103/PhysRevB.94.165116 , url =

    Unifying Time Evolution and Optimization with Matrix Product States , author =. doi:10.1103/PhysRevB.94.165116 , url =

  56. [56]

    Optimal Fermionic Swap Networks for

    Hagge, Tobias , date =. Optimal Fermionic Swap Networks for. 2001.08324 , eprinttype =

  57. [57]

    Molecular Electronic-Structure Theory , author =

  58. [58]

    Pseudofermionic

    Herzog, Laura , file =. Pseudofermionic

  59. [60]

    doi:10.1103/PhysRevB.95.035129 , url =

    Generic Construction of Efficient Matrix Product Operators , author =. doi:10.1103/PhysRevB.95.035129 , url =

  60. [61]

    Ieeexplore.Ieee.Org/Document/11249764 , url =

  61. [62]

    Optimization of

    Itoko, Toshinari and Raymond, Rudy and Imamichi, Takashi and Matsuo, Atsushi , date =. Optimization of. 1907.02686 , eprinttype =

  62. [63]

    Ab-Initio Tree-Tensor-Network Digital Twin for Quantum Computer Benchmarking in

    Jaschke, Daniel and Pagano, Alice and Weber, Sebastian and Montangero, Simone , date =. Ab-Initio Tree-Tensor-Network Digital Twin for Quantum Computer Benchmarking in. doi:10.48550/arXiv.2210.03763 , url =. 2210.03763 , eprinttype =

  63. [64]

    doi:10.1103/PhysRevLett.67.1157 , url =

    Exactly Solvable Model of Interacting Particles in a Quantum Dot , author =. doi:10.1103/PhysRevLett.67.1157 , url =

  64. [65]

    Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets

    Kandala, Abhinav and Mezzacapo, Antonio and Temme, Kristan and Takita, Maika and Brink, Markus and Chow, Jerry M. and Gambetta, Jay M. , date =. Hardware-Efficient. doi:10.1038/nature23879 , url =. 1704.05018 , eprinttype =

  65. [66]

    Kechris, A. S. and Pestov, V. G. and Todorcevic, S. , date =. Fraisse. doi:10.48550/arXiv.math/0305241 , url =. math/0305241 , eprinttype =

  66. [67]

    Wavelets and

    Keinert, Fritz , date =. Wavelets and. doi:10.1201/9780203011591 , url =

  67. [68]

    doi:10.1038/s41586-023-06096-3 , url =

    Evidence for the Utility of Quantum Computing before Fault Tolerance , author =. doi:10.1038/s41586-023-06096-3 , url =

  68. [69]

    2403.00910 , eprinttype =

    Computational Supremacy in Quantum Simulation , author =. 2403.00910 , eprinttype =

  69. [70]

    doi:10.48550/arXiv.2408.10907 , url =

    Klaver, Berend and Rombouts, Stefan and Fellner, Michael and Messinger, Anette and Ender, Kilian and Ludwig, Katharina and Lechner, Wolfgang , date =. doi:10.48550/arXiv.2408.10907 , url =. 2408.10907 , eprinttype =

  70. [71]

    Quantum expectation-value estimation by computational basis sampling , volume =. Phys. Rev. Res. , author =. doi:10.1103/PhysRevResearch.4.033173 , number =

  71. [72]

    Kökcü, Efekan and Steckmann, Thomas and Wang, Yan and Freericks, J. K. and Dumitrescu, Eugene F. and Kemper, Alexander F. , date =. Fixed. doi:10.1103/PhysRevLett.129.070501 , url =. 2104.00728 , eprinttype =

  72. [73]

    Note on the

    Kościk, Przemysław and Maj, Radosław , date =. Note on the

  73. [74]

    Optimal Creation of Entanglement Using a Two--Qubit Gate

    Kraus, B. and Cirac, J. I. , date =. Optimal. doi:10.1103/PhysRevA.63.062309 , url =. quant-ph/0011050 , eprinttype =

  74. [75]

    Time Evolution of the Quantum

    Krinitsin, Wladislaw and Tausendpfund, Niklas and Heyl, Markus and Rizzi, Matteo and Schmitt, Markus , date =. Time Evolution of the Quantum. doi:10.48550/arXiv.2505.07612 , url =. 2505.07612 , eprinttype =

  75. [76]

    Kukliansky, Alon and Younis, Ed and Cincio, Lukasz and Iancu, Costin , date =. 2023. doi:10.1109/QCE57702.2023.00096 , url =. 2306.08152 , eprinttype =

  76. [77]

    and Cincio, Lukasz and McClean, Jarrod R

    Larocca, Martin and Thanasilp, Supanut and Wang, Samson and Sharma, Kunal and Biamonte, Jacob and Coles, Patrick J. and Cincio, Lukasz and McClean, Jarrod R. and Holmes, Zoë and Cerezo, M. , date =. Barren. doi:10.1038/s42254-025-00813-9 , url =. 2405.00781 , eprinttype =

  77. [78]

    doi:10.1126/sciadv.1500838 , url =

    A Quantum Annealing Architecture with All-to-All Connectivity from Local Interactions , author =. doi:10.1126/sciadv.1500838 , url =

  78. [79]

    doi:10.1002/qua.25968 , url =

    A Review on Non-Relativistic Fully Numerical Electronic Structure Calculations on Atoms and Diatomic Molecules , author =. doi:10.1002/qua.25968 , url =. 1902.01431 , eprinttype =

  79. [80]

    Leone, Lorenzo and Oliviero, Salvatore F. E. and Hamma, Alioscia , date =. Stabilizer. doi:10.48550/arXiv.2106.12587 , url =. 2106.12587 , eprinttype =

  80. [81]

    A Discontinuous

    Li, Xiaoxu and Chen, Huajie , date =. A Discontinuous. doi:10.1016/j.jcp.2019.02.006 , url =. 1901.10846 , eprinttype =

Showing first 80 references.