Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus

TL;DR

This paper refines the PBS-calculus, a graphical language for coherent quantum control, to optimize resource usage by minimizing oracle queries and polarising beam splitters, with proven efficiency and heuristics for complex cases.

Contribution

It introduces a resource-sensitive refinement of the PBS-calculus and an efficient procedure for resource optimization in coherent quantum computations.

Findings

The language is sound, complete, and minimal.

An efficient procedure for minimizing oracle queries is developed.

The combined minimization problem is NP-hard, but heuristics work well for certain cases.

Abstract

Coherent control of quantum computations can be used to improve some quantum protocols and algorithms. For instance, the complexity of implementing the permutation of some given unitary transformations can be strictly decreased by allowing coherent control, rather than using the standard quantum circuit model. In this paper, we address the problem of optimising the resources of coherently controlled quantum computations. We refine the PBS-calculus, a graphical language for coherent control which is inspired by quantum optics. In order to obtain a more resource-sensitive language, it manipulates abstract gates -- that can be interpreted as queries to an oracle -- and more importantly, it avoids the representation of useless wires by allowing unsaturated polarising beam splitters. Technically the language forms a coloured prop. The language is equipped with an equational theory that we show to be sound, complete, and minimal. Regarding resource optimisation, we introduce an efficient procedure to minimise the number of oracle queries of a given diagram. We also consider the problem of minimising both the number of oracle queries and the number of polarising beam splitters. We show that this optimisation problem is NP-hard in general, but introduce an efficient heuristic that produces optimal diagrams when at most one query to each oracle is required.