19 citations · 23 across the 8 of their papers we have counts for
5 papers · 1 filter
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…