Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

The frontiers collection

Choice and Meaning in the Quantum Universe

Henry Pierce Stapp

Published Feb 12, 2009• 0 citations
Publisher
DOI
10.1007/978-3-540-89654-8_7

Related papers

Choice and Meaning in the Quantum Universe

Henry Pierce Stapp

The frontiers collection•Jan 1, 1993•0 citations

Choice and Meaning in the Quantum Universe

Henry Pierce Stapp

The frontiers collection•Jan 1, 2004•0 citations

Values and Meaning in the Quantum Universe

N. Zovko

Springer eBooks•Jul 22, 2005•0 citations

Universal Thermodynamic Uncertainty Relation for Quantum $f-$Divergences

Domingos S. P. Salazar

We show that any Petz $f$-divergence (where $f$ is operator convex) between quantum states admits a universal $χ^2$-mixture representation: the distinguishability of $ρ$ from $σ$ is obtained as a positive superposition of quadratic contrasts $χ^2_λ$, with nonnegative weights $w_f(λ)$ determined explicitly from the Stieltjes representation of the generator $f$. This identifies $χ^2_λ$ as atomic building blocks for quantum $f$-divergences and yields closed-form $w_f$ for canonical choices (relative entropy/KL, Hellinger/Bures, R'{e}nyi). By mapping $χ^2_λ$ into a classical Pearson $χ^2$, we leverage the Chapman-Robbins variational representation and obtain a tight and universal quantum thermodynamic uncertainty relation: any $f$-divergence is lower bounded by a function of the statistics of quantum observables (mean and variance), reproducing previous and novel results in quantum thermodynamics as applications.

quant-pharXiv:2511.10817•Physical review. E•Nov 17, 2025•4 citations

Representation as a Variable: Cross-Framework Variance Decomposition for Quantum Compilation

David Vesterlund

Abstract The frameworks algorithm interaction explains 32–42% of circuit depth variance across 6–12 qubit circuits—exceeding the framework main effect (10–14%) and approaching the algorithm main effect (23–34%). No single compilation framework is universally optimal; the best framework depends on the algorithm, and representation search within a framework explains up to 78% of depth variance at 12 qubits. A quantum algorithm does not determine a unique compiled circuit. The choice of compilation framework, configuration within that framework, and the interaction between the two jointly determine the final circuit depth, gate count, and two-qubit gate count. We treat this representation choice as an optimization variable and ask: how much of compilation quality variance comes from the framework, from the configuration, and from their interaction? We conduct a large-scale empirical study across four quantum compilation frameworks (Qiskit, PyTKET, PennyLane, Cirq), six benchmark algorithms (QFT, Grover, QPE, GHZ, Bernstein–Vazirani, and a superposition circuit), four circuit sizes (6, 8, 10, 12 qubits), and three replicates per cell, yielding 4,608 observations. We apply a two-factor variance decomposition (algorithm Å~ framework) and a within-framework decomposition (algorithm vs. configuration). We find three results. First, the framework Å~ algorithm interaction explains 32–42% of circuit depth variance (mean 39%), exceeding the framework main effect (mean 12%) and approaching the algorithm main effect (mean 29%). No single framework dominates for all algorithms. Second, configuration choice within a single framework explains up to 78% of depth variance at 12 qubits, and this fraction grows with circuit size. Third, the four frameworks expose structurally different representation search spaces—ranging from 6 to 128 configurations across different compilation dimensions—meaning the “representation space” is framework-defined, not universal. These findings support the thesis that representation is a genuine optimization variable: the choice of how to compile a quantum algorithm matters as much as the choice of algorithm itself, and its importance grows with circuit scale.

•Oct 14, 2026•0 citations

Consciousness and values in the quantum universe

Henry Pierce Stapp

Foundations of Physics•Jan 1, 1985•15 citations
Universal Thermodynamic Uncertainty Relation for Quantum f−f-f−Divergences
We show that any Petz fff-divergence (where fff is operator convex) between quantum states admits a universal χ2χ^2χ2-mixture representation: the distinguishability of ρρρ from σσσ is obtained as a positive superposition of quadratic contrasts χλ2χ^2_λχλ2​, with nonnegative weights wf(λ)w_f(λ)wf​(λ) determined explicitly from the Stieltjes representation of the generator fff. This identifies χλ2χ^2_λχλ2​ as atomic building blocks for quantum fff-divergences and yields closed-form wfw_fwf​ for canonical choices (relative entropy/KL, Hellinger/Bures, R'{e}nyi). By mapping χλ2χ^2_λχλ2​ into a classical Pearson χ2χ^2χ2, we leverage the Chapman-Robbins variational representation and obtain a tight and universal quantum thermodynamic uncertainty relation: any fff-divergence is lower bounded by a function of the statistics of quantum observables (mean and variance), reproducing previous and novel results in quantum thermodynamics as applications.
Abstract The frameworks algorithm interaction explains 32–42% of circuit depth variance across 6–12 qubit circuits—exceeding the framework main effect (10–14%) and approaching the algorithm main effect (23–34%). No single compilation framework is universally optimal; the best framework depends on the algorithm, and representation search within a framework explains up to 78% of depth variance at 12 qubits. A quantum algorithm does not determine a unique compiled circuit. The choice of compilation framework, configuration within that framework, and the interaction between the two jointly determine the final circuit depth, gate count, and two-qubit gate count. We treat this representation choice as an optimization variable and ask: how much of compilation quality variance comes from the framework, from the configuration, and from their interaction? We conduct a large-scale empirical study across four quantum compilation frameworks (Qiskit, PyTKET, PennyLane, Cirq), six benchmark algorithms (QFT, Grover, QPE, GHZ, Bernstein–Vazirani, and a superposition circuit), four circuit sizes (6, 8, 10, 12 qubits), and three replicates per cell, yielding 4,608 observations. We apply a two-factor variance decomposition (algorithm Å~ framework) and a within-framework decomposition (algorithm vs. configuration). We find three results. First, the framework Å~ algorithm interaction explains 32–42% of circuit depth variance (mean 39%), exceeding the framework main effect (mean 12%) and approaching the algorithm main effect (mean 29%). No single framework dominates for all algorithms. Second, configuration choice within a single framework explains up to 78% of depth variance at 12 qubits, and this fraction grows with circuit size. Third, the four frameworks expose structurally different representation search spaces—ranging from 6 to 128 configurations across different compilation dimensions—meaning the “representation space” is framework-defined, not universal. These findings support the thesis that representation is a genuine optimization variable: the choice of how to compile a quantum algorithm matters as much as the choice of algorithm itself, and its importance grows with circuit scale.