A modular design of molecular qubits to implement universal quantum gates

被引：197

作者：

Ferrando-Soria, Jesus ^{[1
,2
]}

Pineda, Eufemio Moreno ^{[1
,2
]}

Chiesa, Alessandro ^{[3
]}

Fernandez, Antonio ^{[1
,2
]}

Magee, Samantha A. ^{[1
,2
]}

Carretta, Stefano ^{[3
]}

Santini, Paolo ^{[3
]}

Vitorica-Yrezabal, Inigo J. ^{[1
,2
]}

Tuna, Floriana ^{[1
,2
]}

Timco, Grigore A. ^{[1
,2
]}

McInnes, Eric J. L. ^{[1
,2
]}

Winpenny, Richard E. P. ^{[1
,2
]}

机构：

[1] Univ Manchester, Sch Chem, Oxford Rd, Manchester M13 9PL, Lancs, England

[2] Univ Manchester, Photon Sci Inst, Oxford Rd, Manchester M13 9PL, Lancs, England

[3] Univ Parma, Dipartimento Fis & Sci Terra, Viale Sci 7-A, I-43123 Parma, Italy

来源：

NATURE COMMUNICATIONS | 2016年 / 7卷

基金：

英国工程与自然科学研究理事会;

关键词：

SPIN; COMPLEXES; RINGS; DECOHERENCE; COHERENCE; PHYSICS; TIME; ION;

D O I：

10.1038/ncomms11377

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

The physical implementation of quantum information processing relies on individual modules-qubits-and operations that modify such modules either individually or in groups-quantum gates. Two examples of gates that entangle pairs of qubits are the controlled NOT-gate (CNOT) gate, which flips the state of one qubit depending on the state of another, and the root iSWAP gate that brings a two-qubit product state into a superposition involving partially swapping the qubit states. Here we show that through supramolecular chemistry a single simple module, molecular {Cr7Ni} rings, which act as the qubits, can be assembled into structures suitable for either the CNOT or root iSWAP gate by choice of linker, and we characterize these structures by electron spin resonance spectroscopy. We introduce two schemes for implementing such gates with these supramolecular assemblies and perform detailed simulations, based on the measured parameters including decoherence, to demonstrate how the gates would operate.

引用

页数：10

共 51 条

[41]

Schubert U.S., 2006, MODERN TERPYRIDINE C

[42] Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer [J].