Quantum Computing & Physics Foundations

• Quantum computing is a paradigm that uses superposition, entanglement, and unitary evolution to explore and simulate the laws of physics.
• Key frameworks include digital and analog simulations, such as lattice models and variational methods, for studying quantum many-body dynamics.
• Emerging research recasts physics as information, linking computational protocols with experimental tests of thermodynamics, decoherence, and classical emergence.

Quantum computing is a domain at the intersection of quantum mechanics, theoretical computer science, and the foundations of physics. Quantum computation provides not only a new computational paradigm but also a rigorous probe into the structure of physical law, reframing and testing concepts such as superposition, entanglement, measurement, and information in ways uniquely accessible to the laboratory and theory. By recasting the axioms and mathematical methods of quantum theory in the language of computation and information processing, quantum computing sharpens foundational questions, motivates new physical frameworks, and establishes novel research programs for both physics and computer science.

1. Foundational Quantum Principles Underlying Computation

The operational core of quantum computation derives directly from several fundamental principles of quantum mechanics, each with specific mathematical and conceptual foundations:

• State Vectors and Hilbert Space: The physical state of an isolated quantum system is represented by a unit-length vector $|\psi\rangle$ in a complex Hilbert space $\mathcal{H}$, with the expansion $|\psi\rangle = \sum_{i=0}^{d-1} \alpha_i |i\rangle$, $\sum_i |\alpha_i|^2 =1$ (Kiwelekar, 22 Feb 2025, Fitzsimons et al., 2012).
• Superposition: Quantum theory postulates that if $|\psi_1\rangle$ and $|\psi_2\rangle$ are possible states, so is any coherent combination $\alpha |\psi_1\rangle + \beta |\psi_2\rangle$, which enables interference phenomena and quantum parallelism. In the computational context, this allows a quantum register of $n$ qubits to encode $2^n$ classical states in superposition (Kiwelekar, 22 Feb 2025, Bassi, 4 Mar 2026).
• Entanglement: Quantum states of composite systems are in general non-factorizable. An $n$-qubit system generically has states inaccessible to classical local models; this property is the resource both for quantum speedup and for violations of local realism (Kiwelekar, 22 Feb 2025, Takook et al., 2024, Gisin et al., 2018).
• Unitary Evolution: Dynamics of closed quantum systems are norm-preserving and reversible, governed by unitary operators $\mathcal{H}$0, with $\mathcal{H}$1 the system Hamiltonian (Kiwelekar, 22 Feb 2025, Takook et al., 2024).
• Measurement and Collapse: Measurement is modelled by a set of observables or projective operators, yielding intrinsically random outcomes with probabilities specified by the Born rule, and inducing state update (collapse) (Fitzsimons et al., 2012, Takook et al., 2024).
• Contextuality and Nonlocality: Quantum theory violates noncontextuality and local realism, as shown by the Kochen–Specker theorem and Bell inequalities, providing resources for cryptography and unique computational advantages (Bassi, 4 Mar 2026, Gisin et al., 2018).

These features are not merely formal: they have been recast as resources for computation (superposition $\mathcal{H}$2 parallelism, entanglement $\mathcal{H}$3 nonlocal correlations, contextuality $\mathcal{H}$4 universality) and are directly subject to experimental and computational test.

2. Quantum Simulation and the Computational Frontier

Quantum computers are uniquely suited to simulate the real-time dynamics of nontrivial quantum many-body systems, lattice gauge theories, and field theories that are intractable classically due to the exponential growth of the underlying Hilbert space (Savage, 29 Mar 2025, Wiebe, 2014).

Key frameworks and models:

Model/Algorithm	Core Formula	Physical Content
Lattice $\mathcal{H}$5	$\mathcal{H}$6	Scalar field theory dynamics
Schwinger model (1+1D QED)	$\mathcal{H}$7	Quantum electrodynamics
Trotter-Suzuki Decomposition	$\mathcal{H}$8	Digital simulation schemes
ADAPT-VQE	$\mathcal{H}$9	Variational ground state prep

Quantum simulation extends beyond digital quantum circuits to analog emulation (cold atoms, superconducting circuits) and variational approaches. Notable computational tasks include real-time evolution, vacuum preparation, dynamical quantum phase transitions (DQPTs), and entanglement dynamics—none efficiently accessible with classical architectures due to the sign problem, entanglement, or severe scaling constraints (Savage, 29 Mar 2025, Wiebe, 2014).

Resource and complexity analysis reveals that quantum protocols can perform parameter estimation and model discrimination for physical Hamiltonians exponentially faster than any classical Bayesian or probabilistic algorithm, provided the quantum device can implement suitable inverse dynamics and amplitude estimation (Wiebe, 2014).

3. Quantum Information as a Foundation for Physics

