ﻻ يوجد ملخص باللغة العربية
We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a generalised stabilizer formalism to describe this class of states. We introduce the notion of k-uniformity and show that this gives rise to classes of states which are inequivalent under the action of the local Pauli group. Finally we disclose a one-to-one correspondence with states employed in quantum algorithms, such as Deutsch-Jozsas and Grovers.
We study the entanglement content of the states employed in the Grover algorithm after the first oracle call when a few searched items are concerned. We then construct a link between these initial states and hypergraphs, which provides an illustration of their entanglement properties.
The min-cut function of weighted hypergraphs and the von Neumann entropy of pure quantum states are both symmetric submodular functions. In this note, we explain this coincidence by proving that the min-cut function of any weighted hypergraph can be
Quantum algorithms are usually described as monolithic circuits, becoming large at modest input size. Near-term quantum architectures can only manage a small number of qubits. We develop an automated method to distribute quantum circuits over multipl
We show how continuous matrix product states of quantum field theories can be described in terms of the dissipative non-equilibrium dynamics of a lower-dimensional auxiliary boundary field theory. We demonstrate that the spatial correlation functions
The statistical properties of photons are fundamental to investigating quantum mechanical phenomena using light. In multi-photon, two-mode systems, correlations may exist between outcomes of measurements made on each mode which exhibit useful propert