Imagen de Portada

Classically Spoofing System Linear Cross Entropy Score Benchmarking

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Tanggara, Andrew, Gu, Mile, Bharti, Kishor
Formato:	Preprint
Publicado:	2024
Materias:	Quantum Physics Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Strategic Code: A Unified Spatio-Temporal Framework for Quantum Error-Correction
por: Tanggara, Andrew, et al.
Publicado: (2024)

Simple Construction of Qudit Floquet Codes on a Family of Lattices
por: Tanggara, Andrew, et al.
Publicado: (2024)

Near-Term Pseudorandom and Pseudoresource Quantum States
por: Tanggara, Andrew, et al.
Publicado: (2025)

Pseudorandom unitaries are neither real nor sparse nor noise-robust
por: Haug, Tobias, et al.
Publicado: (2023)

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

Pseudorandom density matrices
por: Bansal, Nikhil, et al.
Publicado: (2024)

Pseudorandom quantum authentication
por: Haug, Tobias, et al.
Publicado: (2025)

Separating Quantum and Classical Advice with Good Codes
por: Bostanci, John, et al.
Publicado: (2026)

Contextuality of Quantum Error-Correcting Codes
por: Khu, Derek, et al.
Publicado: (2025)

Quantum Cubature Codes
por: Yang, Yaoling, et al.
Publicado: (2025)

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

A Critical Comment on 'Entropy Computing: A Paradigm for Optimization in Open Photonic Systems'
por: Moosavian, Ali Hamed, et al.
Publicado: (2026)

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

Semi-Classical Subspaces, The No Synchronization Law, and More
por: Epstein, Samuel
Publicado: (2024)

Oracle Separations for the Quantum-Classical Polynomial Hierarchy
por: Agarwal, Avantika, et al.
Publicado: (2024)

Certificate Games and Consequences for the Classical Adversary Bound
por: Chakraborty, Sourav, et al.
Publicado: (2022)

Improved Circuit Lower Bounds and Quantum-Classical Separations
por: Grewal, Sabee, et al.
Publicado: (2024)

Classical Simulability of Quantum Circuits with Shallow Magic Depth
por: Zhang, Yifan, et al.
Publicado: (2024)

Coherence in Property Testing: Quantum-Classical Collapses and Separations
por: Jeronimo, Fernando Granha, et al.
Publicado: (2024)

Quantum and Classical Communication Complexity of Permutation-Invariant Functions
por: Guan, Ziyi, et al.
Publicado: (2023)

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

Classical versus quantum queries in quantum PCPs with classical proofs
por: Buhrman, Harry, et al.
Publicado: (2024)

Toward Separating QMA from QCMA with a Classical Oracle
por: Zhandry, Mark
Publicado: (2024)

A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
por: Wu, Xudong, et al.
Publicado: (2025)

Lower Bounds on Relative Error Quantum Compression and Classical Shadows
por: Sankar, Kaushik
Publicado: (2025)

Quantum versus Classical Separation in Simultaneous Number-on-Forehead Communication
por: Yang, Guangxu, et al.
Publicado: (2025)

Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth
por: Rajakumar, Joel, et al.
Publicado: (2024)

Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
por: Khadiev, Kamil, et al.
Publicado: (2017)

Exponential Separation of Quantum and Classical One-Way Numbers-on-Forehead Communication
por: Yang, Guangxu, et al.
Publicado: (2026)

Classical simulability of quantum circuits followed by sparse classical post-processing
por: Takahashi, Yasuhiro, et al.
Publicado: (2026)

Raising the Bar: An Asymptotic Comparison of Classical and Quantum Shortest Path Algorithms
por: Do, Phuc Hao, et al.
Publicado: (2025)

Improved Quantum Query Upper Bounds Based on Classical Decision Trees
por: Cornelissen, Arjan, et al.
Publicado: (2022)

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

Ideal stochastic process modeling with post-quantum quasiprobabilistic theories
por: Onggadinata, Kelvin, et al.
Publicado: (2024)

An Exponential Separation Between Quantum and Quantum-Inspired Classical Algorithms for Linear Systems
por: Grønlund, Allan, et al.
Publicado: (2024)

Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates
por: Nelson, Jon, et al.
Publicado: (2024)

Classically estimating observables of noiseless quantum circuits
por: Angrisani, Armando, et al.
Publicado: (2024)

A Perfectly Distributable Quantum-Classical Algorithm for Estimating Triangular Balance in a Signed Edge Stream
por: Kordonowy, Steven, et al.
Publicado: (2026)

Approximate Dynamical Quantum Error-Correcting Codes
por: Basak, Nirupam, et al.
Publicado: (2025)

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
por: Li, Xingjian, et al.
Publicado: (2023)