Sequential measurement-based quantum computing with memories

Roncaglia, Augusto J.; Aolita, Leandro; Ferraro, Alessandro; Acín, Antonio

doi:10.1103/physreva.83.062332

Cited by 10 publications

(22 citation statements)

References 36 publications

(60 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Compared with previously published work related to MBQC, the QFPGA architecture combines small blocks of cluster states by using global buses, so as to make the overall structure more scalable, flexible, and also clear. On the other hand, we not only take advantage of the concept of quantum memory to drive the sequential MBQC, but we also integrate small modules to simplify the operation which is complex in the original paper [28]. Hence our model is more effective but at a cost of some level of decoherence error.…”

Section: Discussionmentioning

confidence: 99%

“…Our proposed architecture consists of two parts: The first part is an array of static, long-lived quantum memories that can interact with moving, short-lived quantum registers-flying qubits-via a fixed interaction [28]. We call this part "quantum routing channels" (QRCs), which are used as quantum routing resources and to realize diagonal unitary operators.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Programmable architecture for quantum computing

et al. 2013

View full text Add to dashboard Cite

A programmable architecture called "quantum FPGA (field-programmable gate array)" (QFPGA) is presented for quantum computing, which is a hybrid model combining the advantages of the qubus system and the measurement-based quantum computation. There are two kinds of buses in QFPGA, the local bus and the global bus, which generate the cluster states and general multiqubit rotations around the z axis, respectively. QFPGA consists of quantum logic blocks (QLBs) and quantum routing channels (QRCs). The QLB is used to generate a small quantum logic while the QRC is used to combine them properly for larger logic realization. Considering the error accumulating on the qubus, the small logic is the general two-qubit quantum gate. However, for the application such as n-qubit quantum Fourier transform, one QLB can be reconfigured for four-qubit quantum Fourier transform. Although this is an implementation-independent architecture, we still make a rough analysis of its performance based on the qubus system. In a word, QFPGA provides a general architecture to integrate different quantum computing models for efficient quantum logic construction.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Programmable architecture for quantum computing

et al. 2013

View full text Add to dashboard Cite

show abstract

“…For this reason, the same name will be used for the more general model developed here. Furthermore, we note that the basic gate methods used in our general QV ADQC model are closely related to those proposed by Roncaglia et al [41], although Ref. [41] only explicitly considers QCVs and qubits.…”

Section: Introductionmentioning

confidence: 94%

“…Note that this gate method is essentially equivalent to that proposed in Ref. [41]. Ignoring the Pauli errors for now, the two gate methods presented above implement gates which are sufficient for universal quantum computation for all types of QVs as they can generate an entangling gate F [by taking the phase function to be ϑ(q) = 0 for all q] and any rotation gate [as…”

Section: A a Universal Gate Setmentioning

confidence: 99%

Ancilla-driven quantum computation for qudits and continuous variables

et al. 2017

View full text Add to dashboard Cite

(2017) 'Ancilla-driven quantum computation for qudits and continuous variables. ', Physical review A., 95 (5). 052317.Further information on publisher's website:https://doi.org/10.1103/PhysRevA.95.052317Publisher's copyright statement:Reprinted with permission from the American Physical Society: Physical Review A 95, 052317 c (2017) by the American Physical Society. Readers may view, browse, and/or download material for temporary copying purposes only, provided these uses are for noncommercial personal purposes. Except as provided by law, this material may not be further reproduced, distributed, transmitted, modied, adapted, performed, displayed, published, or sold in whole or part, without prior written permission from the American Physical Society.Additional information: Use policyThe full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes provided that:• a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders.Please consult the full DRO policy for further details. Although qubits are the leading candidate for the basic elements in a quantum computer, there are also a range of reasons to consider using higher-dimensional qudits or quantum continuous variables (QCVs). In this paper, we use a general "quantum variable" formalism to propose a method of quantum computation in which ancillas are used to mediate gates on a well-isolated "quantum memory" register and which may be applied to the setting of qubits, qudits (for d > 2), or QCVs. More specifically, we present a model in which universal quantum computation may be implemented on a register using only repeated applications of a single fixed two-body ancilla-register interaction gate, ancillas prepared in a single state, and local measurements of these ancillas. In order to maintain determinism in the computation, adaptive measurements via a classical feed forward of measurement outcomes are used, with the method similar to that in measurement-based quantum computation (MBQC). We show that our model has the same hybrid quantum-classical processing advantages as MBQC, including the power to implement any Clifford circuit in essentially one layer of quantum computation. In some physical settings, high-quality measurements of the ancillas may be highly challenging or not possible, and hence we also present a globally unitary model which replaces the need for measurements of the ancillas with the requirement for ancillas to be prepared in states from a fixed orthonormal basis. Finally, we discuss settings in which these models may be of practical interest.

show abstract

“…This is in fact not the case in the context of cluster state quantum computation, where it is not necessary to build the entire cluster ahead of the computational task to perform, but rather it is possible to build and consume the cluster during the computation itself (see, e.g., Refs. [71][72][73]). …”

Section: Robustness Of the Graph-state Generation Against Mechanimentioning

confidence: 99%

Generation of cluster states in optomechanical quantum systems

2015

Self Cite

View full text Add to dashboard Cite

We consider an optomechanical quantum system composed of a single cavity mode interacting with N mechanical resonators. We propose a scheme for generating continuous-variable graph states of arbitrary size and shape, including the so-called cluster states for universal quantum computation. The main feature of this scheme is that, differently from previous approaches, the graph states are hosted in the mechanical degrees of freedom rather than in the radiative ones. Specifically, via a 2N -tone drive, we engineer a linear Hamiltonian which is instrumental to dissipatively drive the system to the desired target state. The robustness of this scheme is assessed against finite interaction times and mechanical noise, confirming it as a valuable approach towards quantum state engineering for continuous-variable computation in a solid-state platform.

show abstract

Sequential measurement-based quantum computing with memories

Cited by 10 publications

References 36 publications

Programmable architecture for quantum computing

Programmable architecture for quantum computing

Ancilla-driven quantum computation for qudits and continuous variables

Generation of cluster states in optomechanical quantum systems

Contact Info

Product

Resources

About