Suppressing decoherence in quantum state transfer with unitary operations

• URL: http://arxiv.org/abs/2208.04926v3
• Date: Wed, 11 Jan 2023 08:34:23 GMT
• Title: Suppressing decoherence in quantum state transfer with unitary operations
• Authors: Maxim A. Gavreev, Evgeniy O. Kiktenko, Alena S. Mastiukova, Aleksey K. Fedorov
• Abstract summary: We study an application of quantum state-dependent pre- and post-processing unitary operations for protecting the given (multi-qubit) quantum state. We observe the increase in the fidelity of the output quantum state both in a quantum emulation experiment and in a real experiment with a cloud-accessible quantum processor.
• Score: 1.9662978733004601
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Decoherence is the fundamental obstacle limiting the performance of quantum information processing devices. The problem of transmitting a quantum state (known or unknown) from one place to another is of great interest in this context. In this work, by following the recent theoretical proposal [Opt. Eng. {\bf 59}, 061625 (2020)] we study an application of quantum state-dependent pre- and post-processing unitary operations for protecting the given (multi-qubit) quantum state against the effect of decoherence acting on all qubits. We observe the increase in the fidelity of the output quantum state both in a quantum emulation experiment, where all protecting unitaries are perfect, and in a real experiment with a cloud-accessible quantum processor, where protecting unitaries themselves are affected by the noise. We expect the considered approach can be useful for analyzing capabilities of quantum information processing devices in transmitting known quantum states. We also demonstrate an applicability of the developed approach for suppressing decoherence in the process of distributing a two-qubit state over remote physical qubits of a quantum processor.

Related papers

• On-Chip Verified Quantum Computation with an Ion-Trap Quantum Processing Unit [0.5497663232622965]
  We present and experimentally demonstrate a novel approach to verification and benchmarking of quantum computing. Unlike previous information-theoretically secure verification protocols, our approach is implemented entirely on-chip. Our results pave the way for more accessible and efficient verification and benchmarking strategies in near-term quantum devices.
  arXiv  Detail & Related papers  (2024-10-31T16:54:41Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• 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)
• Enhanced quantum state transfer: Circumventing quantum chaotic behavior [35.74056021340496]
  We show how to transfer few-particle quantum states in a two-dimensional quantum network. Our approach paves the way to short-distance quantum communication for connecting distributed quantum processors or registers.
  arXiv  Detail & Related papers  (2024-02-01T19:00:03Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Entanglement cost of realizing quantum processes [5.086696108576776]
  We develop an efficiently computable tool that reliably estimates the amount of entanglement needed for realizing arbitrary quantum processes. Our tool applies to the entanglement required to prepare a broad range of quantum states in the regime, surpassing previous methods' limitations.
  arXiv  Detail & Related papers  (2023-11-17T17:07:26Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Perturbative quantum simulation [2.309018557701645]
  We introduce perturbative quantum simulation, which combines the complementary strengths of the two approaches. The use of a quantum processor eliminates the need to identify a solvable unperturbed Hamiltonian. We numerically benchmark the method for interacting bosons, fermions, and quantum spins in different topologies.
  arXiv  Detail & Related papers  (2021-06-10T17:38:25Z)
• Demonstration of quantum advantage by a joint detection receiver for optical communications using quantum belief propagation on a trapped-ion device [0.7758302353877525]
  We present an experimental realization of a quantum joint detection receiver for binary phase shift keying codewords of a 3-bit linear tree code. The receiver, translated to a quantum circuit, was experimentally implemented on a trapped-ion device. We provide an experimental framework that surpasses the quantum limit on the minimum average decoding error probability.
  arXiv  Detail & Related papers  (2021-02-25T18:05:31Z)
• 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)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)

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.