QUANTUM DOT COMPUTING GATES

2006 ◽  
Vol 04 (02) ◽  
pp. 233-296 ◽  
Author(s):  
GOONG CHEN ◽  
ZIJIAN DIAO ◽  
JONG U. KIM ◽  
ARUP NEOGI ◽  
KERIM URTEKIN ◽  
...  
Keyword(s):  
Quantum Dots ◽  
Quantum Computing ◽  
Quantum Dot ◽  
Quantum Computer ◽  
Semiconductor Quantum Dots ◽  
Quantum Gates ◽  
Promising Candidate ◽  
Universal Quantum ◽  
Physical Attributes

Semiconductor quantum dots are a promising candidate for future quantum computer devices. Presently, there are three major proposals for designing quantum computing gates based on quantum dot technology: (i) electrons trapped in microcavity; (ii) spintronics; (iii) biexcitons. We survey these designs and show mathematically how, in principle, they will generate 1-bit rotation gates as well as 2-bit entanglement and, thus, provide a class of universal quantum gates. Some physical attributes and issues related to their limitations, decoherence and measurement are also discussed.

scholarly journals Realization of efficient quantum gates with a superconducting qubit-qutrit circuit

2019 ◽  
Vol 9 (1) ◽  
Author(s):  
T. Bækkegaard ◽  
L. B. Kristensen ◽  
N. J. S. Loft ◽  
C. K. Andersen ◽  
D. Petrosyan ◽  
...  
Keyword(s):  
Quantum Computing ◽  
Quantum Computer ◽  
Operation Time ◽  
Good Control ◽  
Quantum Gates ◽  
Superconducting Qubit ◽  
Promising Candidate ◽  
Superconducting Circuit ◽  
Daunting Challenge ◽  
Generation Of Entanglement

Abstract Building a quantum computer is a daunting challenge since it requires good control but also good isolation from the environment to minimize decoherence. It is therefore important to realize quantum gates efficiently, using as few operations as possible, to reduce the amount of required control and operation time and thus improve the quantum state coherence. Here we propose a superconducting circuit for implementing a tunable system consisting of a qutrit coupled to two qubits. This system can efficiently accomplish various quantum information tasks, including generation of entanglement of the two qubits and conditional three-qubit quantum gates, such as the Toffoli and Fredkin gates. Furthermore, the system realizes a conditional geometric gate which may be used for holonomic (non-adiabatic) quantum computing. The efficiency, robustness and universality of the presented circuit makes it a promising candidate to serve as a building block for larger networks capable of performing involved quantum computational tasks.

scholarly journals Universal quantum computation via quantum controlled classical operations

2021 ◽  
Author(s):  
Sebastian Horvat ◽  
Xiaoqin Gao ◽  
Borivoje Dakic
Keyword(s):  
Quantum Computing ◽  
Control System ◽  
Quantum Computation ◽  
Quantum Control ◽  
Quantum Computer ◽  
Affirmative Answer ◽  
Quantum Gates ◽  
Processing Power ◽  
Universal Quantum ◽  
Hadamard Gate

Abstract A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results in universal quantum computing. Motivated by the latter, we pose the following question: can one perform universal quantum computation by supplementing a set of classical gates with a quantum control, and a set of quantum gates operating solely on the latter? In this work we provide an affirmative answer to this question by considering a computational model that consists of 2n target bits together with a set of classical gates controlled by log(2n + 1) ancillary qubits. We show that this model is equivalent to a quantum computer operating on n qubits. Furthermore, we show that even a primitive computer that is capable of implementing only SWAP gates, can be lifted to universal quantum computing, if aided with an appropriate quantum control of logarithmic size. Our results thus exemplify the information processing power brought forth by the quantum control system.

scholarly journals Optically Driven Quantum Computing Devices Based on Semiconductor Quantum Dots

2007 ◽  
pp. 147-161
Author(s):  
Xiaoqin Li ◽  
Duncan Steel ◽  
Daniel Gammon ◽  
L. J. Sham
Keyword(s):  
Quantum Dots ◽  
Quantum Computing ◽  
Semiconductor Quantum Dots

Quantum dot–polymer conjugates for stable luminescent displays

