19 citations · 23 across the 8 of their papers we have counts for
10 papers
Clifford synthesis is NP-complete
Søren Fuglede Jørgensen
We show that the problem of synthesizing a quantum circuit for a given Clifford operator using at most a specified amount of resources is NP-complete for several resource models of…
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…
The Witten-Reshetikhin-Turaev invariant for links in finite order mapping tori I
Jørgen Ellegaard Andersen, Benjamin Himpel, Søren Fuglede Jørgensen +2
We state Asymptotic Expansion and Growth Rate conjectures for the Witten-Reshetikhin-Turaev invariants of arbitrary framed links in 3-manifolds, and we prove these conjectures for…
The homological content of the Jones representations at
Jens Kristian Egsgaard, Søren Fuglede Jørgensen
We generalize a discovery of Kasahara and show that the Jones representations of braid groups, when evaluated at , are related to the action on homology of a branched doubl…
On the Witten--Reshetikhin--Turaev invariants of torus bundles
Jørgen Ellegaard Andersen, Søren Fuglede Jørgensen
By methods similar to those used by Lisa Jeffrey, we compute the quantum -invariants for mapping tori of trace homeomorphisms of a genus surface when $N = 2…