Skip to content

Simulation-Based Evaluation of Energy-Constrained Quantum-Classical Competition

Aug 2023 · 2 citations · 12 references
Physics Computer Science Mathematics

TL;DR

It is discovered that the energy benefits of quantum computing economies are contingent on large-scale computation, and quantum computing may represent a more sustainable pathway for the computing industry.

Abstract

This paper develops a simulation-based framework for evaluating the energy implications of quantum and classical computing firms competing in a market with limited energy resources. We model providers as differentiated Cournot competitors whose feasible service capacity is induced by technology-specific energy scaling laws: polylogarithmic for quantum algorithms that achieve an equivalent computational target and polynomial for classical emulation. For symmetric groups of quantum and classical firms, the equilibrium reduces to a tractable two-equation system that supports large scenario sweeps over market size, technology mix, and hardware coefficients. We characterize the capacity-constrained Nash equilibrium, prove the existence of a demand scale beyond which quantum service becomes more energy efficient, and report numerical experiments calibrated to trapped-ion and Rydberg platforms. The results identify when quantum energy advantage is only asymptotic and when it becomes operationally relevant.

View source

Similar papers

Nov 2026

Quantum Annealing Complexity and Stochastic Quantum Control

This thesis investigates two central challenges for quantum computing: identifying when quantum annealing can offer a computational advantage, and developing effective methods to control realistic quantum systems. It establishes complexity bounds for an adiabatic algorithm for combinatorial optimization, showing a univ...

Aarón Villanueva · 0 citations
Preprint Sep 2026

The cost of simulating classically tractable quantum circuits and dynamics

Determining whether a quantum evolution can be efficiently simulated classically is central to understanding the boundary between classical and quantum computation. However, polynomial-time simulability is an asymptotic statement, and does not by itself determine whether the (quantum-inspired) classical simulation is a...

Su-Ye-On Chang, Supanut Thanasilp, Zoe Holmes et al. · 0 citations
Preprint Sep 2026

Scalable Simulation of Quantum Dynamics on Topological Quantum Hardware

This work establishes a framework for the representation of quantum dynamics in molecular and condensed matter systems, designed for execution on topological quantum hardware, by leveraging the non-Abelian braiding statistics of Fibonacci and Ising anyons and the Solovay-Kitaev algorithm to approximate unitary propagat...

Kritanjan Polley, M. Tuckerman · 0 citations
Preprint Aug 2026

Quantum Interconnects Part I: Strategic Quantum Network Formation

This work argues that the absence of utility-driven network formation is not solely a consequence of immature applications, but also of insufficient abstraction, and that quantum interconnects constitute the enabling technology required to decouple physical implementations from network functionalities.

Gustavo C. Amaral · 0 citations
Preprint Aug 2026

Hybrid HPC-Quantum Simulations: DFT-Quantum Embedding for Molecular Systems

This work presents a hybrid DFT-Quantum Embedding (QDFT) framework integrating classical HPC-based DFT with a quantum electronic-structure solver, demonstrating quantum embedding's potential to improve selected electronic-structure properties while retaining classical HPC's scalability.

N. Manglani, S. Maity, Shashank Sharma et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.