اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBenchmarking Quantum State Transfer on Quantum Devices using Spatio-Temporal Steering
132
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Quantum state transfer (QST) provides a method to send arbitrary quantum states from one system to another. Such a concept is crucial for transmitting quantum information into the quantum memory, quantum processor, and quantum network. The standard benchmark of QST is the average fidelity between the prepared and received states. In this work, we provide a new benchmark which reveals the non-classicality of QST based on spatio-temporal steering (STS). More specifically, we show that the local-hidden-state (LHS) model in STS can be viewed as the classical strategy of state transfer. Therefore, we can quantify the non-classicality of QST process by measuring the spatio-temporal steerability. We then apply the spatio-temporal steerability measurement technique to benchmark quantum devices including the IBM quantum experience and QuTech quantum inspire under QST tasks. The experimental results show that the spatio-temporal steerability decreases as the circuit depth increases, and the reduction agrees with the noise model, which refers to the accumulation of errors during the QST process. Moreover, we provide a quantity to estimate the signaling effect which could result from gate errors or intrinsic non-Markovian effect of the devices.
قيم البحث
اقرأ أيضاً
We show that optomechanical systems in the quantum regime can be used to demonstrate EPR-type quantum entanglement between the optical field and the mechanical oscillator, via quantum-state steering. Namely, the conditional quantum state of the mecha
nical oscillator can be steered into different quantum states depending the choice made on which quadrature of the out-going field is to be measured via homodyne detection. More specifically, if quantum radiation pressure force dominates over thermal force, the oscillators quantum state is steerable with a photodetection efficiency as low as 50%, approaching the ideal limit shown by Wiseman and Gambetta [Phys. Rev. Lett. {bf 108}, 220402 (2012)]. We also show that requirement for steerability is the same as those for achieving sub-Heisenberg state tomography using the same experimental setup.
Temporal steering is a form of temporal correlation between the initial and final state of a quantum system. It is a temporal analogue of the famous Einstein-Podolsky-Rosen (spatial) steering. We demonstrate, by measuring the photon polarization, tha
t temporal steering allows two parties to verify if they have been interacting with the same particle, even if they have no information about what happened with the particle in between the measurements. This is the first experimental study of temporal steering. We also performed experimental tests, based on the violation of temporal steering inequalities, of the security of two quantum key distribution protocols against individual attacks. Thus, these results can lead to applications for secure quantum communications and quantum engineering.
Now that ever more sophisticated devices for quantum computing are being developed, we require ever more sophisticated benchmarks. This includes a need to determine how well these devices support the techniques required for quantum error correction.
In this paper we introduce the texttt{topological_codes} module of Qiskit-Ignis, which is designed to provide the tools necessary to perform such tests. Specifically, we use the texttt{RepetitionCode} and texttt{GraphDecoder} classes to run tests based on the repetition code and process the results. As an example, data from a 43 qubit code running on IBMs emph{Rochester} device is presented.
Universal fault-tolerant quantum computers will require error-free execution of long sequences of quantum gate operations, which is expected to involve millions of physical qubits. Before the full power of such machines will be available, near-term q
uantum devices will provide several hundred qubits and limited error correction. Still, there is a realistic prospect to run useful algorithms within the limited circuit depth of such devices. Particularly promising are optimization algorithms that follow a hybrid approach: the aim is to steer a highly entangled state on a quantum system to a target state that minimizes a cost function via variation of some gate parameters. This variational approach can be used both for classical optimization problems as well as for problems in quantum chemistry. The challenge is to converge to the target state given the limited coherence time and connectivity of the qubits. In this context, the quantum volume as a metric to compare the power of near-term quantum devices is discussed. With focus on chemistry applications, a general description of variational algorithms is provided and the mapping from fermions to qubits is explained. Coupled-cluster and heuristic trial wave-functions are considered for efficiently finding molecular ground states. Furthermore, simple error-mitigation schemes are introduced that could improve the accuracy of determining ground-state energies. Advancing these techniques may lead to near-term demonstrations of useful quantum computation with systems containing several hundred qubits.
Quantum computers are on the verge of becoming a commercially available reality. They represent a paradigm shift in computing, with a steep learning gradient. The creation of games is a way to ease the transition for beginners. We present a game simi
lar to the Poker variant Texas hold em with the intention to serve as an engaging pedagogical tool to learn the basics rules of quantum computing. The concepts of quantum states, quantum operations and measurement can be learned in a playful manner. The difference to the classical variant is that the community cards are replaced by a quantum register that is randomly initialized, and the cards for each player are replaced by quantum gates, randomly drawn from a set of available gates. Each player can create a quantum circuit with their cards, with the aim to maximize the number of $1$s that are measured in the computational basis. The basic concepts of superposition, entanglement and quantum gates are employed. We provide a proof-of-concept implementation using Qiskit. A comparison of the results for the created circuits using a simulator and IBM machines is conducted, showing that error rates on contemporary quantum computers are still very high. For the success of noisy intermediate scale quantum (NISQ) computers, improvements on the error rates and error mitigation techniques are necessary, even for simple circuits. We show that quantum error mitigation (QEM) techniques can be used to improve expectation values of observables on real quantum devices.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
