Cover Image

An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mitosek, Piotr, Backens, Miriam
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

SPAM Tolerance for Pauli Error Estimation
by: O'Donnell, Ryan, et al.
Published: (2025)

Provably faster randomized and quantum algorithms for $k$-means clustering via uniform sampling
by: Chen, Tyler, et al.
Published: (2025)

Efficient Learning of Structured Quantum Circuits via Pauli Dimensionality and Sparsity
by: Grewal, Sabee, et al.
Published: (2025)

Basic quantum subroutines: finding multiple marked elements and summing numbers
by: van Apeldoorn, Joran, et al.
Published: (2023)

Improved approximation algorithms for the EPR Hamiltonian
by: Ju, Nathan, et al.
Published: (2025)

A 0.8395-approximation algorithm for the EPR problem
by: Apte, Anuj, et al.
Published: (2025)

A quantum algorithm for solving 0-1 Knapsack problems
by: Wilkening, Sören, et al.
Published: (2023)

Fast algorithms for classical specifications of stabiliser states and Clifford gates
by: de Silva, Nadish, et al.
Published: (2023)

Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling
by: Huang, Qunsheng, et al.
Published: (2024)

Quantum algorithms and lower bounds for eccentricity, radius, and diameter in undirected graphs
by: Wesołowski, Adam, et al.
Published: (2025)

Quantum algorithm for approximating the expected value of a random-exist quantified oracle
by: Rotello, Caleb
Published: (2024)

Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
by: Fischer, David, et al.
Published: (2022)

A simple analysis of a quantum-inspired algorithm for solving low-rank linear systems
by: Chen, Tyler, et al.
Published: (2025)

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

Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs
by: Jennings, David, et al.
Published: (2023)

Revisiting Majumdar-Ghosh spin chain model and Max-cut problem using variational quantum algorithms
by: Britant, et al.
Published: (2024)

Enumeration algorithms for combinatorial problems using Ising machines: When should we stop exploring energy landscapes?
by: Mizuno, Yuta, et al.
Published: (2024)

Big data applications on small quantum computers
by: Yogendran, Boniface, et al.
Published: (2024)

A faster polynomial-space algorithm for Hamiltonian cycle parameterized by treedepth
by: Kratsch, Stefan
Published: (2026)

Improved quantum algorithms for linear and nonlinear differential equations
by: Krovi, Hari
Published: (2022)

A faster algorithm for Vertex Cover parameterized by solution size
by: Harris, David G., et al.
Published: (2022)

Clifford testing: algorithms and lower bounds
by: Hinsche, Marcel, et al.
Published: (2025)

Fast quantum algorithm for differential equations
by: Bagherimehrab, Mohsen, et al.
Published: (2023)

High-level quantum algorithm programming using Silq
by: Bezganovic, Viktorija, et al.
Published: (2024)

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

Improved algorithms for learning quantum Hamiltonians, via flat polynomials
by: Narayanan, Shyam
Published: (2024)

The state hidden subgroup problem and an efficient algorithm for locating unentanglement
by: Bouland, Adam, et al.
Published: (2024)

Analyzing and improving a classical Betti number estimation algorithm
by: Sorci, Julien
Published: (2025)

Quantum algorithms for general nonlinear dynamics based on the Carleman embedding
by: Jennings, David, et al.
Published: (2025)

Quantum linear system algorithm with optimal queries to initial state preparation
by: Low, Guang Hao, et al.
Published: (2024)

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
by: Apers, Simon, et al.
Published: (2021)

Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances
by: Abbas, Amira, et al.
Published: (2025)

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

An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
by: Liu, Wenjie, et al.
Published: (2023)

Counting perfect matchings and Hamiltonian cycles faster
by: Li, Baitian
Published: (2023)

A faster algorithm for the construction of optimal factoring automata
by: Erlebach, Thomas, et al.
Published: (2024)

Exponential Quantum Advantage for Pathfinding in Regular Sunflower Graphs
by: Li, Jianqiang, et al.
Published: (2024)

Tolerant Testing of Stabilizer States with Mixed State Inputs
by: Iyer, Vishnu, et al.
Published: (2024)

Unifying quantum spatial search, state transfer and uniform sampling on graphs: simple and exact
by: Wang, Qingwen, et al.
Published: (2024)

Tensor Decompositions and Adiabatic Quantum Computing for Discovering Practical Matrix Multiplication Algorithms
by: Uotila, Valter
Published: (2024)