Resource Optimisation of Coherently Controlled Quantum Computations with
the PBS-calculus
- URL: http://arxiv.org/abs/2202.05260v2
- Date: Thu, 22 Feb 2024 17:29:00 GMT
- Title: Resource Optimisation of Coherently Controlled Quantum Computations with
the PBS-calculus
- Authors: Alexandre Cl\'ement and Simon Perdrix
- Abstract summary: Coherent control of quantum computations can be used to improve some quantum protocols and algorithms.
We refine the PBS-calculus, a graphical language for coherent control inspired by quantum optics.
- Score: 55.2480439325792
- License: http://creativecommons.org/licenses/by/4.0/
- 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.
Related papers
Err
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.