The work discusses validation of properties of quantum circuits with many qubits using non-universal set of quantum gates ensuring possibility of effective simulation on classical computer. An understanding analogy between different models of quantum chains is suggested for clarification. An example with IBM Q Experience cloud platform and Qiskit framework is discussed finally.
The work discusses validation of properties of quantum circuits with many qubits using non-universal set of quantum gates ensuring possibility of effective simulation on classical computer. An understanding analogy between different models of quantum chains is suggested for clarification. An example with IBM Q Experience cloud platform and Qiskit framework is discussed finally.
The notion of compressed quantum computation is employed to simulate the Ising interaction of a one-dimensional chain consisting of n qubits using the universal IBM cloud quantum computer running on log2(n) qubits. The external field parameter that controls the quantum phase transition of this model translates into particular settings of the quantum gates that generate the circuit. We measure the magnetization, which displays the quantum phase transition, on a two-qubit system, which simulates a four-qubit Ising chain, and show its agreement with the theoretical prediction within a certain error. We also discuss the relevant point of how to assess errors when using a cloud quantum computer with a limited amount of runs. As a solution, we propose to use validating circuits, that is, to run independent controlled quantum circuits of similar complexity to the circuit of interest.
Abstract This practical guide explores the use of IBM Quantum cloud simulators for modeling and analyzing quantum circuits under realistic conditions. Using the IBM Q platform and Qiskit Runtime, the work demonstrates how to configure the ibmq_qasm_simulator and map a basic noise model derived from a physical IBM Quantum™ device. The guide focuses on: Setting up the ibmq_qasm_simulator in Qiskit. Extracting and applying a hardware-based noise model from a real IBM Quantum backend. Performing noisy simulations of QuantumCircuits. Using Sampler and Estimator primitives in Qiskit Runtime to analyze circuit outputs. Studying the impact of realistic quantum errors such as decoherence, gate infidelity, and readout noise. By incorporating noise models into simulations, researchers and developers can better understand how quantum circuits behave on real hardware, optimize algorithms before deployment, and design more robust quantum programs. This approach bridges the gap between idealized simulations and physical quantum devices, making it a critical step toward practical quantum application development.
Quantum Computing (QC) has evolved from a few custom quantum computers, which were only accessible to their creators, to an array of commercial quantum computers that can be accessed on the cloud by anyone. Accessing these cloud quantum computers requires a complex chain of tools that facilitate connecting, programming, simulating algorithms, estimating resources, submitting quantum computing jobs, retrieving results, and more. Some steps in the chain are hardware dependent and subject to change as both hardware and software tools, such as available gate sets and optimizing compilers, evolve. Understanding the trade-offs inherent in this process is essential for evaluating the power and utility of quantum computers. ARLIS has been systematically investigating these environments to understand these complexities. The work presented here is a detailed summary of three months of using such quantum programming environments. We show metadata obtained from these environments, including the connection metrics to the different services, the execution of algorithms, the testing of the effects of varying the number of qubits, comparisons to simulations, execution times, and cost. Our objective is to provide concrete data and insights for those who are exploring the potential of quantum computing. It is not our objective to present any new algorithms or optimize performance on any particular machine or cloud platform; rather, this work is focused on providing a consistent view of a single algorithm executed using out-of-the-box settings and tools across machines, cloud platforms, and time. We present insights only available from these carefully curated data.
This thesis presents several quantum circuit implementations of discrete and continuous quantum walks in cycle graphs. Quantum walks have become an important tool for developing quantum algorithms, that is why this work is a contribution to the area of quantum computation, specially for scientist who want to test their developed algorithms, in a real quantum device as the IBM-Q Experience platform. We give a complete suite of quantum gates that are needed to simulate quantum walks and quantum walk-based algorithms. Since some of these quantum gates are not elementary, we show how to decompose them into fundamental quantum gates available at Qiskit, an open-source quantum computing software development framework created by IBM. This is an important contribution towards the development of a professional platform for simulating and testing quantum algorithms. We found that the decomposition of unitary gates, related to quantum walks, into elementary gates is not very well documented in the literature. We studied the efficiency of both, the number of qubits and logic gates needed for each circuit, and the correctness of the results of each experiment by comparing the theoretical expected output state with the output generated by quantum simulators. Implementations of both discrete and continuous quantum walks in quantum circuits rely heavily on controlled gates, that when decomposed into fundamental gates add a high number of quantum gates and depth. Experiments were performed on a real quantum device, but results showed that the quantum computer is not good enough when executing these quantum circuits, due to the depth of the circuits and the high amount of CNOT gates required. We tested different implementations and optimization methods for the simplification of the quantum circuits, were we find that resources grow linearly w.r.t the number of qubits, and the minimum amount of gates required for the discrete case in C8 was 144 quantum gates with a depth of 111, which is the reason of the error between the simulations and the implementations in the quantum device.
This manuscript provides a comprehensive exploration of quantum computing and communication’s foundational elements, employing Qiskit—an open-source quantum computing framework. It delves into the simulation of fundamental quantum blocks and the intricacies of two-qubit entanglement, presenting findings through graphical analyses. The discussion extends to quantum logic gates, including X, Y, Z and CNOT. This study not only examines the construction and application of quantum circuits. The simulation with Qiskit programming presents the basic quantum circuits and its outcomes after measurement.