Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuantum Robots Can Fly; Play Games: An IBM Quantum Experience
140
0
0.0
(
0
)
Added by
Prasanta K. Panigrahi
Publication date
2019
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Quantum Robot is an excellent future application that can be achieved with the help of a quantum computer. As a practical example, quantum controlled Braitenberg vehicles proposed by Raghuvanshi et al. [Proceedings of the 37th International Symposium on Multiple-Valued Logic (2007)] is a mobile quantum system and hence acts as a quantum robot. Braitenberg vehicles are simple circuit robots which can experience natural behaviours like fear, aggression and love etc. These robots can be controlled by quantum circuits incorporating quantum principles such as entanglement and superposition. Complex behaviours can be mimicked by a quantum circuit that can be implemented in a quantum robot. Here we investigate the scheme of Raghuvanshi et al. and propose a new quantum circuit to make the quantum robot fly. We demonstrate one of its application in playing a game. The quantum robot we present here shows the behaviour of `fear and its movement is deterministic in nature. This phenomenon can be successfully modelled in a game, where it can always avoid accident. The proposed quantum circuit is designed in IBM quantum experience describing the above protocol.
rate research
Read More
Quantum network coding has been proposed to improve resource utilization to support distributed computation but has not yet been put in to practice. We investigate a particular implementation of quantum network coding using measurement-based quantum computation on IBM Q processors. We compare the performance of quantum network coding with entanglement swapping and entanglement distribution via linear cluster states. These protocols outperform quantum network coding in terms of the final Bell pair fidelities but are unsuitable for optimal resource utilization in complex networks with contention present. We demonstrate the suitability of noisy intermediate-scale quantum (NISQ) devices such as IBM Q for the study of quantum networks. We also identify the factors that limit the performance of quantum network coding on these processors and provide estimates or error rates required to boost the final Bell pair fidelities to a point where they can be used for generation of genuinely random cryptographic keys among other useful tasks. Surprisingly, the required error rates are only around a factor of 2 smaller than the current status and we expect they will be achieved in the near future.
Based on the connection between the categorical derivation of classical programs from specifications and the category-theoretic approach to quantum physics, this paper contributes to extending the laws of classical program algebra to quantum programming. This aims at building correct-by-construction quantum circuits to be deployed on quantum devices such as those available at the IBM Q Experience. Quantum circuit reversibility is ensured by minimal complements, extended recursively. Measurements are postponed to the end of such recursive computations, termed quantamorphisms, thus maximising the quantum effect. Quantamorphisms are classical catamorphisms which, extended to ensure quantum reversibility, implement quantum cycles (vulg. for-loops) and quantum folds on lists. By Kleisli correspondence, quantamorphisms can be written as monadic functional programs with quantum parameters. This enables the use of Haskell, a monadic functional programming language, to perform the experimental work. Such calculated quantum programs prepared in Haskell are pushed through Quipper to the Qiskit interface to IBM Q quantum devices. The generated quantum circuits - often quite large - exhibit the predicted behaviour. However, running them on real quantum devices incurs into a significant amount of errors. As quantum devices are constantly evolving, an increase in reliability is likely in the near future, allowing for our programs to run more accurately.
Pricing interest-rate financial derivatives is a major problem in finance, in which it is crucial to accurately reproduce the time-evolution of interest rates. Several stochastic dynamics have been proposed in the literature to model either the instantaneous interest rate or the instantaneous forward rate. A successful approach to model the latter is the celebrated Heath-Jarrow-Morton framework, in which its dynamics is entirely specified by volatility factors. On its multifactor version, this model considers several noisy components to capture at best the dynamics of several time-maturing forward rates. However, as no general analytical solution is available, there is a trade-off between the number of noisy factors considered and the computational time to perform a numerical simulation. Here, we employ the quantum principal component analysis to reduce the number of noisy factors required to accurately simulate the time evolution of several time-maturing forward rates. The principal components are experimentally estimated with the $5$-qubit IBMQX2 quantum computer for $2times 2$ and $3times 3$ cross-correlation matrices, which are based on historical data for two and three time-maturing forward rates. This manuscript is a first step towards the design of a general quantum algorithm to fully simulate on quantum computers the Heath-Jarrow-Morton model for pricing interest-rate financial derivatives. It shows indeed that practical applications of quantum computers in finance will be achievable in the near future.
Quantum communication relies on the existence of entanglement between two nodes of a network. Since, entanglement can only be produced using local quantum operations, distribution of parts of this entangled system between different nodes becomes necessary. However, due to the extremely fragile nature of entanglement and the presence of losses in the communication channel, the direct distribution of entanglement over large distances is nearly impossible. Quantum repeaters have been proposed to solve this problem. These enable one to establish long-range entanglement by dividing the link into smaller parts, creating entanglement between each part and connecting them up to form the full link. As researchers race to establish entanglement over larger and larger distances, it becomes essential to gauge the performance and robustness of the different protocols that go into designing a quantum repeater, before deploying them in real life. Present day noisy quantum computers are ideal for this task as they can emulate the noisy environment in a quantum communication channel and provide a benchmark for how the protocols will perform on real-life hardware. In this paper, we report the circuit-level implementation of the complete architecture of a Quantum Repeater. All the protocols of the repeater have been bench-marked on IBM Q, the worlds first publicly available cloud quantum computer. The results of our experiment provide a measure for the fidelity of entanglement current repeaters can establish. In addition, the repeater protocol provides a robust benchmark for the current state-of-the-art of quantum computing hardware.
We report the first experimental demonstration of quantum synchronization. This is achieved by performing a digital simulation of a single spin-$1$ limit-cycle oscillator on the quantum computers of the IBM Q System. Applying an external signal to the oscillator, we verify typical features of quantum synchronization and demonstrate an interference-based quantum synchronization blockade. Our results show that state-of-the-art noisy intermediate-scale quantum computers are powerful enough to implement realistic dissipative quantum systems. Finally, we discuss limitations of current quantum hardware and define requirements necessary to investigate more complex problems.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
