Quantum query complexity SDP source code

This page stores the Matlab source code to compute the quantum query complexity SDP of Barnum, Saks and Szegedy, as used in the paper "On exact quantum query complexity" by Ashley Montanaro, Richard Jozsa and Graeme Mitchison.

The code requires the CVX package for Matlab.

Usage: each function is parametrised by a pair (n,t), takes as input the truth table of a boolean function on n variables, as a column vector, and returns the optimal success probability of any quantum algorithm computing f using t queries.