The information-theoretic perspective posits quantum theory itself as a framework emergent from more primitive informational postulates. This approach reconstructs the structure of quantum theory from operational principles such as causality, perfect distinguishability, local tomography, and purification (D'Ariano, 2010).

• Informational axioms yield quantum state space as the convex set of density operators, transformations as completely positive trace-preserving (CPTP) maps, and composition via the tensor product (D'Ariano, 2010).
• Quantum computation can be viewed as a model in which events (gates) and causal links (wires) replace traditional notions of space and time, with space–time and relativistic symmetries emergent from the computational structure itself. For example, slicing the computational DAG retrieves Lorentz transformations in the continuum limit; free information flow yields discretized Dirac-type dynamics (D'Ariano, 2010).
• In this sense, physics as code—the "It from Qubit" paradigm—suggests that space-time, field equations, and even gravity may be recast as emergent features of quantum information processing.

4. Experimental Probes and Foundational Benchmarks

Modern quantum computers are not mere engines for numerical tasks but serve as experimental platforms for testing foundational postulates:

• Tests of Superposition and Born's Rule: Digital quantum circuits implementing the Peres and Sorkin benchmarks can empirically confirm or bound possible deviations from standard quantum theory. The Peres test probes whether amplitudes are complex; the Sorkin test checks for the absence of higher-order interference beyond quadratic (Born's rule). Experiments on NISQ hardware (e.g., Rigetti Aspen-9) validate these postulates to within device noise floors (Sadana et al., 2021).
• Device-independent Protocols: Device-independent quantum key distribution and self-testing use empirical violations of Bell inequalities (e.g., CHSH) to certify entanglement and guarantee private randomness without assuming a detailed model for devices (Gisin et al., 2018, Bassi, 4 Mar 2026).
• Macroscopic Quantumness: Larger and more complex quantum states are synthesized (e.g., micro–macro entanglement, time-bin entanglement, solid-state multi-ion systems), probing the boundary between quantum and classical domains and, potentially, new physics such as collapse models or quantum gravity (Gisin et al., 2018, Bassi, 4 Mar 2026).

5. Quantum Algorithms for Classical Physics and Alternative Foundations

Quantum algorithms for classical dissipative systems (e.g., the Block-Encoded Carleman–Lattice–Boltzmann, CLB) challenge the notion that macroscopic dynamics strictly result from the many-body Schrödinger equation (NBSE). By embedding classical nonlinear dynamics into unitary quantum circuits on polynomially many qubits, these approaches provide concrete counterexamples to the universality of NBSE for $|\psi\rangle = \sum_{i=0}^{d-1} \alpha_i |i\rangle$0 (Succi et al., 10 Oct 2025):

• Carleman Linearization and Block-Encoding: These methods transform nonlinear PDEs governing classical fluids into high-dimensional linear systems, simulated unitarily on quantum circuits. The resulting algorithms avoid the exponential scaling of NBSE and do not rely on decoherence to recover classicality (Succi et al., 10 Oct 2025).
• This suggests macroscopic classicality may arise from alternative quantum information flows, offering a new venue for foundational investigation and for highly efficient quantum simulations of non-quantum systems.

6. Quantum Thermodynamics and Limits to Computation

Quantum thermodynamics generalizes the laws of thermodynamics to small, open quantum systems—implicating both the design and performance of quantum computers (Cleri, 2024):

• Quantum Work and Fluctuation Theorems: Redefinitions of work ($|\psi\rangle = \sum_{i=0}^{d-1} \alpha_i |i\rangle$1), heat ($|\psi\rangle = \sum_{i=0}^{d-1} \alpha_i |i\rangle$2), and entropy in the quantum regime rely on process-dependent formulations and fluctuation theorems (e.g., Jarzynski, Crooks relations).
• Temperature at the Few-Qubit Scale: Standard definitions of temperature and entropy become ambiguous; several proposals (Bloch-sphere mapping, microcanonical ensembles) attempt to define effective temperatures for single qubits and small registers.
• Decoherence and Master Equations: Real devices (superconducting, ion-trap, photonic) are described by Lindblad-type master equations, quantifying the impact of relaxation ($|\psi\rangle = \sum_{i=0}^{d-1} \alpha_i |i\rangle$3), dephasing ($|\psi\rangle = \sum_{i=0}^{d-1} \alpha_i |i\rangle$4), and environmental coupling.
• Thermodynamic Limits: The Landauer–Bennett principle bounds the minimum heat dissipation per computational step. Error-correction introduces inevitable irreversibility, while scaling laws tie feasible device parameters to quantum noise and thermal management (Cleri, 2024).

Quantum Darwinism and environmental redundancy provide mechanisms for the emergence of classical objectivity and measurement, viewed through the lens of mutual information and pointer-state proliferation.

7. Computational Complexity, Simulability, and the Physical Church–Turing Thesis

Quantum computation profoundly challenges the strong (physical) Church–Turing thesis. While classical complexity classes (P, BPP) are believed to be properly contained within quantum classes (BQP), practical quantum devices motivate reexamination of model-independence and universality (Cuffaro, 2021, Wiebe, 2014):

• Limitations: Not all highly entangled or contextual quantum phenomena yield quantum speedup. Some, such as Clifford (stabilizer) circuits, admit classical simulation via the Gottesman–Knill theorem (Cuffaro, 2021, Bassi, 4 Mar 2026).
• Quantum Certification and Inference: Hamiltonian learning, parameter estimation, and model selection can be transformed from classically intractable to efficient on quantum oracles, making computational complexity a physical limit to inference and experimental verification (Wiebe, 2014).
• Resource Theories: Entanglement, contextuality, and “magic” apply as quantifiable resources dictating whether a quantum system or protocol admits efficient classical simulation (Bassi, 4 Mar 2026).

Future research directions include classifying problems by the minimal non-classical structure required for advantage, exploring whether complexity bounds dictate the emergence of effective physical laws, and extending quantum information principles to unifying frameworks for physics beyond the quantum (Fitzsimons et al., 2012, Cuffaro, 2021).

---

References:

(Savage, 29 Mar 2025, Succi et al., 10 Oct 2025, Kiwelekar, 22 Feb 2025, Takook et al., 2024, Fitzsimons et al., 2012, D'Ariano, 2010, Bassi, 4 Mar 2026, Wiebe, 2014, Gisin et al., 2018, Cleri, 2024, Sadana et al., 2021, Cuffaro, 2021)