Skip to content
#small language model Open access

BT‑PEC Full‑Stack Computing Framework: A Steady-State Dynamic Scheduling Model for Open Quantum Systems

Oct 2026 · Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture

Abstract

This paper proposes the BT-PEC full-stack computing framework to address the challenge that traditional static resource scheduling and fixed error correction strategies fail to adapt to time-varying noise and dynamic decoherence of coherent resources in the NISQ era for open quantum systems. The framework includes a quantum living-state architecture, a quantum operating system, and a unified programming language system, with falsifiable engineering predictions and simulation verification schemes. Four core operators are defined: the B basis operator representing underlying hardware quantum resources; the T transition operator describing coherent energy input and quantum state evolution; the P power consumption operator for resource and energy costs from gate operations and entanglement generation; and the EC entropy-causal closure operator implementing error correction, feedback compensation and causal recording constraints. A global steady-state order parameter Ω=tr(BT)−tr(PEC) is introduced. Three system phases are classified by threshold ϵ=0.05: survival state (Ω_Q>0.05), critical state (|Ω_Q|≤0.05), and extinction state (Ω_Q<−0.05). The Lindblad master equation is adopted to model open quantum system dynamics, combined with an exponential fidelity decay model and binary information entropy proxy function. The phase transition critical decoherence parameter γ_c≈0.42 is obtained from simulation, which is only valid within this model and not a universal physical constant. The full-stack hardware-software co-design consists of a topology-logic two-layer quantum hardware architecture, the BT-PEC/OS quantum operating system kernel with Ω_Q-aware task scheduling, and Omega-IR intermediate representation together with a multi-paradigm unified programming language. The FEA cross-language adaptation layer enables compatibility with Python, C++ and other programming environments. Numerical simulations are implemented on QuTiP with five controlled repeatable experiments. Eight quantifiable, falsifiable engineering predictions are presented with explicit falsification criteria. Limitations of the model are clarified: γ_c is simulation-specific; BT and PEC operator matrices need instantiation for individual hardware; Omega-IR currently only has semantic specifications without a production-grade compiler and virtual machine; performance advantages are validated only by numerical simulation pending physical quantum hardware tests; causal chain integrity under high concurrency remains an engineering challenge. The BT-PEC framework unifies quantum hardware, operating system and compilation system under one steady-state evaluation system, offering a verifiable engineering theoretical model for hardware-software co-design of quantum computers under dynamic NISQ noise environments. Future work includes completing the Omega-IR compiler, scaling up simulations, and preparing validation experiments on small-scale physical quantum processors.

View source

Similar papers

#small language model Dataset Open access Oct 2026

Socratic guiding questions in synthetic arithmetic data: matched LoRA runs (revision v2)

Supporting data, adapters, predictions and code for the article *Low-Cost LoRA Fine-Tuning of Small Language Models for Multi-Step Arithmetic Reasoning* by Jake O'Grady, Asena Isik Gürhan, Chee Fong Ting and Effirul Ramlan (University of Galway). We generated 20,000 GSM8K-derived arithmetic problems with step-by-step s...

O'Grady, Jake, Gürhan, Asena Isik, Chee, Fong Ting et al. · 465 citations
#computer vision Open access Jun 2016

Software Development in Startup Companies: The Greenfield Startup Model

The results are packaged in the Greenfield Startup Model (GSM), which explains the priority of startups to release the product as quickly as possible, and the need to shorten time-to-market, by speeding up the development through low-precision engineering activities.

Carmine Giardino, Nicolò Paternoster, M. Unterkalmsteiner et al. · 178 citations · ⚡14
#computer vision Open access Oct 2016

Software Startups - A Research Agenda

Software startup companies develop innovative, software-intensive products within limited timeframes and with few resources, searching for sustainable and scalable business models.

M. Unterkalmsteiner, P. Abrahamsson, Xiaofeng Wang et al. · 157 citations · ⚡17
#machine learning Review Open access Oct 2016

“Failures” to be celebrated: an analysis of major pivots of software startups

This study conducts a case survey study based on the secondary data of the major pivots happened in 49 software startups, and demonstrates that customer need pivot is the most common among all pivot types.

Sohaib Shahid Bajwa, Xiaofeng Wang, Anh Nguyen-Duc et al. · 127 citations · ⚡15
#computer vision Review Open access May 2015

A survey study on major technical barriers affecting the decision to adopt cloud services

The comparison of adopter and non-adopter sample reveals three potential adoption inhibitor, security, data privacy, and portability, which underlines the importance of the technical and security perspectives for research investigating the adoption of technology.

Nattakarn Phaphoom, Xiaofeng Wang, S. Samuel et al. · 111 citations · ⚡8
#computer vision Open access Feb 2018

Lean Internal Startups for Software Product Innovation in Large Companies: Enablers and Inhibitors

This study investigates how Lean internal startup facilitates software product innovation in large companies and identifies its enablers and inhibitors, and shows the potential of the method-in-action framework to investigate the Lean startup approach in non-startup context.

Henry Edison, Nina M. Smørsgård, Xiaofeng Wang et al. · 78 citations · ⚡6

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

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