Cover Image

On the Computational Complexity of Schrödinger Operators

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zheng, Yufan, Leng, Jiaqi, Liu, Yizhou, Wu, Xiaodi
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Computational Complexity Mathematical Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

(Sub)Exponential Quantum Speedup for Optimization
by: Leng, Jiaqi, et al.
Published: (2025)

Complexity of quantum circuits via sensitivity, magic, and coherence
by: Bu, Kaifeng, et al.
Published: (2022)

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

Fermionic Gaussian Testing and Non-Gaussian Measures via Convolution
by: Lyu, Xingjian, et al.
Published: (2024)

Quantum Kolmogorov complexity and quantum correlations in deterministic-control quantum Turing machines
by: Lemus, Mariano, et al.
Published: (2023)

Proof of Hiding Conjecture in Gaussian Boson Sampling
by: Shou, Laura, et al.
Published: (2025)

Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation
by: Martinez, Victor, et al.
Published: (2025)

Approximating the quantum value of an LCS game is RE-hard
by: Taller, Aviv, et al.
Published: (2025)

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

Wasserstein Complexity of Quantum Circuits
by: Li, Lu, et al.
Published: (2022)

The Complexity of Translationally Invariant Problems beyond Ground State Energies
by: Watson, James D., et al.
Published: (2020)

Poincaré Duality and Multiplicative Structures on Quantum Codes
by: Li, Yiming, et al.
Published: (2025)

How to Construct Random Unitaries
by: Ma, Fermi, et al.
Published: (2024)

Rational degree is polynomially related to degree
by: Kothari, Robin, et al.
Published: (2026)

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

Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations
by: Onah, Chinonso, et al.
Published: (2026)

Classifying Entanglement by Algebraic Geometry
by: Gharahi, Masoud
Published: (2024)

Rapidly mixing loop representation quantum Monte Carlo for Heisenberg models on star-like bipartite graphs
by: Takahashi, Jun, et al.
Published: (2024)

Unitary designs in nearly optimal depth
by: Cui, Laura, et al.
Published: (2025)

Persistent Tensors and Multiqudit Entanglement Transformation
by: Gharahi, Masoud, et al.
Published: (2022)

Quon Classical Simulation: Unifying Cliffords, Matchgates and Entanglement
by: Feng, Zixuan, et al.
Published: (2025)

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)

Reducing the Complexity of Matrix Multiplication to $O(N^2log_2N)$ by an Asymptotically Optimal Quantum Algorithm
by: Yao, Jiaqi, et al.
Published: (2026)

Fundamental Limitations of QAOA on Constrained Problems and a Route to Exponential Enhancement
by: Onah, Chinonso, et al.
Published: (2025)

A new class of coherent states involving Fox-Wright functions and their generalization in the bicomplex framework
by: Bera, Snehasis, et al.
Published: (2026)

A polynomial-time classical algorithm for noisy quantum circuits
by: Schuster, Thomas, et al.
Published: (2024)

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

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

Quantum Annealing-Based Algorithm for Efficient Coalition Formation Among LEO Satellites
by: Venkatesh, Supreeth Mysore, et al.
Published: (2024)

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

A learning theory for quantum photonic processors and beyond
by: Rosati, Matteo
Published: (2022)

Convergence efficiency of quantum gates and circuits
by: Kong, Linghang, et al.
Published: (2024)

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

The Complexity of Stoquastic Sparse Hamiltonians
by: Grilo, Alex B., et al.
Published: (2026)

On the Complexity of Decoded Quantum Interferometry
by: Marwaha, Kunal, et al.
Published: (2025)

Complexity Theory for Quantum Promise Problems
by: Chia, Nai-Hui, et al.
Published: (2024)

The Communication Complexity of Approximating Matrix Rank
by: Sherstov, Alexander A., et al.
Published: (2024)

Complexity and hardness of random peaked circuits
by: Zhang, Yuxuan
Published: (2025)

On the Complexity of the Succinct State Local Hamiltonian Problem
by: Waite, Gabriel, et al.
Published: (2025)