Cover Image

A Critical Comment on 'Entropy Computing: A Paradigm for Optimization in Open Photonic Systems'

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Moosavian, Ali Hamed, Ravan, Bahram Abedi
Format:	Preprint
Published:	2026
Subjects:	Quantum Physics Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Multi-Outcome Circuit Optimization for Enhanced Non-Gaussian State Generation
by: Ismailzadeh, S., et al.
Published: (2026)

New Quantum Algorithms for Computing Quantum Entropies and Distances
by: Wang, Qisheng, et al.
Published: (2022)

Classically Spoofing System Linear Cross Entropy Score Benchmarking
by: Tanggara, Andrew, et al.
Published: (2024)

Two Quantum Paradigms, but Still No Signal
by: Epstein, Samuel
Published: (2024)

Entropy Computing, A Paradigm for Optimization in Open Photonic Systems
by: Nguyen, Lac, et al.
Published: (2024)

Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems
by: Guseynov, Nikita, et al.
Published: (2026)

The Power of Lorentz Quantum Computer
by: Zhang, Qi, et al.
Published: (2024)

Bosonic Quantum Computational Complexity
by: Chabaud, Ulysse, et al.
Published: (2024)

Stabilizer Testing and Magic Entropy via Quantum Fourier Analysis
by: Bu, Kaifeng, et al.
Published: (2023)

Computational complexity of isometric tensor network states
by: Malz, Daniel, et al.
Published: (2024)

The Computational Advantage of MIP* Vanishes in the Presence of Noise
by: Dong, Yangjing, et al.
Published: (2023)

Computational aspects of the trace norm contraction coefficient
by: Delsol, Idris, et al.
Published: (2025)

The Space-Time Cost of Purifying Quantum Computations
by: Zhandry, Mark
Published: (2024)

Modifications of Quantum Computation and Adaptive Queries to PP
by: Miloschewsky, David, et al.
Published: (2025)

A Schematic Definition of Quantum Polynomial Time Computability
by: Yamakami, Tomoyuki
Published: (2018)

Why Philosophers Should Care About Computational Complexity
by: Aaronson, Scott
Published: (2011)

Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics
by: Barch, Brian, et al.
Published: (2025)

Quantum Complexity vs Classical Complexity: A Survey
by: Vaezi, Arash, et al.
Published: (2023)

Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection
by: Hiromasa, Ryo, et al.
Published: (2022)

New Lower-bounds for Quantum Computation with Non-Collapsing Measurements
by: Miloschewsky, David, et al.
Published: (2024)

Optimized Amplitude Amplification for Quantum State Preparation
by: Chernikov, Artem, et al.
Published: (2025)

On Estimating the Quantum Tsallis Relative Entropy
by: Bao, Jinge, et al.
Published: (2025)

A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem
by: Li, Zhengyu, et al.
Published: (2023)

Quantum Subgradient Estimation for Conditional Value-at-Risk Optimization
by: Skarlatos, Vasilis, et al.
Published: (2025)

Exact Quantum Circuit Optimization is co-NQP-hard
by: Kjelstrøm, Adam Husted, et al.
Published: (2025)

Elementary Quantum Recursion Schemes That Capture Quantum Polylogarithmic Time Computability of Quantum Functions
by: Yamakami, Tomoyuki
Published: (2023)

Sampling Frequency Thresholds for Quantum Advantage of Quantum Approximate Optimization Algorithm
by: Lykov, Danylo, et al.
Published: (2022)

On the Computational Complexity of Schrödinger Operators
by: Zheng, Yufan, et al.
Published: (2024)

Multi-Prover Interactive Proof Systems with Leakage
by: Asadi, Vahid R., et al.
Published: (2026)

The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems
by: Gay, William, et al.
Published: (2026)

Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage
by: Gao, Xun, et al.
Published: (2021)

A Computational Separation Between Quantum No-cloning and No-telegraphing
by: Nehoran, Barak, et al.
Published: (2023)

Tight Quantum Depth Lower Bound for Solving Systems of Linear Equations
by: Wang, Qisheng, et al.
Published: (2024)

Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer
by: Schleich, Philipp, et al.
Published: (2024)

A Relativizing MIP for BQP
by: Aaronson, Scott, et al.
Published: (2026)

A Quantum Unique Games Conjecture
by: Mousavi, Hamoon, et al.
Published: (2024)

A Cautionary Note on Quantum Oracles
by: Agarwal, Avantika, et al.
Published: (2025)

A Brief Introduction to Quantum Query Complexity
by: Hamoudi, Yassine
Published: (2025)

A Criterion for Post-Selected Quantum Advantage
by: Karamchedu, Chaitanya, et al.
Published: (2024)

A Note on the Complexity of the Spectral Gap Problem
by: Yirka, Justin
Published: (2025)