Quantum Signal Processing with the one-dimensional quantum Ising model

• URL: http://arxiv.org/abs/2309.04538v1
• Date: Fri, 8 Sep 2023 18:01:37 GMT
• Title: Quantum Signal Processing with the one-dimensional quantum Ising model
• Authors: V. M. Bastidas, S. Zeytino\u{g}lu, Z. M. Rossi, I. L. Chuang, and W. J. Munro
• Abstract summary: Quantum Signal Processing (QSP) has emerged as a promising framework to manipulate and determine properties of quantum systems. We provide examples and applications of our approach in diverse fields ranging from space-time dual quantum circuits and quantum simulation, to quantum control.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum Signal Processing (QSP) has emerged as a promising framework to manipulate and determine properties of quantum systems. QSP not only unifies most existing quantum algorithms but also provides tools to discover new ones. Quantum signal processing is applicable to single- or multi-qubit systems that can be qubitized so one can exploit the SU$(2)$ structure of system evolution within special invariant two-dimensional subspaces. In the context of quantum algorithms, this SU$(2)$ structure is artificially imposed on the system through highly nonlocal evolution operators that are difficult to implement on near-term quantum devices. In this work, we propose QSP protocols for the infinite-dimensional Onsager Lie Algebra, which is relevant to the physical dynamics of quantum devices that can simulate the transverse field Ising model. To this end, we consider QSP sequences in the Heisenberg picture, allowing us to exploit the emergent SU$(2)$ structure in momentum space and synthesize QSP sequences for the Onsager algebra. Our results demonstrate a concrete connection between QSP techniques and Noisy Intermediate Scale quantum protocols. We provide examples and applications of our approach in diverse fields ranging from space-time dual quantum circuits and quantum simulation, to quantum control.

Related papers

• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Quantum Equilibrium Propagation for efficient training of quantum systems based on Onsager reciprocity [0.0]
  Equilibrium propagation (EP) is a procedure that has been introduced and applied to classical energy-based models which relax to an equilibrium. Here, we show a direct connection between EP and Onsager reciprocity and exploit this to derive a quantum version of EP. This can be used to optimize loss functions that depend on the expectation values of observables of an arbitrary quantum system.
  arXiv  Detail & Related papers  (2024-06-10T17:22:09Z)
• Quantum computation of conical intersections on a programmable superconducting quantum processor [10.064448021157139]
  Conical intersections (CIs) are pivotal in many photochemical processes. We present the first successful realization of a hybrid quantum-classical state-average complete active space self-consistent method.
  arXiv  Detail & Related papers  (2024-02-20T04:12:40Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• A vertical gate-defined double quantum dot in a strained germanium double quantum well [48.7576911714538]
  Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation. We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well. We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
  arXiv  Detail & Related papers  (2023-05-23T13:42:36Z)
• Assisted quantum simulation of open quantum systems [0.0]
  We introduce the quantum-assisted quantum algorithm, which reduces the circuit depth of UQA via NISQ technology. We present two quantum-assisted quantum algorithms for simulating open quantum systems.
  arXiv  Detail & Related papers  (2023-02-26T11:41:02Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Variational quantum compiling with double Q-learning [0.37798600249187286]
  We propose a variational quantum compiling (VQC) algorithm based on reinforcement learning (RL) An agent is trained to sequentially select quantum gates from the native gate alphabet and the qubits they act on by double Q-learning. It can reduce the errors of quantum algorithms due to decoherence process and gate noise in NISQ devices.
  arXiv  Detail & Related papers  (2021-03-22T06:46:35Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Quantum circuits for the realization of equivalent forms of one-dimensional discrete-time quantum walks on near-term quantum hardware [1.400804591672331]
  Quantum walks are a promising framework for developing quantum algorithms and quantum simulations. We present different forms of discrete-time quantum walks (DTQWs) and show their equivalence for physical realizations.
  arXiv  Detail & Related papers  (2020-01-30T07:29:29Z)

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.