Quantum Physics

 In the framework of ontological models, the features of quantum

theory that emerge as inherently nonclassical always involve properties that

are fine tuned, i.e.  properties that hold at the operational level but break at the

ontological level (they only hold for fine tuned values of the ontic parameters). Famous

examples of fine tuned properties are noncontextuality and locality. We here

develop a precise theory-independent mathematical framework for characterizing

operational fine tunings. These are distinct from causal fine tunings — already

introduced by Wood and Spekkens — as they do not involve any assumption

on the underlying causal structure. We show how all the already known examples of

operational fine tunings fit into our framework, we discuss possibly new fine tunings

and we use the framework to shed new light on the relation between nonlocality

and generalized contextuality. The framework is set in the language of functors in category

theory and it aims at unifying the spooky properties of quantum theory as well as

accounting for new ones.

Schur-Weyl duality, arising from tensor-power representations of the unitary group, is a big useful hammer in the quantum information toolbox. This is especially the case for problems which have a full unitary invariance, say, estimating the spectrum of a quantum state from a few copies. Many problems in quantum computing have a smaller symmetry group: the Clifford group. This talk will show how to decompose tensor-power Clifford representations through a Schur-Weyl type construction. Our results are also relevant for the theory of Howe duality between symplectic and orthogonal groups.

Query complexity is a common tool for comparing quantum and classical computation, and it has produced many examples of how quantum algorithms differ from classical ones. Here we investigate in detail the role that oracles play for the advantage of quantum algorithms. We do so by using a simulation framework, Quantum Simulation Logic (QSL), to construct oracles and algorithms that solve some problems with the same success probability and number of queries as the quantum algorithms. The framework can be simulated using only classical resources at a constant overhead as compared to the quantum resources used in quantum computation. Our results clarify the assumptions made and the conditions needed when using quantum oracles. Using the same assumptions on oracles within the simulation framework we show that for some specific algorithms, such as the Deutsch-Jozsa and Simon’s algorithms, there simply is no advantage in terms of query complexity. This does not detract from the fact that quantum query complexity provides examples of how a quantum computer can be expected to behave, which in turn has proved useful for finding new quantum algorithms outside of the oracle paradigm, where the most prominent example is Shor’s algorithm for integer factorization.