Do you want to publish a course? Click here

NMRCloudQ: A Quantum Cloud Experience on a Nuclear Magnetic Resonance Quantum Computer

117   0   0.0 ( 0 )
 Added by Dawei Lu
 Publication date 2017
  fields Physics
and research's language is English




Ask ChatGPT about the research

As of today, no one can tell when a universal quantum computer with thousands of logical quantum bits (qubits) will be built. At present, most quantum computer prototypes involve less than ten individually controllable qubits, and only exist in laboratories for the sake of either the great costs of devices or professional maintenance requirements. Moreover, scientists believe that quantum computers will never replace our daily, every-minute use of classical computers, but would rather serve as a substantial addition to the classical ones when tackling some particular problems. Due to the above two reasons, cloud-based quantum computing is anticipated to be the most useful and reachable form for public users to experience with the power of quantum. As initial attempts, IBM Q has launched influential cloud services on a superconducting quantum processor in 2016, but no other platforms has followed up yet. Here, we report our new cloud quantum computing service -- NMRCloudQ (http://nmrcloudq.com/zh-hans/), where nuclear magnetic resonance, one of the pioneer platforms with mature techniques in experimental quantum computing, plays as the role of implementing computing tasks. Our service provides a comprehensive software environment preconfigured with a list of quantum information processing packages, and aims to be freely accessible to either amateurs that look forward to keeping pace with this quantum era or professionals that are interested in carrying out real quantum computing experiments in person. In our current version, four qubits are already usable with in average 1.26% single-qubit gate error rate and 1.77% two-qubit controlled-NOT gate error rate via randomized benchmaking tests. Improved control precisions as well as a new seven-qubit processor are also in preparation and will be available later.



rate research

Read More

One-way quantum computing is a promising candidate for fault-tolerant quantum computing. Here, we propose new protocols to realize a deterministic one-way CNOT gate and one-way $X$-rotations on quantum-computing platforms. By applying a delayed-choice scheme, we overcome a limit of most currently available quantum computers, which are unable to implement further operations on measured qubits or operations conditioned on measurement results from other qubits. Moreover, we decrease the error rate of the one-way logic gates, compared to the original protocol using local operations and classical communication (LOCC). In addition, we apply our deterministic one-way CNOT gate in the Deutsch-Jozsa algorithm to show the feasibility of our proposal. We demonstrate all these one-way gates and algorithms by running experiments on the cloud quantum-computing platform IBM Quantum Experience.
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are significant because they are the first to have time-complexities that are comparable to the best known methods for simulating time-independent Hamiltonian evolution, given appropriate smoothness criteria on the Hamiltonian are satisfied. We provide a thorough cost analysis of these algorithms that considers discretizion errors in both the time and the representation of the Hamiltonian. In addition, we provide the first upper bounds for the error in Lie-Trotter-Suzuki approximations to unitary evolution operators, that use adaptively chosen time steps.
We describe an experimental effort designing and deploying error-robust single-qubit operations using a cloud-based quantum computer and analog-layer programming access. We design numerically-optimized pulses that implement target operations and exhibit robustness to various error processes including dephasing noise, instabilities in control amplitudes, and crosstalk. Pulse optimization is performed using a flexible optimization package incorporating a device model and physically-relevant constraints (e.g. bandwidth limits on the transmission lines of the dilution refrigerator housing IBM Quantum hardware). We present techniques for conversion and calibration of physical Hamiltonian definitions to pulse waveforms programmed via Qiskit Pulse and compare performance against hardware default DRAG pulses on a five-qubit device. Experimental measurements reveal default DRAG pulses exhibit coherent errors an order of magnitude larger than tabulated randomized-benchmarking measurements; solutions designed to be robust against these errors outperform hardware-default pulses for all qubits across multiple metrics. Experimental measurements demonstrate performance enhancements up to: $sim10times$ single-qubit gate coherent-error reduction; $sim5times$ average coherent-error reduction across a five qubit system; $sim10times$ increase in calibration window to one week of valid pulse calibration; $sim12times$ reduction gate-error variability across qubits and over time; and up to $sim9times$ reduction in single-qubit gate error (including crosstalk) in the presence of fully parallelized operations. Randomized benchmarking reveals error rates for Clifford gates constructed from optimized pulses consistent with tabulated $T_{1}$ limits, and demonstrates a narrowing of the distribution of outcomes over randomizations associated with suppression of coherent-errors.
We study two different methods to prepare excited states on a quantum computer, a key initial step to study dynamics within linear response theory. The first method uses unitary evolution for a short time $T=mathcal{O}(sqrt{1-F})$ to approximate the action of an excitation operator $hat{O}$ with fidelity $F$ and success probability $Papprox1-F$. The second method probabilistically applies the excitation operator using the Linear Combination of Unitaries (LCU) algorithm. We benchmark these techniques on emulated and real quantum devices, using a toy model for thermal neutron-proton capture. Despite its larger memory footprint, the LCU-based method is efficient even on current generation noisy devices and can be implemented at a lower gate cost than a naive analysis would suggest. These findings show that quantum techniques designed to achieve good asymptotic scaling on fault tolerant quantum devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
We demonstrate non-classical cooling on the IBMq cloud quantum computer. We implement a recently proposed refrigeration protocol which relies upon indefinite causal order for its quantum advantage. We use quantum channels which, when used in a well-defined order, are useless for refrigeration. We are able to use them for refrigeration, however, by applying them in a superposition of different orders. Our protocol is by nature relatively robust to noise, and so can be implemented on this noisy platform. As far as the authors are aware, this is the first example of cloud quantum refrigeration.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا