Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

AIP conference proceedings

Qubus ancilla-driven quantum computation

Katherine Louise Brown, Suvabrata De, Viv M. Kendon, Bill Munro

Published Jan 1, 2014• 1 citation
Publisher

Abstract

Hybrid matter-optical systems offer a robust, scalable path to quantum computation. Such systems have an ancilla which acts as a bus connecting the qubits. We demonstrate how using a continuous variable qubus as the ancilla provides savings in the total number of operations required when computing with many qubits.
DOI
10.1063/1.4903145

Related papers

Robust cluster state generation using ancilla-based systems

Viv M. Kendon, Katherine Louise Brown, Clare Horsman +1 more

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. Ancilla-driven schemes are important for chip-based quantum computing architectures, where the flying ancilla mediates between static qubits. Hybrid architectures form a natural substrate for measurement-based quantum computing (MBQC) [1], one type of which (the topological model) has the best error threshold for quantum computing [2]. In this type of processing a highly-entangled cluster state is generated, and then computation performed by sequential qubit measurements. The quantum processing task is to generate the cluster state, after which it becomes a matter of measurement and classical communication. In physically-realizable implementations the cluster is prepared dynamically, a few layers at a time. As the cluster state is the fundamental quantum resource of a measurement-based computation, it becomes extremely important to make it as error-free as possible. Errors in constructing the cluster can propagate rapidly through a computation because of the highly-entangled nature of the state, leading to failure of the computation. Hybrid systems are susceptible to specific error types that other systems are not, because of the use of the mediating ancilla. In cases where the ancilla is not destroyed after each gate there is a nonzero probability of errors propagating through ancilla reuse. FIG. 1: A cluster of 4 bricks of length b = 5 qubits, each made using a different bus. We present the optimal scheme for dynamic fault-tolerant 2-D cluster state generation in hybrid systems where the mediating system can be used for more than a single gate operation without being reset. We divide the cluster state into “Lego bricks”, each of which uses a single bus. We give the optimal method for constructing the bricks, reducing the number of system-bus entanglements. We then show how to determine the block size based on the error threshold of the system being used. We find that, even when the probability of error in the system is high, this scheme can still deliver significant efficiency savings through bus reuse, enabling a larger cluster to be generated. 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 [3]. A simple example of the bricks is shown in figure 1. They are always the same height (m direction), but have length b (n direction) determined by [3] 1 ¡1 − exp[−(6b + 4)γτ − 16bηβ2]¢ ≤ ε. (1) 2 For a given set of experimental parameters γ, τ, η and β, and desired dephasing limit to ε, this determines b. If we use one bus per CPhase gate to generate a brick, we have 1 ¡1 − exp[−16bγτ − 4ηβ2]¢ ≤ ε. (2) 2 Comparing equations (1) and (2), we find our Lego scheme produces less qubit dephasing than using one bus per CPhase gate provided ηβ2 < ∼ γτ/2. Compared with 8mn − 4(m + n) bus operations with no bus reuse, for large clusters, the Lego scheme uses less than half for b > 2. And even for b = 1, the reduction is O(5mn) compared to O(8mn), equivalent to the method of [4] for five qubits per bus. This will thus be the method of choice for any ancilla-based cluster generation that allows bus reuse. Our results are directly applicable to bus-based experimental production of cluster states, enabling the same FIG. 2: Dynamic generation using multiple ancillas. resources to produce dynamically-generated cluster states of twice the size compared to single-gate bus use, see fig. 2. For multi-bus dynamic schemes, fully scalable operation can be achieved with half the coherence time compared to single-gate buses, needing as few as 20 CPhase gates per bus. We thank Aram Harrow, Ashley Stephens and Simon Devitt for useful discussions. CH was supported by EU project QAP and the Bristol Centre for Nanoscience and Quantum Information. KLB is supported by a UK Engineering and Physical Sciences Research Council industrial CASE studentship from Hewlett-Packard, VMK is supported by a UK Royal Society University Research Fellowship and WJM acknowledges partial support from the EU project HIP and MEXT in Japan.

International Conference on Quantum Information•Jan 1, 2011•0 citations

Reduce, reuse, recycle for robust cluster-state generation

Dominic C. Horsman, Katherine L. Brown, William J. Munro +1 more

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 the cluster in smaller sections of interlocking 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 controlled-phase gates per bus use.

arXiv:1005.1621•Physical Review A•Apr 21, 2011•27 citations

Ancilla-based quantum simulation

Katherine L. Brown, Suvabrata De, Viv M. Kendon +1 more

