Image de couverture de livre

Fast algorithms for classical specifications of stabiliser states and Clifford gates

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	de Silva, Nadish, Salmon, Wilfred, Yin, Ming
Format:	Preprint
Publié:	2023
Sujets:	Quantum Physics Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Clifford testing: algorithms and lower bounds
par: Hinsche, Marcel, et autres
Publié: (2025)

Analyzing and improving a classical Betti number estimation algorithm
par: Sorci, Julien
Publié: (2025)

Fast quantum algorithm for differential equations
par: Bagherimehrab, Mohsen, et autres
Publié: (2023)

SYK thermal expectations are classically easy at any temperature
par: Zlokapa, Alexander, et autres
Publié: (2026)

No quantum advantage implies improved bounds and classical algorithms for the binary paint shop problem
par: Goh, Mark, et autres
Publié: (2026)

Improved approximation algorithms for the EPR Hamiltonian
par: Ju, Nathan, et autres
Publié: (2025)

Gibbs state preparation for commuting Hamiltonian: Mapping to classical Gibbs sampling
par: Hwang, Yeongwoo, et autres
Publié: (2024)

A 0.8395-approximation algorithm for the EPR problem
par: Apte, Anuj, et autres
Publié: (2025)

A quantum algorithm for solving 0-1 Knapsack problems
par: Wilkening, Sören, et autres
Publié: (2023)

The state hidden subgroup problem and an efficient algorithm for locating unentanglement
par: Bouland, Adam, et autres
Publié: (2024)

Quantum algorithms and lower bounds for eccentricity, radius, and diameter in undirected graphs
par: Wesołowski, Adam, et autres
Publié: (2025)

An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms
par: Mitosek, Piotr, et autres
Publié: (2024)

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

Quantum linear system algorithm with optimal queries to initial state preparation
par: Low, Guang Hao, et autres
Publié: (2024)

Robust and optimal loading of general classical data into quantum computers
par: Zhang, Xiao-Ming
Publié: (2024)

Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
par: Benchasattabuse, Naphan, et autres
Publié: (2023)

Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs
par: Jennings, David, et autres
Publié: (2023)

A simple analysis of a quantum-inspired algorithm for solving low-rank linear systems
par: Chen, Tyler, et autres
Publié: (2025)

Revisiting Majumdar-Ghosh spin chain model and Max-cut problem using variational quantum algorithms
par: Britant, et autres
Publié: (2024)

Variational ground-state quantum adiabatic theorem
par: Žunkovič, Bojan, et autres
Publié: (2024)

Enumeration algorithms for combinatorial problems using Ising machines: When should we stop exploring energy landscapes?
par: Mizuno, Yuta, et autres
Publié: (2024)

Unifying quantum spatial search, state transfer and uniform sampling on graphs: simple and exact
par: Wang, Qingwen, et autres
Publié: (2024)

On quantum to classical comparison for Davies generators
par: Basso, Joao, et autres
Publié: (2025)

Improved quantum algorithms for linear and nonlinear differential equations
par: Krovi, Hari
Publié: (2022)

Non-iid hypothesis testing: from classical to quantum
par: De Palma, Giacomo, et autres
Publié: (2025)

A rigorous quasipolynomial-time classical algorithm for SYK thermal expectations
par: Zlokapa, Alexander
Publié: (2026)

A quantum central path algorithm for linear optimization
par: Augustino, Brandon, et autres
Publié: (2023)

High-level quantum algorithm programming using Silq
par: Bezganovic, Viktorija, et autres
Publié: (2024)

A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix
par: Chen, Yanlin, et autres
Publié: (2024)

Improved algorithms for learning quantum Hamiltonians, via flat polynomials
par: Narayanan, Shyam
Publié: (2024)

Quantum algorithms for general nonlinear dynamics based on the Carleman embedding
par: Jennings, David, et autres
Publié: (2025)

Rapid mixing for high-temperature Gibbs states with arbitrary external fields
par: Bakshi, Ainesh, et autres
Publié: (2026)

Quantum Circuit Simulation with Fast Tensor Decision Diagram
par: Zhang, Qirui, et autres
Publié: (2024)

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
par: Apers, Simon, et autres
Publié: (2021)

Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances
par: Abbas, Amira, et autres
Publié: (2025)

Provably faster randomized and quantum algorithms for $k$-means clustering via uniform sampling
par: Chen, Tyler, et autres
Publié: (2025)

An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
par: Liu, Wenjie, et autres
Publié: (2023)

On estimating the trace of quantum state powers
par: Liu, Yupan, et autres
Publié: (2024)

Optimal lower bounds for quantum state tomography
par: Scharnhorst, Thilo, et autres
Publié: (2025)

Polynomial-time tolerant testing stabilizer states
par: Arunachalam, Srinivasan, et autres
Publié: (2024)