Imagen de Portada

Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Pelofske, Elijah, Russo, Vincent, LaRose, Ryan, Mari, Andrea, Strano, Dan, Bärtschi, Andreas, Eidenbenz, Stephan, Zeng, William J.
Formato:	Preprint
Publicado:	2023
Materias:	Quantum Physics Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Digital Zero-Noise Extrapolation with Quantum Circuit Unoptimization
por: Pelofske, Elijah, et al.
Publicado: (2025)

Probing Quantum Telecloning on Superconducting Quantum Processors
por: Pelofske, Elijah, et al.
Publicado: (2023)

Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs
por: Pelofske, Elijah, et al.
Publicado: (2023)

Trainability Barriers in Low-Depth QAOA Landscapes
por: Rajakumar, Joel, et al.
Publicado: (2024)

Scalable Experimental Bounds for Entangled Quantum State Fidelities
por: Aktar, Shamminuj, et al.
Publicado: (2022)

Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
por: Benchasattabuse, Naphan, et al.
Publicado: (2023)

Classical Combinatorial Optimization Scaling for Random Ising Models on 2D Heavy-Hex Graphs
por: Pelofske, Elijah, et al.
Publicado: (2024)

Simulating Heavy-Hex Transverse Field Ising Model Magnetization Dynamics Using Programmable Quantum Annealers
por: Pelofske, Elijah, et al.
Publicado: (2023)

Expected Maximin Fairness in Max-Cut and other Combinatorial Optimization Problems
por: Salem, Jad, et al.
Publicado: (2024)

Theoretical Approximation Ratios for Warm-Started QAOA on 3-Regular Max-Cut Instances at Depth $p=1$
por: Tate, Reuben, et al.
Publicado: (2024)

The Better Solution Probability Metric: Optimizing QAOA to Outperform its Warm-Start Solution
por: Feeney, Sean, et al.
Publicado: (2024)

Numerical Experiments with Parameter Setting of Trotterized Quantum Phase Estimation for Quantum Hamiltonian Ground State Computation
por: Pelofske, Elijah, et al.
Publicado: (2026)

Variational Quantum Simulations of a Two-Dimensional Frustrated Transverse-Field Ising Model on a Trapped-Ion Quantum Computer
por: Kirmani, Ammar, et al.
Publicado: (2025)

A Learning Perspective on Random-Order Covering Problems
por: Gupta, Anupam, et al.
Publicado: (2025)

Interactive Coding with Unbounded Noise
por: Fargion, Eden, et al.
Publicado: (2024)

Range Longest Increasing Subsequence and its Relatives
por: S., Karthik C., et al.
Publicado: (2024)

Attribute-Efficient PAC Learning of Low-Degree Polynomial Threshold Functions with Nasty Noise
por: Zeng, Shiwei, et al.
Publicado: (2023)

Assigning Agents to Increase Network-Based Neighborhood Diversity
por: Qiu, Zirou, et al.
Publicado: (2023)

Modeling Online Paging in Multi-Core Systems
por: Mari, Mathieu, et al.
Publicado: (2024)

Online Multi-level Aggregation with Delays and Stochastic Arrivals
por: Mari, Mathieu, et al.
Publicado: (2024)

Online matching with delays and stochastic arrival times
por: Mari, Mathieu, et al.
Publicado: (2022)

(Random) Trees of Intermediate Volume Growth
por: George Kontogeorgiou, et al.
Publicado: (2025)

First Order Stochastic Optimization with Oblivious Noise
por: Diakonikolas, Ilias, et al.
Publicado: (2024)

Simple and Optimal Sublinear Algorithms for Mean Estimation
por: Bertolotti, Beatrice, et al.
Publicado: (2024)

Grandchildren-weight-balanced binary search trees
por: Jugé, Vincent
Publicado: (2024)

Efficient top-down updates in AVL trees
por: Jugé, Vincent
Publicado: (2024)

New weighted additive spanners
por: La, An, et al.
Publicado: (2024)

Cost-Distance Steiner Trees for Timing-Constrained Global Routing
por: Held, Stephan, et al.
Publicado: (2025)

Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment
por: Ezra, Tomer, et al.
Publicado: (2024)

Path Partitions of Phylogenetic Networks
por: Lafond, Manuel, et al.
Publicado: (2024)

Computational Complexity of the Interval Ordering Problem
por: Pawlowski, Simeon, et al.
Publicado: (2026)

Few Single-Qubit Measurements Suffice to Certify Any Quantum State
por: Gupta, Meghal, et al.
Publicado: (2025)

The Trie Measure, Revisited
por: Alanko, Jarno N., et al.
Publicado: (2025)

History-Independent Load Balancing
por: Bender, Michael A., et al.
Publicado: (2026)

GPU Implementation of the Wavelet Tree
por: Franzreb, Marco, et al.
Publicado: (2025)

Eulerian Graph Sparsification by Effective Resistance Decomposition
por: Jambulapati, Arun, et al.
Publicado: (2024)

Improved Algorithms for Effective Resistance Computation on Graphs
por: Yang, Yichun, et al.
Publicado: (2025)

Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence
por: Clifford, Peter, et al.
Publicado: (2026)

Effective Traveling for Metric Instances of the Traveling Thief Problem
por: Eube, Jan, et al.
Publicado: (2026)

Revisiting the Sparse Matrix Compression Problem
por: Jugé, Vincent, et al.
Publicado: (2026)