We describe in detail how a qubus quantum computer using a continuous variable ancilla to control the qubits can provide significant efficiency savings for quantum simulation. We illustrate this by using as an example the simulation of the Bardeen, Cooper and Schrieffer (BCS) Hamiltonian, a model of low-temperature superconductivity. We demonstrate an O(Ns) improvement over previous studies conducted on an NMR computer [1, 2] for nearest- neighbour and completely general cases. We make these results controlled on an ancilla qubit so that we can apply the phase estimation algorithm, and hence show that when N ≥ 5, our qubus simulation requires significantly fewer operations than a similar simulation conducted on an NMR computer.

Research in Optical Sciences•Jan 1, 2012•4 citations

Parallelizing gates with high-dimensional ancillas

Katherine L. Brown, Suvabrata De, Viv M. Kendon

A qubus quantum computer can perform a quantum Fourier transform with a linear number of operations. This implies continuous-variable ancilla-driven quantum computation is equivalent to the quantum circuit model plus unbounded fan-out.

Conference on Lasers and Electro-Optics•Jan 1, 2012•0 citations

Quantum computation by communication

T P Spiller, Kae Nemoto, Samuel L. Braunstein +3 more

We present here a new approach to scalable quantum computing—a 'qubus computer'—which realizes qubit measurement and quantum gates through interacting qubits with a quantum communication bus mode. The qubits could be 'static' matter qubits or 'flying' optical qubits, but the scheme we focus on here is particularly suited to matter qubits. There is no requirement for direct interaction between the qubits. Universal two-qubit quantum gates may be effected by schemes which involve measurement of the bus mode, or by schemes where the bus disentangles automatically and no measurement is needed. In effect, the approach integrates together qubit degrees of freedom for computation with quantum continuous variables for communication and interaction.

arXiv:quant-ph/0509202•New Journal of Physics•Feb 27, 2006•202 citations

Using the qubus for quantum computing

Katherine Louise Brown

In this thesis I explore using the qubus for quantum computing. The qubus is an architecture of quantum computing, where a continuous variable ancilla is used to generate operations between matter qubits. I concentrate on using the qubus for two purposes - quantum simulation, and generating cluster states. Quantum simulation is the idea of using a quantum computer to simulate a quantum system. I focus on conducting a simulation of the BCS Hamiltonian. I demonstrate how to perform the necessary two qubit operations in a controlled fashion using the qubus. In particular I demonstrate an O(N3) saving over an implementation on an NMR computer, and a factor of 2 saving over a naıve technique. I also discuss how to perform the quantum Fourier transform on the qubus quantum computer. I show that it is possible to perform the quantum Fourier transform using just, 24⌊N/2⌋ + 7N − 6, this is an O(N) saving over a naıve method. In the second part of the thesis, I move on, and consider generating cluster states using the qubus. A cluster state, is a universal resource for one-way or measurement-based computation. In one-way computation, the pre-generated, entangled resource is used to perform calculations, which only require local corrections and measurement. I demonstrate that the qubus can generate cluster states deterministically, and in a relatively short time. I discuss several techniques of cluster state generation, one of which is optimal, given the physical architecture we are using. This can generate an n × m cluster in only 3nm − 2n − 2m + 4 operations. The alternative techniques look at generating a cluster using layers or columns, allowing it to be built dynamically, while the cluster is used to perform calculations. I then move on, and discuss problems with error accumulation in the generation process.

