Online Convex Optimization of Programmable Quantum Computers to Simulate Time-Varying Quantum Channels

• URL: http://arxiv.org/abs/2212.05145v1
• Date: Fri, 9 Dec 2022 23:37:55 GMT
• Title: Online Convex Optimization of Programmable Quantum Computers to Simulate Time-Varying Quantum Channels
• Authors: Hari Hara Suthan Chittoor, Osvaldo Simeone, Leonardo Banchi, Stefano Pirandola
• Abstract summary: An arbitrary quantum channel cannot be exactly simulated using a finite-dimensional programmable quantum processor. We study the challenging setting in which the channel to be simulated varies adversarially with time.
• Score: 26.888629265226264
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Simulating quantum channels is a fundamental primitive in quantum computing, since quantum channels define general (trace-preserving) quantum operations. An arbitrary quantum channel cannot be exactly simulated using a finite-dimensional programmable quantum processor, making it important to develop optimal approximate simulation techniques. In this paper, we study the challenging setting in which the channel to be simulated varies adversarially with time. We propose the use of matrix exponentiated gradient descent (MEGD), an online convex optimization method, and analytically show that it achieves a sublinear regret in time. Through experiments, we validate the main results for time-varying dephasing channels using a programmable generalized teleportation processor.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Simulation of Dissipative Energy Transfer via Noisy Quantum Computer [0.40964539027092917]
  We propose a practical approach to simulate the dynamics of an open quantum system on a noisy computer. Our method leverages gate noises on the IBM-Q real device, enabling us to perform calculations using only two qubits. In the last, to deal with the increasing depth of quantum circuits when doing Trotter expansion, we introduced the transfer tensor method(TTM) to extend our short-term dynamics simulation.
  arXiv  Detail & Related papers  (2023-12-03T13:56:41Z)
• Hybrid quantum gap estimation algorithm using a filtered time series [0.0]
  We prove that classical post-processing, i.e., long-time filtering of an offline time series, exponentially improves the circuit depth needed for quantum time evolution. We apply the filtering method to the construction of a hybrid quantum-classical algorithm to estimate energy gap. Our findings set the stage for unbiased quantum simulation to offer memory advantage in the near term.
  arXiv  Detail & Related papers  (2022-12-28T18:59:59Z)
• A Reorder Trick for Decision Diagram Based Quantum Circuit Simulation [0.4358626952482686]
  We study two classes of quantum circuits on which the state-of-the-art decision diagram based simulators failed to perform well in terms of simulation time. We propose a simple and powerful reorder trick to boost the simulation of such quantum circuits.
  arXiv  Detail & Related papers  (2022-11-14T04:55:25Z)
• Quantum circuit simulation of superchannels [0.0]
  We develop a quantum superchannel simulation algorithm based on the convex decomposition into sum of extreme superchannels. We demonstrate the algorithm by numerical simulation of qubit superchannels with high accuracy, making it applicable to current experimental platforms.
  arXiv  Detail & Related papers  (2022-09-22T03:16:23Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)
• Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale [57.84751206630535]
  We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework. The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators. By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
  arXiv  Detail & Related papers  (2021-04-21T13:26:42Z)
• Continuous-variable assisted thermal quantum simulation [1.6530012863603747]
  We present an experimentally feasible quantum algorithm assisted with continuous-variable simulating for quantum systems at finite temperatures. It is found that the important crossover phase diagram of the Kitaev ring can be accurately simulated by a quantum computer with only a few qubits. We propose a protocol implementable with superconducting or trapped ion quantum computers.
  arXiv  Detail & Related papers  (2020-05-31T09:04:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.