Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSimulating the dynamics of braiding of Majorana zero modes using an IBM quantum computer
70
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We simulate the dynamics of braiding Majorana zero modes on an IBM Quantum computer. We find the native quantum gates introduce too much noise to observe braiding. Instead, we use Qiskit Pulse to develop scaled two-qubit quantum gates that better match the unitary time evolution operator and enable us to observe braiding. This work demonstrates that quantum computers can be used for simulation, and highlights the use of pulse-level control for programming quantum computers and constitutes the first experimental evidence of braiding via dynamical Hamiltonian evolution.
rate research
Read More
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.
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.
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.
It has been widely believed that half quantum vortices are indispensable to realize topological stable Majorana zero modes and non-Abelian anyons in spinful superconductors/superfluids. Contrary to this wisdom, we here demonstrate that integer quantum vortices in spinful superconductors can host topologically stable Majorana zero modes because of the mirror symmetry. The symmetry protected Majorana fermions may exhibit non-Abelian anyon braiding.
The Sachdev-Ye-Kitaev (SYK) model is an all-to-all interacting Majorana fermion model for many-body quantum chaos and the holographic correspondence. Here we construct fermionic all-to-all Floquet quantum circuits of random four-body gates designed to capture key features of SYK dynamics. Our circuits can be built using local ingredients in Majorana devices, namely charging-mediated interactions and braiding Majorana zero modes. This offers an analog-digital route to SYK quantum simulations that reconciles all-to-all interactions with the topological protection of Majorana zero modes, a key feature missing in existing proposals for analog SYK simulation. We also describe how dynamical, including out-of-time-ordered, correlation functions can be measured in such analog-digital implementations by employing foreseen capabilities in Majorana devices.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