•Apr 1, 2011•7 citations
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. Ancilla-driven schemes are important for chip-based quantum computing architectures, where the flying ancilla mediates between static qubits. Hybrid architectures form a natural substrate for measurement-based quantum computing (MBQC) [1], one type of which (the topological model) has the best error threshold for quantum computing [2]. In this type of processing a highly-entangled cluster state is generated, and then computation performed by sequential qubit measurements. The quantum processing task is to generate the cluster state, after which it becomes a matter of measurement and classical communication. In physically-realizable implementations the cluster is prepared dynamically, a few layers at a time. As the cluster state is the fundamental quantum resource of a measurement-based computation, it becomes extremely important to make it as error-free as possible. Errors in constructing the cluster can propagate rapidly through a computation because of the highly-entangled nature of the state, leading to failure of the computation. Hybrid systems are susceptible to specific error types that other systems are not, because of the use of the mediating ancilla. In cases where the ancilla is not destroyed after each gate there is a nonzero probability of errors propagating through ancilla reuse. FIG. 1: A cluster of 4 bricks of length b = 5 qubits, each made using a different bus. We present the optimal scheme for dynamic fault-tolerant 2-D cluster state generation in hybrid systems where the mediating system can be used for more than a single gate operation without being reset. We divide the cluster state into “Lego bricks”, each of which uses a single bus. We give the optimal method for constructing the bricks, reducing the number of system-bus entanglements. We then show how to determine the block size based on the error threshold of the system being used. We find that, even when the probability of error in the system is high, this scheme can still deliver significant efficiency savings through bus reuse, enabling a larger cluster to be generated. 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 [3]. A simple example of the bricks is shown in figure 1. They are always the same height (m direction), but have length b (n direction) determined by [3] 1 ¡1 − exp[−(6b + 4)γτ − 16bηβ2]¢ ≤ ε. (1) 2 For a given set of experimental parameters γ, τ, η and β, and desired dephasing limit to ε, this determines b. If we use one bus per CPhase gate to generate a brick, we have 1 ¡1 − exp[−16bγτ − 4ηβ2]¢ ≤ ε. (2) 2 Comparing equations (1) and (2), we find our Lego scheme produces less qubit dephasing than using one bus per CPhase gate provided ηβ2 < ∼ γτ/2. Compared with 8mn − 4(m + n) bus operations with no bus reuse, for large clusters, the Lego scheme uses less than half for b > 2. And even for b = 1, the reduction is O(5mn) compared to O(8mn), equivalent to the method of [4] for five qubits per bus. This will thus be the method of choice for any ancilla-based cluster generation that allows bus reuse. Our results are directly applicable to bus-based experimental production of cluster states, enabling the same FIG. 2: Dynamic generation using multiple ancillas. resources to produce dynamically-generated cluster states of twice the size compared to single-gate bus use, see fig. 2. For multi-bus dynamic schemes, fully scalable operation can be achieved with half the coherence time compared to single-gate buses, needing as few as 20 CPhase gates per bus. We thank Aram Harrow, Ashley Stephens and Simon Devitt for useful discussions. CH was supported by EU project QAP and the Bristol Centre for Nanoscience and Quantum Information. KLB is supported by a UK Engineering and Physical Sciences Research Council industrial CASE studentship from Hewlett-Packard, VMK is supported by a UK Royal Society University Research Fellowship and WJM acknowledges partial support from the EU project HIP and MEXT in Japan.
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 the cluster in smaller sections of interlocking 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 controlled-phase gates per bus use.
We describe in detail how a qubus quantum computer using a continuous variable ancilla to control the qubits can provide significant efficiency savings for quantum simulation. We illustrate this by using as an example the simulation of the Bardeen, Cooper and Schrieffer (BCS) Hamiltonian, a model of low-temperature superconductivity. We demonstrate an O(Ns) improvement over previous studies conducted on an NMR computer [1, 2] for nearest- neighbour and completely general cases. We make these results controlled on an ancilla qubit so that we can apply the phase estimation algorithm, and hence show that when N ≥ 5, our qubus simulation requires significantly fewer operations than a similar simulation conducted on an NMR computer.
We present here a new approach to scalable quantum computing—a 'qubus computer'—which realizes qubit measurement and quantum gates through interacting qubits with a quantum communication bus mode. The qubits could be 'static' matter qubits or 'flying' optical qubits, but the scheme we focus on here is particularly suited to matter qubits. There is no requirement for direct interaction between the qubits. Universal two-qubit quantum gates may be effected by schemes which involve measurement of the bus mode, or by schemes where the bus disentangles automatically and no measurement is needed. In effect, the approach integrates together qubit degrees of freedom for computation with quantum continuous variables for communication and interaction.
In this thesis I explore using the qubus for quantum computing. The qubus is an architecture of quantum computing, where a continuous variable ancilla is used to generate operations between matter qubits. I concentrate on using the qubus for two purposes - quantum simulation, and generating cluster states. Quantum simulation is the idea of using a quantum computer to simulate a quantum system. I focus on conducting a simulation of the BCS Hamiltonian. I demonstrate how to perform the necessary two qubit operations in a controlled fashion using the qubus. In particular I demonstrate an O(N3) saving over an implementation on an NMR computer, and a factor of 2 saving over a naıve technique. I also discuss how to perform the quantum Fourier transform on the qubus quantum computer. I show that it is possible to perform the quantum Fourier transform using just, 24⌊N/2⌋ + 7N − 6, this is an O(N) saving over a naıve method. In the second part of the thesis, I move on, and consider generating cluster states using the qubus. A cluster state, is a universal resource for one-way or measurement-based computation. In one-way computation, the pre-generated, entangled resource is used to perform calculations, which only require local corrections and measurement. I demonstrate that the qubus can generate cluster states deterministically, and in a relatively short time. I discuss several techniques of cluster state generation, one of which is optimal, given the physical architecture we are using. This can generate an n × m cluster in only 3nm − 2n − 2m + 4 operations. The alternative techniques look at generating a cluster using layers or columns, allowing it to be built dynamically, while the cluster is used to perform calculations. I then move on, and discuss problems with error accumulation in the generation process.