Skip to main content

Controlling Qubit Networks in Polynomial Time

Author(s): Arenz, Christian; Rabitz, Herschel

To refer to this page use:
Abstract: Future quantum devices often rely on favorable scaling with respect to the number of system components. To achieve desirable scaling, it is therefore crucial to implement unitary transformations in a time that scales at most polynomial in the number of qubits. We develop an upper bound for the minimum time required to implement a unitary transformation on a generic qubit network in which each of the qubits is subject to local time dependent controls. Based on the developed upper bound, the set of gates is characterized that can be implemented polynomially in time. Furthermore, we show how qubit systems can be concatenated through controllable two body interactions, making it possible to implement the gate set efficiently on the combined system. Finally, a system is identified for which the gate set can be implemented with fewer controls.
Publication Date: 30-May-2018
Citation: Arenz, C, Rabitz, H. (2018). Controlling Qubit Networks in Polynomial Time. Physical Review Letters, 120 (22), 10.1103/PhysRevLett.120.220503
DOI: doi:10.1103/PhysRevLett.120.220503
ISSN: 0031-9007
EISSN: 1079-7114
Pages: 220503-1 - 220503-6
Type of Material: Journal Article
Journal/Proceeding Title: Physical Review Letters
Version: Final published version. Article is made available in OAR by the publisher's permission or policy.

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.