4 citations · 4 across the 5 of their papers we have counts for
6 papers
Link-middle-cut lower bounds for Clifford circuit synthesis
Søren Fuglede Jørgensen
Minimizing the number of CNOT gates required to synthesize a Clifford operator is a central problem in quantum circuit optimization. We extend the link--middle--cut (LMC) framework…
Lower bounds for the CNOT-complexity of linear reversible operators
Søren Fuglede Jørgensen
The CNOT-complexity of an invertible matrix over is the minimum number of CNOT gates needed to synthesize the corresponding linear reversible operator. While the max…
Variance reduction methods in the estimation of Pauli sums
Søren Fuglede Jørgensen, Rafael Emilio Barfknecht, Patrick Ettenhuber +1
Accurately estimating expectation values of quantum observables with as few measurements as possible is crucial to many quantum computing applications. We introduce a framework tha…
On Exact Sizes of Minimal CNOT Circuits
Jens Emil Christensen, Søren Fuglede Jørgensen, Andreas Pavlogiannis +1
Computing a minimum-size circuit that implements a certain function is a standard optimization task. We consider circuits of CNOT gates, which are fundamental binary gates in rever…
On the clique covering numbers of Johnson graphs
Søren Fuglede Jørgensen
We initiate a study of the vertex clique covering numbers of Johnson graphs , the smallest numbers of cliques necessary to cover the vertices of those graphs. We prove ide…
Sublinear Time Shortest Path in Expander Graphs
Noga Alon, Allan Grønlund, Søren Fuglede Jørgensen +1
Computing a shortest path between two nodes in an undirected unweighted graph is among the most basic algorithmic tasks. Breadth first search solves this problem in linear time, wh…