Tensor Network Formulation of Dequantized Algorithms for Ground State Energy Estimation

• URL: http://arxiv.org/abs/2512.13548v1
• Date: Mon, 15 Dec 2025 17:07:04 GMT
• Title: Tensor Network Formulation of Dequantized Algorithms for Ground State Energy Estimation
• Authors: Hidetaka Manabe, Takanori Sugimoto, Keisuke Fujii,
• Abstract summary: Dequantization algorithms play a central role in providing a clear theoretical framework to separate complexity of quantum and classical algorithms.<n>Existing dequantized algorithms typically rely on sampling procedures, leading to prohibitively large computational overheads.<n>We propose a tensor network-based dequantization framework for GSEE that eliminates the sampling process while preserving the complexity of prior dequantized algorithms.
• Score: 2.9436347471485558
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Verifying quantum advantage for practical problems, particularly the ground state energy estimation (GSEE) problem, is one of the central challenges in quantum computing theory. For that purpose, dequantization algorithms play a central role in providing a clear theoretical framework to separate the complexity of quantum and classical algorithms. However, existing dequantized algorithms typically rely on sampling procedures, leading to prohibitively large computational overheads and hindering their practical implementation on classical computers. In this work, we propose a tensor network-based dequantization framework for GSEE that eliminates the sampling process while preserving the asymptotic complexity of prior dequantized algorithms. In our formulation, the overhead arising from sampling is replaced by the growth of the bond dimension required to represent Chebyshev vectors as tensor network states. Consequently, physical structure, such as entanglement and locality, is naturally reflected in the computational cost. By combining this approach with tensor network approximations, such as Matrix Product States (MPS), we construct a practical dequantization algorithm that is executable within realistic computational resources. Numerical simulations demonstrate that our method can efficiently construct high-degree polynomials up to $d=10^4$ for Hamiltonians with up to $100$ qubits, explicitly revealing the crossover between classically tractable and quantum advantaged regimes. These results indicate that tensor network-based dequantization provides a crucial tool toward the rigorous, quantitative verification of quantum advantage in realistic many-body systems.

Related papers

• Quantum algorithms for Uhlmann transformation [10.701270379190106]
  We propose quantum algorithms that realize the Uhlmann transformation in query and access models.<n>Our algorithms can be-time for low-rank states, exhibiting an exponential improvement over the previous approach.<n>We apply our algorithms to fidelity estimation between two states, and substantially improve the previous best query and sample complexities.
  arXiv  Detail & Related papers  (2025-09-03T18:13:04Z)
• Operator-basis Matrix Product State formalism for optical circuits [0.7499722271664147]
  We present an alternative tensor network framework, the operator-basis Matrix Product State (MPS)<n>MPS exploits the input-output relations of quantum optical circuits encoded in the unitary interferometer matrix.<n>We exploit the flexibility of tensor networks to extend our formalism to incorporate partial distinguishability and photon loss.
  arXiv  Detail & Related papers  (2025-02-03T19:00:02Z)
• Quantum Annealing and Tensor Networks: a Powerful Combination to Solve Optimization Problems [0.0]
  The aim of this thesis is not to compare quantum devices with tensor network algorithms.<n>We explore a potential synergy between these technologies, focusing on how two flagship algorithms might collaborate in the future.<n>This thesis outlines an approach to this problem using finite automata, which we apply to construct the MPO for our case study.
  arXiv  Detail & Related papers  (2024-12-07T09:20:20Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Tensor Quantum Programming [0.0]
  We develop an algorithm that encodes Matrix Product Operators into quantum circuits with a depth that depends linearly on the number of qubits. It demonstrates effectiveness on up to 50 qubits for several frequently encountered in differential equations, optimization problems, and quantum chemistry.
  arXiv  Detail & Related papers  (2024-03-20T10:44:00Z)
• Quantum Computing and Tensor Networks for Laminate Design: A Novel Approach to Stacking Sequence Retrieval [1.6421520075844793]
  A prime example is the weight optimization of laminated composite materials, which to this day remains a formidable problem. The rapidly developing field of quantum computation may offer novel approaches for addressing these intricate problems.
  arXiv  Detail & Related papers  (2024-02-09T15:01:56Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Quantum Robustness Verification: A Hybrid Quantum-Classical Neural Network Certification Algorithm [1.439946676159516]
  In this work, we investigate the verification of ReLU networks, which involves solving a robustness many-variable mixed-integer programs (MIPs) To alleviate this issue, we propose to use QC for neural network verification and introduce a hybrid quantum procedure to compute provable certificates. We show that, in a simulated environment, our certificate is sound, and provide bounds on the minimum number of qubits necessary to approximate the problem.
  arXiv  Detail & Related papers  (2022-05-02T13:23:56Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.