Nanoscale ◽  
2018 ◽  
Vol 10 (28) ◽  
pp. 13368-13374 ◽  
Author(s):  
Sushant Ghimire ◽  
Anjaly Sivadas ◽  
Ken-ichi Yuyama ◽  
Yuta Takano ◽  
Raju Francis ◽  
...  
Keyword(s):  
Quantum Dots ◽  
Solar Cells ◽  
Quantum Dot ◽  
Semiconductor Quantum Dots ◽  
Broad Absorption ◽  
Polymer Conjugates ◽  
Absorption Of Light

The broad absorption of light in the UV-Vis-NIR region and the size-based tunable photoluminescence color of semiconductor quantum dots make these tiny crystals one of the most attractive antennae in solar cells and phosphors in electrooptical devices.

scholarly journals On the design of molecular excitonic circuits for quantum computing: the universal quantum gates

2020 ◽  
Vol 22 (5) ◽  
pp. 3048-3057 ◽  
Author(s):  
Maria A. Castellanos ◽  
Amro Dodin ◽  
Adam P. Willard
Keyword(s):  
Quantum Computing ◽  
Organic Dye ◽  
Quantum Gates ◽  
Dye Molecules ◽  
Universal Quantum ◽  
Excitonic States

This manuscript presents a strategy for controlling the transformation of excitonic states through the design of circuits made up of coupled organic dye molecules.

scholarly journals Quantum Computing, Seifert Surfaces, and Singular Fibers

2019 ◽  
Vol 1 (1) ◽  
pp. 12-22 ◽  
Author(s):  
Michel Planat ◽  
Raymond Aschheim ◽  
Marcelo M. Amaral ◽  
Klee Irwin
Keyword(s):  
Quantum Computing ◽  
Quantum Computer ◽  
Complete Information ◽  
Singular Fiber ◽  
Dynkin Diagrams ◽  
Singular Fibers ◽  
Seifert Surfaces ◽  
Trefoil Knot ◽  
Universal Quantum

The fundamental group π 1 ( L ) of a knot or link L may be used to generate magic states appropriate for performing universal quantum computation and simultaneously for retrieving complete information about the processed quantum states. In this paper, one defines braids whose closure is the L of such a quantum computer model and computes their braid-induced Seifert surfaces and the corresponding Alexander polynomial. In particular, some d-fold coverings of the trefoil knot, with d = 3 , 4, 6, or 12, define appropriate links L, and the latter two cases connect to the Dynkin diagrams of E 6 and D 4 , respectively. In this new context, one finds that this correspondence continues with Kodaira’s classification of elliptic singular fibers. The Seifert fibered toroidal manifold Σ ′ , at the boundary of the singular fiber E 8 ˜ , allows possible models of quantum computing.

scholarly journals Benchmarking an 11-qubit quantum computer

2019 ◽  
Vol 10 (1) ◽  
Author(s):  
K. Wright ◽  
K. M. Beck ◽  
S. Debnath ◽  
J. M. Amini ◽  
Y. Nam ◽  
...  
Keyword(s):  
Quantum Computing ◽  
Quantum Physics ◽  
Quantum Computer ◽  
Success Rates ◽  
Single Qubit ◽  
The Past ◽  
Large Numbers ◽  
Universal Quantum ◽  
Qubit Gate ◽  
Fully Connected

AbstractThe field of quantum computing has grown from concept to demonstration devices over the past 20 years. Universal quantum computing offers efficiency in approaching problems of scientific and commercial interest, such as factoring large numbers, searching databases, simulating intractable models from quantum physics, and optimizing complex cost functions. Here, we present an 11-qubit fully-connected, programmable quantum computer in a trapped ion system composed of 13 171Yb+ ions. We demonstrate average single-qubit gate fidelities of 99.5$$\%$$%, average two-qubit-gate fidelities of 97.5$$\%$$%, and SPAM errors of 0.7$$\%$$%. To illustrate the capabilities of this universal platform and provide a basis for comparison with similarly-sized devices, we compile the Bernstein-Vazirani and Hidden Shift algorithms into our native gates and execute them on the hardware with average success rates of 78$$\%$$% and 35$$\%$$%, respectively. These algorithms serve as excellent benchmarks for any type of quantum hardware, and show that our system outperforms all other currently available hardware.

Sign in / Sign up

Export Citation Format

Share Document