Classically Replaceable Operations

• URL: http://arxiv.org/abs/2203.14244v2
• Date: Fri, 21 Oct 2022 09:30:43 GMT
• Title: Classically Replaceable Operations
• Authors: Guoding Liu, Xingjian Zhang, Xiongfeng Ma
• Abstract summary: Quantum information science provides powerful technologies beyond the scope of classical physics. In practice, accurate control of quantum operations is a challenging task with current quantum devices. An approach to alleviating this problem is to replace quantum operations with classical processing.
• Score: 1.3535770763481902
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum information science provides powerful technologies beyond the scope of classical physics. In practice, accurate control of quantum operations is a challenging task with current quantum devices. The implementation of high fidelity and multi-qubit quantum operations consumes massive resources and requires complicated hardware design to fight against noise. An approach to alleviating this problem is to replace quantum operations with classical processing. Despite the common practice of this approach, rigorous criteria to determine whether a given quantum operation is replaceable classically are still missing. In this work, we define the classically replaceable operations in four general scenarios. In each scenario, we provide their necessary and sufficient criteria and point out the corresponding classical processing. For a practically favorable case of unitary classically replaceable operations, we show that the replaced classical processing is deterministic. Beyond that, we regard the irreplaceability of quantum operations by classical processing as a quantum resource and relate it to the performance of a channel in a non-local game, as manifested in a robustness measure.

Related papers

• Quantum-Classical Separation in Bounded-Resource Tasks Arising from Measurement Contextuality [107.84586711462556]
  We show that quantum contextuality enables certain tasks to be performed with success probabilities beyond classical limits.<n>Our work proposes novel ways to benchmark quantum processors using contextuality-based algorithms.
  arXiv  Detail & Related papers  (2025-12-01T23:54:32Z)
• Operationally classical simulation of quantum states [41.94295877935867]
  A classical state-preparation device cannot generate superpositions and hence its emitted states must commute. We show that no such simulation exists, thereby certifying quantum coherence. Our approach is a possible avenue to understand how and to what extent quantum states defy generic models based on classical devices.
  arXiv  Detail & Related papers  (2025-02-03T15:25:03Z)
• Quantum resources of quantum and classical variational methods [0.48212500317840945]
  We show how the concept of non-stabilizerness, or magic, can create a bridge between quantum information and variational techniques. We show that energy accuracy is a necessary but not always sufficient condition for accuracy in non-stabilizerness. Our findings form a basis for a universal expressivity characterization of both quantum and classical variational methods.
  arXiv  Detail & Related papers  (2024-09-19T18:00:00Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Hunting for quantum-classical crossover in condensed matter problems [0.3799859284309834]
  We propose a systematic error/runtime analysis on state-of-the-art classical algorithm based on tensor networks. We argue that condensed matter problems offer the earliest platform for demonstration of practical quantum advantage.
  arXiv  Detail & Related papers  (2022-10-25T15:50:54Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Quantum-Classical Hybrid Information Processing via a Single Quantum System [1.1602089225841632]
  Current technologies in quantum-based communications bring a new integration of quantum data with classical data for hybrid processing. We propose a quantum reservoir processor to harness quantum dynamics in computational tasks requiring both classical and quantum inputs.
  arXiv  Detail & Related papers  (2022-09-01T14:33:40Z)
• Classical surrogates for quantum learning models [0.7734726150561088]
  We introduce the concept of a classical surrogate, a classical model which can be efficiently obtained from a trained quantum learning model. We show that large classes of well-analyzed re-uploading models have a classical surrogate.
  arXiv  Detail & Related papers  (2022-06-23T14:37:02Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Quantum Deformed Neural Networks [83.71196337378022]
  We develop a new quantum neural network layer designed to run efficiently on a quantum computer. It can be simulated on a classical computer when restricted in the way it entangles input states.
  arXiv  Detail & Related papers  (2020-10-21T09:46:12Z)
• The Favored Classical Variables to Promote to Quantum Operators [0.0]
  This article addresses the task of how such favored variables are found that can be used to properly solve a given quantum system. Examples, such as non-renormalizable scalar fields and gravity, have profited by initially changing which classical variables to promote to quantum operators.
  arXiv  Detail & Related papers  (2020-06-23T19:25:53Z)
• From a quantum theory to a classical one [117.44028458220427]
  We present and discuss a formal approach for describing the quantum to classical crossover. The method was originally introduced by L. Yaffe in 1982 for tackling large-$N$ quantum field theories.
  arXiv  Detail & Related papers  (2020-04-01T09:16:38Z)

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.