Quantum Energetic Advantage before Computational Advantage in Boson Sampling

• URL: http://arxiv.org/abs/2601.08068v1
• Date: Mon, 12 Jan 2026 23:22:21 GMT
• Title: Quantum Energetic Advantage before Computational Advantage in Boson Sampling
• Authors: Ariane Soret, Nessim Dridi, Stephen C. Wein, Valérian Giesz, Shane Mansfield, Pierre-Emmanuel emeriau,
• Abstract summary: We analyze the energy required to solve the Boson Sampling problem using a realistic photonic quantum computing architecture.<n>By comparing the energy consumption of quantum and state-of-the-art classical implementations, we demonstrate the existence of a quantum energetic advantage.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Understanding the energetic efficiency of quantum computers is essential for assessing their scalability and for determining whether quantum technologies can outperform classical computation beyond runtime alone. In this work, we analyze the energy required to solve the Boson Sampling problem, a paradigmatic task for quantum advantage, using a realistic photonic quantum computing architecture. Using the Metric-Noise-Resource methodology, we establish a quantitative connection between experimental control parameters, dominant noise processes, and energetic resources through a performance metric tailored to Boson Sampling. We estimate the energy cost per sample and identify operating regimes that optimize energetic efficiency. By comparing the energy consumption of quantum and state-of-the-art classical implementations, we demonstrate the existence of a quantum energetic advantage -- defined as a lower energy cost per sample compared to the best-known classical implementation -- that emerges before the onset of computational advantage, even in regimes where classical algorithms remain faster. Finally, we propose an experimentally feasible Boson Sampling architecture, including a complete noise and loss budget, that enables a near-term observation of quantum energetic advantage.

Related papers

• Resource assessment of classical and quantum hardware for post-quench dynamics [31.80794398142351]
  We estimate the run-time and energy consumption of simulating non-equilibrium dynamics on neutral atom quantum computers in analog mode.<n>We show that neutral atom devices are already operating in a competitive regime, achieving comparable or superior performance to classical approaches.
  arXiv  Detail & Related papers  (2025-11-25T15:08:52Z)
• Optimal quantum metrology under energy constraints [12.093341191156838]
  We develop a theoretical framework for characterizing energy-constrained multi-step quantum processes.<n>We identify a novel advantage of quantum superpositions of causal orders in enhancing the energy efficiency of adaptive quantum estimation.
  arXiv  Detail & Related papers  (2025-06-11T06:37:14Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Classical post-processing approach for quantum amplitude estimation [0.0]
  We propose an approach for quantum amplitude estimation (QAE) designed to enhance computational efficiency while minimizing the reliance on quantum resources.<n>Our method leverages quantum computers to generate a sequence of signals, from which the quantum amplitude is inferred through classical post-processing techniques.
  arXiv  Detail & Related papers  (2025-02-08T15:51:31Z)
• Towards Energetic Quantum Advantage in Trapped-Ion Quantum Computation [0.0]
  In this work, one implementation of the quantum Fourier transform (QFT) algorithm in a trapped ion setup was studied. The main focus was to obtain a theoretical characterization of the energetic costs of quantum computation. A potential scaling of the energetic costs was argued and used to find a possible threshold for an energetic quantum advantage against state-of-the-art classical supercomputers.
  arXiv  Detail & Related papers  (2024-04-17T17:14:53Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Energy-Consumption Advantage of Quantum Computation [1.918334858770111]
  We introduce a general framework for studying the energy consumption of quantum and classical computation.<n>We rigorously prove that quantum computation achieves an exponential energy-consumption advantage over classical computation.
  arXiv  Detail & Related papers  (2023-05-18T18:00:00Z)
• Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping [49.36226952764697]
  Estimation of the energy of quantum many-body systems is a paradigmatic task in various research fields.<n>We aim to find the optimal strategy with single-qubit measurements that yields the highest provable accuracy given a total measurement budget.<n>We develop a practical, efficient estimation strategy, which we call ShadowGrouping.
  arXiv  Detail & Related papers  (2023-01-09T14:41:07Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• 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)
• Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation [50.591267188664666]
  Quantum chemistry and materials is one of the most promising applications of quantum computing. Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
  arXiv  Detail & Related papers  (2022-03-14T16:51:36Z)
• 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.