From the 1 of 15 linked papers with an AI index.
1 citations · 2 across the 7 of their papers we have counts for
5 papers · 1 filter
Unitary Synthesis with Near-Optimal T-Count for Near-Clifford Unitaries
Wang Fang, Chris Heunen, Qisheng Wang
The paper proposes a method to synthesize any n‑qubit unitary as a Clifford+T circuit whose T‑gate count scales as ~2^n times the Frobenius distance to the Clifford group, achievin…
Free Quantum Computing
Jacques Carette, Chris Heunen, Robin Kaarsgaard +2
Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is…
Hadamard-Pi: Equational Quantum Programming
Wang Fang, Chris Heunen, Robin Kaarsgaard
Quantum computing offers advantages over classical computation, yet the precise features that set the two apart remain unclear. In the standard quantum circuit model, adding a 1-qu…
String Diagrams for Defect-Based Surface Code Computing
Mateusz Kupper, Dominic Horsman, Chris Heunen +1
Surface codes are a popular choice for implementing fault-tolerant quantum computing. Two-qubit gates may be realised in these codes using only nearest-neighbour interactions, eith…
A Brief Review of Quantum Machine Learning for Financial Services
Mina Doosti, Petros Wallden, Conor Brian Hamill +3
This review paper examines state-of-the-art algorithms and techniques in quantum machine learning with potential applications in finance. We discuss QML techniques in supervised le…