scholarly journals Simulating Finite-Time Isothermal Processes with Superconducting Quantum Circuits

Entropy ◽  
2021 ◽  
Vol 23 (3) ◽  
pp. 353
Author(s):  
Jin-Fu Chen ◽  
Ying Li ◽  
Hui Dong
Keyword(s):  
Finite Time ◽  
Quantum Computer ◽  
Heat Engine ◽  
Quantum Circuits ◽  
Thermal Bath ◽  
Whole Process ◽  
Quantum Heat Engine ◽  
Control Scheme ◽  
Universal Quantum ◽  
Isothermal Processes

Finite-time isothermal processes are ubiquitous in quantum-heat-engine cycles, yet complicated due to the coexistence of the changing Hamiltonian and the interaction with the thermal bath. Such complexity prevents classical thermodynamic measurements of a performed work. In this paper, the isothermal process is decomposed into piecewise adiabatic and isochoric processes to measure the performed work as the internal energy change in adiabatic processes. The piecewise control scheme allows the direct simulation of the whole process on a universal quantum computer, which provides a new experimental platform to study quantum thermodynamics. We implement the simulation on ibmqx2 to show the 1/τ scaling of the extra work in finite-time isothermal processes.

scholarly journals Training of quantum circuits on a hybrid quantum computer

2019 ◽  
Vol 5 (10) ◽  
pp. eaaw9918 ◽  
Author(s):  
D. Zhu ◽  
N. M. Linke ◽  
M. Benedetti ◽  
K. A. Landsman ◽  
N. H. Nguyen ◽  
...  
Keyword(s):  
Quantum Computer ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Bayesian Optimization ◽  
Optimization Strategy ◽  
Generative Modeling ◽  
Universal Quantum ◽  
Near Term ◽  
Universal Quantum Circuit ◽  
Learning Schemes

Generative modeling is a flavor of machine learning with applications ranging from computer vision to chemical design. It is expected to be one of the techniques most suited to take advantage of the additional resources provided by near-term quantum computers. Here, we implement a data-driven quantum circuit training algorithm on the canonical Bars-and-Stripes dataset using a quantum-classical hybrid machine. The training proceeds by running parameterized circuits on a trapped ion quantum computer and feeding the results to a classical optimizer. We apply two separate strategies, Particle Swarm and Bayesian optimization to this task. We show that the convergence of the quantum circuit to the target distribution depends critically on both the quantum hardware and classical optimization strategy. Our study represents the first successful training of a high-dimensional universal quantum circuit and highlights the promise and challenges associated with hybrid learning schemes.

Universal quantum circuit for n-qubit quantum gate: a programmable quantum gate

2007 ◽  
Vol 7 (3) ◽  
pp. 228-242
Author(s):  
P.B.M. Sousa ◽  
R.V. Ramos
Keyword(s):  
Quantum Computer ◽  
Quantum Circuit ◽  
Quantum Gate ◽  
Quantum Circuits ◽  
Unitary Matrices ◽  
Quantum Operations ◽  
Universal Quantum ◽  
Np Problems ◽  
Universal Quantum Circuit ◽  
Specific Quantum

Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the basic steps is to implement the quantum circuit able to realize a given unitary operation. This task has been solved using decomposition of unitary matrices in simpler ones till reach quantum circuits having only single-qubits and CNOTs gates. Usually the goal is to find the minimal quantum circuit able to solve a given problem. In this paper we go in a different direction. We propose a general quantum circuit able to implement any specific quantum circuit by just setting correctly the parameters. In other words, we propose a programmable quantum circuit. This opens the possibility to construct a real quantum computer where several different quantum operations can be realized in the same hardware. The configuration is proposed and its optical implementation is discussed.

Discrete-time quantum walk on circular graph: Simulations and effect of gate depth and errors

2021 ◽  
pp. 2150008
Author(s):  
Iyed Ben Slimen ◽  
Amor Gueddana ◽  
Vasudevan Lakshminarayanan
Keyword(s):  
Discrete Time ◽  
Quantum Computer ◽  
Quantum Walk ◽  
Quantum Walks ◽  
Quantum Circuits ◽  
Time Quantum ◽  
Universal Quantum ◽  
Circuit Decomposition ◽  
Circular Graph ◽  
The Impact

We investigate the counterparts of random walks in universal quantum computing and their implementation using standard quantum circuits. Quantum walks have been recently well investigated for traversing graphs with certain oracles. We focus our study on traversing a 1D graph, namely a circle, and show how to implement a discrete-time quantum walk in quantum circuits built with universal CNOT and single qubit gates. We review elementary quantum gates and circuit decomposition techniques and propose a generalized version of all CNOT-based circuits of the quantum walk. We simulated these circuits on five different qubits IBM-Q quantum devices. This quantum computer has nonperfect gates based on superconducting qubits, and, therefore, we analyzed the impact of the CNOT errors and CNOT-depth on the fidelity of the circuit.

scholarly journals Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization

2021 ◽  
Vol 20 (7) ◽  
Author(s):  
Ismail Ghodsollahee ◽  
Zohreh Davarzani ◽  
Mariam Zomorodi ◽  
Paweł Pławiak ◽  
Monireh Houshmand ◽  
...  
Keyword(s):  
Quantum Computation ◽  
Quantum Computer ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Connectivity Matrix ◽  
Circuit Optimization ◽  
Novel Approach ◽  
The Matrix ◽  
Minimum Number ◽  
Two Phases

