arXiv subjects

Jalil Khatibi Moqadam

Publications and source records attributed to Jalil Khatibi Moqadam.

9 recordsLinked to original sources

arXiv2024

Technology and Performance Benchmarks of IQM's 20-Qubit Quantum Computer

Quantum computing has tremendous potential to overcome some of the fundamental limitations present in classical information processing. Yet, today's technological limitations in the quality and scaling prevent exploiting its full potential. Quantum computing based on superconducting quantum processing units (QPUs) is among the most promising approaches towards practical quantum advantage. In this article the basic technological approach of IQM Quantum Computers is described covering both the QPU and the rest of the full-stack quantum computer. In particular, the focus is on a 20-qubit quantum computer featuring the Garnet QPU and its architecture, which we will scale up to 150 qubits. We also present QPU and system-level benchmarks, including a median 2-qubit gate fidelity of 99.5% and genuinely entangling all 20 qubits in a Greenberger-Horne-Zeilinger (GHZ) state.

quant-ph↗

arXiv2022

Implementation of Continuous-Time Quantum Walks on Quantum Computers

Quantum walk is a useful model to simulate complex quantum systems and to build quantum algorithms; in particular, to develop spatial search algorithms on graphs, which aim to find a marked vertex as quickly as possible. Quantum walks are interesting candidates to be implemented on quantum computers. In this work, we describe efficient circuits that implement the evolution operator of continuous-time quantum-walk-based search algorithms on three graph classes: complete graphs, complete bipartite graphs, and hypercubes. For the class of complete and complete bipartite graphs, the circuits implement the evolution operator exactly. For the class of hypercubes, the circuit implements an approximate evolution operator, which tends to the exact evolution operator when the number of vertices is large. Our Qiskit simulations show that the implementation is successful at finding the marked vertex even for low-dimensional hypercubes.

quant-ph↗

arXiv2020

Experimental Implementation of Quantum Walks on IBM Quantum Computers

The development of universal quantum computers has achieved remarkable success in recent years, culminating with the quantum supremacy reported by Google. Now is possible to implement short-depth quantum circuits with dozens of qubits and to obtain results with significant fidelity. Quantum walks are good candidates to be implemented on the available quantum computers. In this work, we implement discrete-time quantum walks with one and two interacting walkers on cycles, two-dimensional lattices, and complete graphs on IBM quantum computers. We are able to obtain meaningful results using the cycle, the two-dimensional lattice, and the complete graph with 16 nodes each, which require 4-qubit quantum circuits up to depth 100.

quant-ph↗

arXiv2018

Boundary-induced coherence in the staggered quantum walk on different topologies

The staggered quantum walk is a type of discrete-time quantum walk model without a coin which can be generated on a graph using particular partitions of the graph nodes. We design Hamiltonians for potential realization of the staggered dynamics on a two-dimensional lattice composed of superconducting microwave resonators connected with tunable couplings. The naive generalization of the one-dimensional staggered dynamics generates two uncoupled one-dimensional quantum walks thus more complex partitions need to be employed. However, by analyzing the coherence of the dynamics, we show that the quantumness of the evolution corresponding to two independent one-dimensional quantum walks can be elevated to the level of a single two-dimensional quantum walk, only by modifying the boundary conditions. In fact, by changing the lattice boundary conditions (or topology), we explore the walk on different surfaces such as torus, Klein bottle, real projective plane and sphere. The coherence and the entropy reach different levels depending on the topology of the surface. We observe that the entropy captures similar information as coherence, thus we use it to explore the effects of boundaries on the dynamics of the continuous-time quantum walk and the classical random walk.

quant-ph↗

arXiv2017

Staggered Quantum Walks with Hamiltonians

Quantum walks are recognizably useful for the development of new quantum algorithms, as well as for the investigation of several physical phenomena in quantum systems. Actual implementations of quantum walks face technological difficulties similar to the ones for quantum computers, though. Therefore, there is a strong motivation to develop new quantum-walk models which might be easier to implement. In this work, we present an extension of the staggered quantum walk model that is fitted for physical implementations in terms of time-independent Hamiltonians. We demonstrate that this class of quantum walk includes the entire class of staggered quantum walk model, Szegedy's model, and an important subset of the coined model.

quant-ph↗

arXiv2016

Staggered quantum walks with superconducting microwave resonators

The staggered quantum walk model on a graph is defined by an evolution operator that is the product of local operators related to two or more independent graph tessellations. A graph tessellation is a partition of the set of nodes that respects the neighborhood relation. Flip-flop coined quantum walks with the Hadamard or Grover coins can be expressed as staggered quantum walks by converting the coin degree of freedom into extra nodes in the graph. We propose an implementation of the staggered model with superconducting microwave resonators, where the required local operations are provided by the nearest neighbor interaction of the resonators coupled through superconducting quantum interference devices. The tunability of the interactions makes this system an excellent toolbox for this class of quantum walks. We focus on the one-dimensional case and discuss its generalization to a more general class known as triangle-free graphs.

quant-ph↗

arXiv2015

Simulating the discrete-time quantum walk dynamics with simultaneous coin and shift operators

We implement the discrete-time quantum walk model using the continuous-time evolution of the Hamiltonian that includes both the shift and the coin generators. Based on the Trotter-Suzuki first-order approximation, we consider an optimization problem in which the Hellinger distance between the walker probability distributions resulted from the evolution of such Hamiltonian and the quantum walk dynamics is minimized. The phase space implementation of the quantum walk is considered where the walker state is encoded on the coherent state of a resonator and the coin on the two-level state of a qubit. In this approach, no mechanism for switching between the coin and the shift operators is included. We show the Hellinger distance is bounded for large number of time steps. The distance is small when we deviate from the standard quantum walk model, namely, when the walker is allowed to move in between the sites. In simulating the standard quantum walk model, the distance is large but bounded by $26\%$ for a relevant number of time steps. Even so, the system evolution shows the essential characteristics of the standard quantum walk dynamics, namely, the ballistic evolution of the probability distribution and the linear growth of the corresponding standard deviation. Moreover, the entanglement generated in this approach is approximately the same as the entanglement generated in the standard quantum walk dynamics. Finally, the system dynamics under the influence of the decoherence also shows the similar quantum-to-classical transition as in the standard quantum walk dynamics.

quant-ph↗

arXiv2015

Quantum walks on a circle with optomechanical systems

We propose an implementation of a quantum walk on a circle on an optomechanical system by encoding the walker on the phase space of a radiation field and the coin on a two-level state of a mechanical resonator. The dynamics of the system is obtained by applying Suzuki-Trotter decomposition. We numerically show that the system displays typical behaviors of quantum walks, namely, the probability distribution evolves ballistically and the standard deviation of the phase distribution is linearly proportional to the number of steps. We also analyze the effects of decoherence by using the phase damping channel on the coin space, showing the possibility to implement the quantum walk with present day technology.

quant-ph↗

arXiv2014

Multifractality in the fidelity of the Toffoli gate

We analyze the multifractality of the fidelity in an engineered Toffoli gate. Using quantum control methods, we define several optimization problems whose global solutions realize the gate in a chain of three qubits with XY Heisenberg interaction. We perturb the system by introducing imperfections in the form of $1/f$ noise to the interqubit couplings. Multifractal analysis shows that the degree of multifractality in the gate fidelity increases when optimized control pulses used to render the fidelity are less sensitive to variations in the interqubits coupling strengths.

quant-ph↗