Searcharxiv⌕ Search

arXiv subjects

Dan E. Browne

Publications and source records attributed to Dan E. Browne.

57 records · Page 4Linked to original sources

Computational power of correlations

We study the intrinsic computational power of correlations exploited in measurement-based quantum computation. By defining a general framework the meaning of the computational power of correlations is made precise. This leads to a notion of resource states for measurement-based \textit{classical} computation. Surprisingly, the Greenberger-Horne-Zeilinger and Clauser-Horne-Shimony-Holt problems emerge as optimal examples. Our work exposes an intriguing relationship between the violation of local realistic models and the computational power of entangled resource states.

quant-ph↗

One-way Quantum Computation - a tutorial introduction

In this book chapter, we provide a tutorial introduction to one-way quantum computation and many of the techniques one can use to understand it. The techniques which are described include the stabilizer formalism and the logical Heisenberg picture. We highlight ways in which it is useful to understand one-way computation beyond simple equivalence with the quantum circuit model. We briefly review current proposals of implementations and experimental progress and summarize some recent related theoretical developments. Although the chapter is primarily didactic in focus, we include a number of new methods and observations. These include: a simpler and more compact formulation of one-way quantum computation in the stabilizer formalism; A new way of implementing unitaries diagonal in the computational basis; New results on the family of operations which may be implemented in a single round of measurements; A method for constructing compact one-way patterns by decomposing unitaries in terms of diagonal unitaries and Clifford group transformations.

quant-ph↗

Brokered Graph State Quantum Computing

We describe a procedure for graph state quantum computing that is tailored to fully exploit the physics of optically active multi-level systems. Leveraging ideas from the literature on distributed computation together with the recent work on probabilistic cluster state synthesis, our model assigns to each physical system two logical qubits: the broker and the client. Groups of brokers negotiate new graph state fragments via a probabilistic optical protocol. Completed fragments are mapped from broker to clients via a simple state transition and measurement. The clients, whose role is to store the nascent graph state long term, remain entirely insulated from failures during the brokerage. We describe an implementation in terms of NV-centres in diamond, where brokers and clients are very naturally embodied as electron and nuclear spins.

quant-ph↗