Cover Image

Faster and shorter synthesis of Hamiltonian simulation circuits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	de Brugière, Timothée Goubault, Martiel, Simon
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Discrete Mathematics 68Q99
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Generalized Word-Representable Graphs
by: Feng, Zhidan, et al.
Published: (2024)

A short proof of the Patak-Tancer theorem on non-embeddability of $k$-complexes in $2k$-manifolds
by: Kogan, E., et al.
Published: (2021)

A graph-state based synthesis framework for Clifford isometries
by: de Brugière, Timothée Goubault, et al.
Published: (2022)

On sampling two spin models using the local connective constant
by: Efthymiou, Charilaos
Published: (2024)

Exact block encoding of imaginary time evolution with universal quantum neural networks
by: Rrapaj, Ermal, et al.
Published: (2024)

Toward P vs NP: An Observer-Theoretic Separation via SPDP Rank and a ZFC-Equivalent Foundation within the N-Frame Model
by: Edwards, Darren J.
Published: (2025)

Greedy Matchings in Bipartite Graphs with Ordered Vertex Sets
by: Simon, Hans U.
Published: (2024)

Low-overhead error detection with spacetime codes
by: Martiel, Simon, et al.
Published: (2025)

Circularity and repetitiveness in non-injective DF0L systems
by: Goulet-Ouellet, Herman, et al.
Published: (2025)

On sampling diluted Spin-Glasses with unbounded interactions
by: Efthymiou, Charilaos, et al.
Published: (2026)

Complexity of learning matchings and half graphs via edge queries
by: Mande, Nikhil S., et al.
Published: (2025)

Fast and memory efficient strong simulation of noisy adaptive linear optical circuits
by: de Brugière, Timothée Goubault, et al.
Published: (2025)

Trifferent codes with small lengths
by: Kurz, Sascha
Published: (2023)

A quadratic estimation for the Kühnel conjecture on embeddings
by: Dzhenzher, S., et al.
Published: (2022)

Finding Cliques in Geometric Intersection Graphs with Grounded or Stabbed Constraints
by: Keil, J. Mark, et al.
Published: (2025)

On the Parenthesisations of Matrix Chains: All are Useful, Few Are Essential
by: López, Francisco, et al.
Published: (2023)

A group structure arising from Grover walks on complete graphs with self-loops and its application
by: Tsurii, Tatsuya, et al.
Published: (2026)

Some improvements to product formula circuits for Hamiltonian simulation
by: Kornell, Andre, et al.
Published: (2023)

Efficient explicit gate construction of block-encoding for Hamiltonians needed for simulating partial differential equations
by: Guseynov, Nikita, et al.
Published: (2024)

WalkSAT is linear on random 2-SAT
by: Berenbrink, Petra, et al.
Published: (2024)

Dissecting power of intersection of two context-free languages
by: Rukavicka, Josef
Published: (2020)

Shortest Paths in a Weighted Simplicial Complex
by: Chakraborty, Sukrit, et al.
Published: (2025)

Quantenlogische Systeme und Tensorproduktraeume
by: Starke, Tobias
Published: (2026)

On sampling symmetric Gibbs distributions on sparse random graphs and hypergraphs
by: Efthymiou, Charilaos
Published: (2020)

Regular $K_3$-irregular graphs
by: Hak, Artem, et al.
Published: (2025)

Sublinear-Time Computation in the Presence of Online Erasures
by: Kalemaj, Iden, et al.
Published: (2021)

Efficient classical computation of the neural tangent kernel of quantum neural networks
by: Hernandez, Anderson Melchor, et al.
Published: (2025)

Planting and MCMC Sampling from the Potts model
by: Galanis, Andreas, et al.
Published: (2024)

Low-temperature Sampling on Sparse Random Graphs
by: Galanis, Andreas, et al.
Published: (2025)

Quantum circuit model for discrete-time three-state quantum walks on Cayley graphs
by: Sarkar, Rohit Sarma, et al.
Published: (2024)

The random $k$-SAT Gibbs uniqueness threshold revisited
by: Chatterjee, Arnab, et al.
Published: (2025)

Random sampling of permutations through quantum circuits
by: Adhikari, Bibhas
Published: (2024)

Bounds on the Twin-Width of Product Graphs
by: Pettersson, William, et al.
Published: (2022)

Kolmogorov complexity as a combinatorial tool
by: Shen, Alexander
Published: (2024)

Induced Disjoint Paths Without an Induced Minor
by: Aboulker, Pierre, et al.
Published: (2025)

Balanced connected partitions of edge-weighted graphs: Hardness and solving methods
by: Davari, Morteza, et al.
Published: (2025)

Optimal phase change for a generalized Grover's algorithm
by: Cardullo, Christopher, et al.
Published: (2025)

Covering a Graph with Minimal Local Sets
by: Claudet, Nathan, et al.
Published: (2024)

Local equivalence of stabilizer states: a graphical characterisation
by: Claudet, Nathan, et al.
Published: (2024)

Deciding Local Unitary Equivalence of Graph States in Quasi-Polynomial Time
by: Claudet, Nathan, et al.
Published: (2025)