activity
20192026
most citedMinimal Codes From Characteristic Functions Not Satisfying The Ashikhmin-Barg Condition

2 citations · 4 across the 9 of their papers we have counts for

collaborators
Showing quant-phShow all

5 papers · 1 filter

quant-ph2026

Quasi-optimal quantum Markov chain spectral gap estimation

Adam Connolly, Steven Herbert, Julien Sorci

This paper proposes a quantum algorithm for Markov chain spectral gap estimation that is quasi-optimal (i.e., optimal up to a polylogarithmic factor) in the number of vertices for…

quant-ph2024

Comparing quantum and classical Monte Carlo algorithms for estimating Betti numbers of clique complexes

Ismail Yunus Akhalwaya, Ahmed Bhayat, Adam Connolly +4

Several quantum and classical Monte Carlo algorithms for Betti Number Estimation (BNE) on clique complexes have recently been proposed, though it is unclear how their performances…

quant-ph2023

Almost-Optimal Computational Basis State Transpositions

Steven Herbert, Julien Sorci, Yao Tang

We give an explicit construction to perform any -qubit computational basis state transposition using gates. This nearly coincides with the lower bound on…

quant-ph2023★ 1 cited

A Modular Engine for Quantum Monte Carlo Integration

Ismail Yunus Akhalwaya, Adam Connolly, Roland Guichard +8

We present the Quantum Monte Carlo Integration (QMCI) engine developed by Quantinuum. It is a quantum computational tool for evaluating multi-dimensional integrals that arise in va…

quant-ph2022

Average Mixing in Quantum Walks of Reversible Markov Chains

Julien Sorci

The Szegedy quantum walk is a discrete time quantum walk model which defines a quantum analogue of any Markov chain. The long-term behavior of the quantum walk can be encoded in a…