Cover Image

High-level quantum algorithm programming using Silq

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bezganovic, Viktorija, Lewis, Marco, Soudjani, Sadegh, Zuliani, Paolo
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Data Structures and Algorithms Programming Languages
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Automated Verification of Silq Quantum Programs using SMT Solvers
by: Lewis, Marco, et al.
Published: (2024)

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

Quantum Backtracking in Qrisp Applied to Sudoku Problems
by: Seidel, Raphael, et al.
Published: (2024)

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

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

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)

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

Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers
by: Garg, Kushagra, et al.
Published: (2025)

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

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

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

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

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

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

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

An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms
by: Mitosek, Piotr, 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)

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

Elfs, trees and quantum walks
by: Apers, Simon, et al.
Published: (2022)

Randomized and quantum approximate matrix multiplication
by: Apers, Simon, et al.
Published: (2025)

On the quantum time complexity of divide and conquer
by: Allcock, Jonathan, et al.
Published: (2023)

Quartic quantum speedups for community detection
by: Schmidhuber, Alexander, et al.
Published: (2025)

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)

Variational ground-state quantum adiabatic theorem
by: Žunkovič, Bojan, et al.
Published: (2024)

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

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

Diagram Control and Model Order for Sugiyama Layouts
by: Domrös, Sören, et al.
Published: (2024)

A Note on Dynamic Bidirected Dyck-Reachability with Cycles
by: Zhang, Qirun
Published: (2024)

Implementing Binary Search Trees in GP 2 (Extended Abstract)
by: Alaoui, Ziad Ismaili, et al.
Published: (2026)

Optimizations and extensions for fair join pattern matching
by: Karras, Ioannis
Published: (2025)

Towards Efficient Hash Maps in Functional Array Languages
by: Due, William Henrich, et al.
Published: (2025)

AbsInf: A Lightweight Object to Represent float('inf') in Dijkstra's Algorithm
by: Bellamkonda, Anjan, et al.
Published: (2025)

Efficient Dynamic Algorithms to Predict Short Races
by: Zhang, Minjian, et al.
Published: (2026)

Parsing Millions of URLs per Second
by: Nizipli, Yagiz, et al.
Published: (2023)

Analysis of sum-of-squares relaxations for the quantum rotor model
by: Rao, Sujit
Published: (2023)

Assessing fault-tolerant quantum advantage for $k$-SAT with structure
by: Brehm, Martijn, et al.
Published: (2024)