AbstractAs quantum computation grows, the number of qubits involved in a given quantum computer increases. But due to the physical limitations in the number of qubits of a single quantum device, the computation should be performed in a distributed system. In this paper, a new model of quantum computation based on the matrix representation of quantum circuits is proposed. Then, using this model, we propose a novel approach for reducing the number of teleportations in a distributed quantum circuit. The proposed method consists of two phases: the pre-processing phase and the optimization phase. In the pre-processing phase, it considers the bi-partitioning of quantum circuits by Non-Dominated Sorting Genetic Algorithm (NSGA-III) to minimize the number of global gates and to distribute the quantum circuit into two balanced parts with equal number of qubits and minimum number of global gates. In the optimization phase, two heuristics named Heuristic I and Heuristic II are proposed to optimize the number of teleportations according to the partitioning obtained from the pre-processing phase. Finally, the proposed approach is evaluated on many benchmark quantum circuits. The results of these evaluations show an average of 22.16% improvement in the teleportation cost of the proposed approach compared to the existing works in the literature.

Extended state observer–based output feedback control for spacecraft pose tracking with control input saturation

2021 ◽  
pp. 095441002110177
Author(s):  
Kejie Gong ◽  
Ying Liao ◽  
Yafei Mei
Keyword(s):  
Feedback Control ◽  
Output Feedback ◽  
Finite Time ◽  
Output Feedback Control ◽  
State Observer ◽  
Extended State Observer ◽  
Control Input ◽  
Extended State ◽  
Pose Tracking ◽  
Control Scheme

This article proposed an extended state observer (ESO)–based output feedback control scheme for rigid spacecraft pose tracking without velocity feedback, which accounts for inertial uncertainties, external disturbances, and control input constraints. In this research, the 6-DOF tracking error dynamics is described by the exponential coordinates on SE(3). A novel continuous finite-time ESO is proposed to estimate the velocity information and the compound disturbance, and the estimations are utilized in the control law design. The ESO ensures a finite-time uniform ultimately bounded stability of the observation states, which is proved utilizing the homogeneity method. A non-singular finite-time terminal sliding mode controller based on super-twisting technology is proposed, which would drive spacecraft tracking the desired states. The other two observer-based controllers are also proposed for comparison. The superiorities of the proposed control scheme are demonstrated by theory analyses and numerical simulations.

scholarly journals Finite-Time Adaptive Fuzzy Control for Nonlinear Systems with Unknown Backlash-Like Hysteresis

2021 ◽  
Author(s):  
Shuzhen Diao ◽  
Wei Sun ◽  
Le Wang ◽  
Jing Wu
Keyword(s):  
Fuzzy Control ◽  
Finite Time ◽  
Fuzzy Systems ◽  
Tracking Error ◽  
Adaptive Fuzzy Control ◽  
Finite Time Stability ◽  
Adaptive Fuzzy ◽  
Intermediate Variable ◽  
Control Scheme ◽  
Theoretical Results

AbstractThis study considers the tracking control problem of the nonstrict-feedback nonlinear system with unknown backlash-like hysteresis, and a finite-time adaptive fuzzy control scheme is developed to address this problem. More precisely, the fuzzy systems are employed to approximate the unknown nonlinearities, and the design difficulties caused by the nonlower triangular structure are also overcome by using the property of fuzzy systems. Besides, the effect of unknown hysteresis input is compensated by approximating an intermediate variable. With the aid of finite-time stability theory, the proposed control algorithm could guarantee that the tracking error converges to a smaller region. Finally, a simulation example is provided to further verify the above theoretical results.

scholarly journals Simulating molecules on a cloud-based 5-qubit IBM-Q universal quantum computer

2021 ◽  
Vol 4 (1) ◽  
Author(s):  
S. Leontica ◽  
F. Tennie ◽  
T. Farrow
Keyword(s):  
Quantum System ◽  
Energy Transport ◽  
Quantum Computer ◽  
Complex Molecule ◽  
Dissipative System ◽  
Quantum Simulation ◽  
Quantum Systems ◽  
Molecular Structures ◽  
Unitary Evolution ◽  
Universal Quantum

AbstractSimulating the behaviour of complex quantum systems is impossible on classical supercomputers due to the exponential scaling of the number of quantum states with the number of particles in the simulated system. Quantum computers aim to break through this limit by using one quantum system to simulate another quantum system. Although in their infancy, they are a promising tool for applied fields seeking to simulate quantum interactions in complex atomic and molecular structures. Here, we show an efficient technique for transpiling the unitary evolution of quantum systems into the language of universal quantum computation using the IBM quantum computer and show that it is a viable tool for compiling near-term quantum simulation algorithms. We develop code that decomposes arbitrary 3-qubit gates and implement it in a quantum simulation first for a linear ordered chain to highlight the generality of the approach, and second, for a complex molecule. We choose the Fenna-Matthews-Olsen (FMO) photosynthetic protein because it has a well characterised Hamiltonian and presents a complex dissipative system coupled to a noisy environment that helps to improve the efficiency of energy transport. The method can be implemented in a broad range of molecular and other simulation settings.

Sign in / Sign up

Export Citation Format

Share Document