ﻻ يوجد ملخص باللغة العربية
Quantum computation promises applications that are thought to be impossible with classical computation. To realize practical quantum computation, the following three properties will be necessary: universality, scalability, and fault-tolerance. Universality is the ability to execute arbitrary multi-input quantum algorithms. Scalability means that computational resources such as logical qubits can be increased without requiring exponential increase in physical resources. Lastly, fault-tolerance is the ability to perform quantum algorithms in presence of imperfections and noise. A promising approach to scalability was demonstrated with the generation of one-million-mode 1-dimensional cluster state, a resource for one-input computation in measurement-based quantum computation (MBQC). The demonstration was based on time-domain multiplexing (TDM) approach using continuous-variable (CV) optical flying qumodes (CV analogue of qubit). Demonstrating universality, however, has been a challenging task for any physical system and approach. Here, we present, for the first time among any physical system, experimental realization of a scalable resource state for universal MBQC: a 2-dimensional cluster state. We also prove the universality and give the methodology for utilizing this state in MBQC. Our state is based on TDM approach that allows unlimited resource generation regardless of the coherence time of the system. As a demonstration of our method, we generate and verify a 2-dimensional cluster state capable of about 5,000 operation steps on 5 inputs.
We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local qubit-qubit int
The quantum computing scheme described in Phys. Rev. Lett. 98, 190504 (2007), when viewed as a cluster state computation, features a 3-D cluster state, novel adjustable strength error correction capable of correcting general errors through the correc
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal set of qua
Cluster states, a type of highly entangled state, are essential resources for quantum information processing. Here we demonstrated the generation of a time-domain linear cluster state (t-LCS) using a superconducting quantum circuit consisting of only
We introduce a simple yet versatile protocol to inverse engineer the time-dependent Hamiltonian in two- and three level systems. In the protocol, by utilizing a universal SU(2) transformation, a given speedup goal can be obtained with large freedom t