Probing Quantum Telecloning on Superconducting Quantum Processors

• URL: http://arxiv.org/abs/2308.15579v3
• Date: Wed, 8 May 2024 17:29:42 GMT
• Title: Probing Quantum Telecloning on Superconducting Quantum Processors
• Authors: Elijah Pelofske, Andreas Bärtschi, Stephan Eidenbenz, Bryan Garcia, Boris Kiefer,
• Abstract summary: Quantum telecloning allows approximate copies of quantum information to be constructed by separate parties. Quantum telecloning can be implemented as a circuit on quantum computers using a classical co-processor. We present one of the largest and most comprehensive NISQ computer experimental analyses on (single qubit) quantum telecloning to date.
• Score: 0.6990493129893112
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum information can not be perfectly cloned, but approximate copies of quantum information can be generated. Quantum telecloning combines approximate quantum cloning, more typically referred as quantum cloning, and quantum teleportation. Quantum telecloning allows approximate copies of quantum information to be constructed by separate parties, using the classical results of a Bell measurement made on a prepared quantum telecloning state. Quantum telecloning can be implemented as a circuit on quantum computers using a classical co-processor to compute classical feed forward instructions using if statements based on the results of a mid-circuit Bell measurement in real time. We present universal, symmetric, optimal $1 \rightarrow M$ telecloning circuits, and experimentally demonstrate these quantum telecloning circuits for $M=2$ up to $M=10$, natively executed with real time classical control systems on IBM Quantum superconducting processors, known as dynamic circuits. We perform the cloning procedure on many different message states across the Bloch sphere, on $7$ IBM Quantum processors, optionally using the error suppression technique X-X sequence digital dynamical decoupling. Two circuit optimizations are utilized, one which removes ancilla qubits for $M=2, 3$, and one which reduces the total number of gates in the circuit but still uses ancilla qubits. Parallel single qubit tomography with MLE density matrix reconstruction is used in order to compute the mixed state density matrices of the clone qubits, and clone quality is measured using quantum fidelity. These results present one of the largest and most comprehensive NISQ computer experimental analyses on (single qubit) quantum telecloning to date. The clone fidelity sharply decreases to $0.5$ for $M > 5$, but for $M=2$ we are able to achieve a mean clone fidelity of up to $0.79$ using dynamical decoupling.

Related papers

• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• On Reducing the Execution Latency of Superconducting Quantum Processors via Quantum Program Scheduling [48.142860424323395]
  We introduce the Quantum Program Scheduling Problem (QPSP) to improve the utility efficiency of quantum resources. Specifically, a quantum program scheduling method concerning the circuit width, number of measurement shots, and submission time of quantum programs is proposed to reduce the execution latency.
  arXiv  Detail & Related papers  (2024-04-11T16:12:01Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• 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)
• Single Qubit Multi-Party Transmission Using Universal Symmetric Quantum Cloning [1.0878040851638]
  We consider a hypothetical quantum network where Alice wishes to transmit one qubit of information to $M$ parties. We show that Alice can send significantly fewer qubits compared to direct transmission of the message qubits to each of the $M$ remote receivers.
  arXiv  Detail & Related papers  (2023-10-07T21:19:54Z)
• Photon-phonon quantum cloning in optomechanical system [5.317893030884531]
  cloning of flying bits for further processing from the solid-state quantum bits in storage is an operation frequently used in quantum information processing. We propose a high-fidelity and controllable quantum cloning scheme between solid bits and flying bits.
  arXiv  Detail & Related papers  (2023-02-11T10:09:53Z)
• Optimized Telecloning Circuits: Theory and Practice of Nine NISQ Clones [0.0]
  We present results of a of $1 rightarrow 9$ universal, symmetric, optimal quantum telecloning implementation on a cloud accessible quantum computer. The demonstration of creating $9$ approximate clones on a quantum processor is the largest number of clones that has been generated, telecloning or otherwise.
  arXiv  Detail & Related papers  (2022-10-18T21:12:41Z)
• Quantum Telecloning on NISQ Computers [0.0]
  Quantum telecloning is a protocol that originates from a combination of quantum teleportation and quantum cloning. NISQ devices can achieve near-optimal quantum telecloning fidelity.
  arXiv  Detail & Related papers  (2022-04-30T01:40:24Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.