2 citations · 4 across the 9 of their papers we have counts for
9 papers
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…
Analyzing and improving a classical Betti number estimation algorithm
Julien Sorci
Recently, a classical algorithm for estimating the normalized Betti number of an arbitrary simplicial complex was proposed. Motivated by a quantum algorithm with a similar Monte Ca…
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…
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…
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…
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…
Continuous-time Quantum Walks on Cayley Graphs of Extraspecial Groups
Peter Sin, Julien Sorci
We study continuous-time quantum walks on normal Cayley graphs of certain non-abelian groups, called extraspecial groups. By applying general results for graphs in association sche…
Minimal Codes From Characteristic Functions Not Satisfying The Ashikhmin-Barg Condition
Julien Sorci
A minimal code is a linear code where the only instance that a codeword has its support contained in the support of another codeword is when the codewords are scalar multiples of e…
Linear representations of finite geometries and associated LDPC codes
Peter Sin, Julien Sorci, Qing Xiang
The {\it linear representation} of a subset of a finite projective space is an incidence system of affine points and lines determined by the subset. In this paper we use character…