arXiv subjects

Dominic Horsman

Publications and source records attributed to Dominic Horsman.

28 records · Page 2Linked to original sources

arXiv2012

Optimising the Solovay-Kitaev algorithm

The Solovay-Kitaev algorithm is the standard method used for approximating arbitrary single-qubit gates for fault-tolerant quantum computation. In this paper we introduce a technique called "search space expansion", which modifies the initial stage of the Solovay-Kitaev algorithm, increasing the length of the possible approximating sequences but without requiring an exhaustive search over all possible sequences. We show that our technique, combined with a GNAT geometric tree search outputs gate sequences that are almost an order of magnitude smaller for the same level of accuracy. This therefore significantly reduces the error correction requirements for quantum algorithms on encoded fault-tolerant hardware.

quant-ph↗

arXiv2011

Layer by layer generation of cluster states

Cluster states can be used to perform measurement-based quantum computation. The cluster state is a useful resource, because once it has been generated only local operations and measurements are needed to perform universal quantum computation. In this paper, we explore techniques for quickly and deterministically building a cluster state. In particular we consider generating cluster states on a qubus quantum computer, a computational architecture which uses a continuous variable ancilla to generate interactions between qubits. We explore several techniques for building the cluster, with the number of operations required depending on whether we allow the ability to destroy previously created controlled-phase links between qubits. In the case where we can not destroy these links, we show how to create an n x m cluster using just 3nm -2n -3m/2 + 3 operations. This gives more than a factor of 2 saving over a naive method. Further savings can be obtained if we include the ability to destroy links, in which case we only need (8nm-4n-4m-8)/3 operations. Unfortunately the latter scheme is more complicated so choosing the correct order to interact the qubits is considerably more difficult. A half way scheme, that keeps a modular generation but saves additional operations over never destroying links requires only 3nm-2n-2m+4 operations. The first scheme and the last scheme are the most practical for building a cluster state because they split up the generation into the repetition of simple sections.

quant-ph↗

arXiv2011

Recursive quantum repeater networks

Internet-scale quantum repeater networks will be heterogeneous in physical technology, repeater functionality, and management. The classical control necessary to use the network will therefore face similar issues as Internet data transmission. Many scalability and management problems that arose during the development of the Internet might have been solved in a more uniform fashion, improving flexibility and reducing redundant engineering effort. Quantum repeater network development is currently at the stage where we risk similar duplication when separate systems are combined. We propose a unifying framework that can be used with all existing repeater designs. We introduce the notion of a Quantum Recursive Network Architecture, developed from the emerging classical concept of 'recursive networks', extending recursive mechanisms from a focus on data forwarding to a more general distributed computing request framework. Recursion abstracts independent transit networks as single relay nodes, unifies software layering, and virtualizes the addresses of resources to improve information hiding and resource management. Our architecture is useful for building arbitrary distributed states, including fundamental distributed states such as Bell pairs and GHZ, W, and cluster states.

quant-ph↗

arXiv2011

Reduce, reuse, recycle, for robust cluster state generation

Efficient generation of cluster states is crucial for engineering large-scale measurement-based quantum computers. Hybrid matter-optical systems offer a robust, scalable path to this goal. Such systems have an ancilla which acts as a bus connecting the qubits. We show that by generating smaller cluster "Lego bricks", reusing one ancilla per brick, the cluster can be produced with maximal efficiency, requiring fewer than half the operations compared with no bus reuse. By reducing the time required to prepare sections of the cluster, bus reuse more than doubles the size of the computational workspace that can be used before decoherence effects dominate. A row of buses in parallel provides fully scalable cluster state generation requiring only 20 CPhase gates per bus use.

quant-ph↗

arXiv2009

Hybrid hypercomputing: towards a unification of quantum and classical computation

We investigate the computational power and unified resource use of hybrid quantum-classical computations, such as teleportation and measurement-based computing. We introduce a physically causal and local graphical calculus for quantum information theory, which enables high-level intuitive reasoning about quantum information processes. The graphical calculus defines a local information flow in a computation which satisfies conditions for physical causality. We show how quantum and classical processing units can now be formally integrated, and give an analysis of the joint resources used in a typical measurement-based computation. Finally, we discuss how this picture may be used to give a high-level unified model for hybrid quantum computing.

quant-ph↗

arXiv2009

An introduction to many worlds in quantum computation

The interpretation of quantum mechanics is an area of increasing interest to many working physicists. In particular, interest has come from those involved in quantum computing and information theory, as there has always been a strong foundational element in this field. This paper introduces one interpretation of quantum mechanics, a modern `many-worlds' theory, from the perspective of quantum computation. Reasons for seeking to interpret quantum mechanics are discussed, then the specific `neo-Everettian' theory is introduced and its claim as the best available interpretation defended. The main objections to the interpretation, including the so-called ``problem of probability'' are shown to fail. The local nature of the interpretation is demonstrated, and the implications of this both for the interpretation and for quantum mechanics more generally are discussed. Finally, the consequences of the theory for quantum computation are investigated, and common objections to using many worlds to describe quantum computing are answered. We find that using this particular many-worlds theory as a physical foundation for quantum computation gives several distinct advantages over other interpretations, and over not interpreting quantum theory at all.

quant-ph↗

arXiv2008

Quantum Computation and Many Worlds

An Everett (`Many Worlds') interpretation of quantum mechanics due to Saunders and Zurek is presented in detail. This is used to give a physical description of the process of a quantum computation. Objections to such an understanding are discussed.

quant-ph↗

arXiv2007

Developing the Deutsch-Hayden approach to quantum mechanics

The formalism of Deutsch and Hayden is a useful tool for describing quantum mechanics explicitly as local and unitary, and therefore quantum information theory as concerning a "flow" of information between systems. In this paper we show that these physical descriptions of flow are unique, and develop the approach further to include the measurement interaction and mixed states. We then give an analysis of entanglement swapping in this approach, showing that it does not in fact contain non-local effects or some form of superluminal signalling.

quant-ph↗

arXiv2007

Entanglement without nonlocality

We consider the characterization of entanglement from the perspective of a Heisenberg formalism. We derive an original two-party generalized separability criteria, and from this describe a novel physical understanding of entanglement. We find that entanglement may be considered as fundamentally a local effect, and therefore as a separable computational resource from nonlocality. We show how entanglement differs from correlation physically, and explore the implications of this new conception of entanglement for the notion of classicality. We find that this understanding of entanglement extends naturally to multipartite cases.

quant-ph↗

arXiv2003

The Many Worlds of Uncertainty

The status of the uncertainty relations varies between the different interpretations of quantum mechanics. The aim of the current paper is to explore their meanings within a certain neo-Everettian many worlds interpretation. We will also look at questions that have been linked with the uncertainty relations since Heisenberg's uncertainty principle: those of joint and repeated measurement of non-commuting (or otherwise `incompatible') observables. This will have implications beyond the uncertainty relations, as we will see the fundamentally different way in which statistical statements are interpreted in the neo-Everett theory that we use.

quant-ph↗