Cover Image

Approximate Message Passing for Quantum State Tomography

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Siekierski, Noah, Chandramouli, Kausthubh, Kümmerle, Christian, Bakalov, Bojko N., Baron, Dror
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Data Structures and Algorithms Information Theory Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs
by: Li, Tongyang, et al.
Published: (2024)

The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings
by: Hou, Jiaxin, et al.
Published: (2023)

Improved Approximation Algorithms for Index Coding
by: Chawin, Dror, et al.
Published: (2024)

Quantum speedups for stochastic optimization
by: Sidford, Aaron, et al.
Published: (2023)

Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods
by: Li, Gen, et al.
Published: (2023)

BalLOT: Balanced $k$-means clustering with optimal transport
by: Luo, Wenyan, et al.
Published: (2025)

Gap-Free Clustering: Sensitivity and Robustness of SDP
by: Zurek, Matthew, et al.
Published: (2023)

On Speedups for Convex Optimization via Quantum Dynamics
by: Chakrabarti, Shouvanik, et al.
Published: (2025)

Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss
by: Wang, Hao, et al.
Published: (2024)

Gibbs Sampling of Continuous Potentials on a Quantum Computer
by: Motamedi, Arsalan, et al.
Published: (2022)

Quantum Speedups for Group Relaxations of Integer Linear Programs
by: Augustino, Brandon, et al.
Published: (2026)

Quantum speedups for linear programming via interior point methods
by: Apers, Simon, et al.
Published: (2023)

Quantum Optimization Algorithms in Operations Research: Methods, Applications, and Implications
by: Klug, Florian
Published: (2023)

Sum-Of-Squares To Approximate Knapsack
by: Kothari, Pravesh K., et al.
Published: (2025)

Approximation Schemes for Sequential Hiring Problems
by: Segev, Danny, et al.
Published: (2026)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
by: Encz, Koppány István, et al.
Published: (2025)

Fully Subexponential Time Approximation Scheme for Product Partition
by: Costandin, Marius
Published: (2024)

Improved Approximation Guarantees for Joint Replenishment in Continuous Time
by: Segev, Danny
Published: (2024)

3.415-Approximation for Coflow Scheduling via Iterated Rounding
by: Rohwedder, Lars, et al.
Published: (2025)

New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
by: Segev, Danny
Published: (2024)

Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier
by: Segev, Danny
Published: (2026)

Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
by: Chen, Li, et al.
Published: (2025)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
by: Housni, Omar El, et al.
Published: (2024)

Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking
by: Segev, Danny, et al.
Published: (2025)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
by: Shi, Haoyan, et al.
Published: (2024)

Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry
by: Chee, Yeow Meng, et al.
Published: (2023)

Approximating $q \rightarrow p$ Norms of Non-Negative Matrices in Nearly-Linear Time
by: Objois, Étienne, et al.
Published: (2025)

Economic Warehouse Lot Scheduling: Approximation Schemes via Efficiently-Representable DP-Encoded Policies
by: Segev, Danny
Published: (2026)

Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over Markov Chain Search for Combinatorial Optimization
by: Chakrabarti, Shouvanik, et al.
Published: (2024)

Expanding the reach of quantum optimization with fermionic embeddings
by: Zhao, Andrew, et al.
Published: (2023)

A quantum central path algorithm for linear optimization
by: Augustino, Brandon, et al.
Published: (2023)

No quantum advantage implies improved bounds and classical algorithms for the binary paint shop problem
by: Goh, Mark, et al.
Published: (2026)

Isotropic Noise in Stochastic and Quantum Convex Optimization
by: Marsden, Annie, et al.
Published: (2025)

Robust Online Sampling from Possibly Moving Target Distributions
by: Clément, François, et al.
Published: (2025)

Quantum Langevin Dynamics for Optimization
by: Chen, Zherui, et al.
Published: (2023)

Quantum EigenGame for excited state calculation
by: Quiroga, David, et al.
Published: (2025)

Polyamorous Scheduling
by: Gąsieniec, Leszek, et al.
Published: (2024)

Dynamic Curing and Network Design in SIS Epidemic Processes
by: Yi, Yuhao, et al.
Published: (2022)

Mechanisms for Quantum Advantage in Global Optimization of Nonconvex Functions
by: Herman, Dylan, et al.
Published: (2025)

Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
by: Zhang, Yexin, et al.
Published: (2024)