Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2511.18318

General Machine Learning Algorithm for Quantum Teleportation

Allison Brattley, Tomas Opatrny, Kunal K. Das

quant-phSubmitted Nov 23, 2025• Announced Nov 25, 2025• 0 citations
arXivHTMLPDF

Abstract

We present a general algorithm, based on machine learning, which can create optimal unitary operators to implement quantum teleportation in any system with well-defined set of measurements in a relevant entangled basis. We illustrate it with a collective spin model and demonstrate its versatility by applying it to teloportation of single and multiple qubit states, coherent and Dicke states, and for systems with prior distributions and unequal dimensions. All cases display significant regimes of quantum advantage over corresponding classical schemes with no entanglement. The algorithm offers the flexibility to choose a balance between target fidelity and computational cost.

Comments
7 pages, 4 figures

Related papers

Quantum Entanglement for Machine Learning Algorithm Optimization

Jincheng Zhang

Quantum entanglement, a peculiar phenomenon in quantum mechanics, offers the potential for fundamentally novel approaches to machine learning. This paper explores the application of quantum entanglement to optimize machine learning model parameters, aiming to enhance model adaptability and generalization. We propose a novel algorithm, leveraging the unique properties of entangled states to dynamically adjust model parameters, creating a more robust and versatile learning process. The core mechanism centers around manipulating entangled states to influence the model's internal representation and parameter space. The paper details the theoretical framework, the implementation of the algorithm, and preliminary experimental results demonstrating improved performance on a specific dataset. The investigation suggests that this approach could represent a significant advancement in machine learning algorithm optimization, particularly in scenarios demanding high adaptability and robustness.

•Aug 31, 2026•0 citations

Machine Learning Algorithms in Quantum Computing: A Survey

Somayeh Bakhtiari Ramezani, Alexander Sommers, Harish Kumar Manchukonda +2 more

Machine Learning (ML) aims at designing models that learn from previous experience, without being explicitly formulated. Applications of machine learning are inexhaustible, including recognizing patterns, predicting future trends and making decisions, and they are capable of handling sizable quantities of multi-dimensional data in the form of large vectors and tensors. To perform these operations on classical computers, however, requires vast time and computational resources. Unlike the classical computers that rely on computations using binary bits, Quantum Computers (QC) benefit from qubits which can hold combinations of 0 and 1 at the same time via superposition and entanglement. This makes QCs powerful at handling and post processing large tensors, making them a prime target for implementing ML algorithms. While several models used for ML on QCs are based on concepts from their classical computing counterparts, utilization of the QC's potential has made them the superior of the two. This paper presents an overview of the current state of knowledge in application of ML on QC, and evaluates the speed up, and complexity advantages of using quantum machines.

International Joint Conference on Neural Networks (IJCNN)•Jul 1, 2020•122 citations

Beyond Bell Teleportation: Machine-Learned Adaptive Protocols

Krishnajith C Vinod, N C Randeep

Quantum teleportation have a central role in quantum information science and allows transferring of an unknown quantum state through entanglement and classical communication. Unfortunately, the interaction with external and internal noise severely affects the quality of teleportation and poses limitations on practical applications of quantum communication networks. In this work, instead of conventional Bell teleportation, we introduce a Machine Learned adaptive protocol for optimizing multiple components of Quantum Teleportation in order to achieve higher fidelity in various noise environments. In order to demonstrate the performance of the proposed scheme, we study three different noise models, including bit-flip, amplitude damping, and depolarizing noise, both in case of single-qubit and two-qubit channels. As a result, we observe substantial improvement in the teleportation fidelity in comparison to the classical Bell-state teleportation protocol in certain noise conditions. Furthermore, the machine-learned protocol reveals a nontrivial strategy for compensation of decoherence and information losses. In addition, obtained results indicate the flexibility and reliability of the proposed framework for implementing various adaptive quantum communications while shedding light on possibilities of discovery of optimal quantum algorithms by means of automated approache

quant-pharXiv:2605.16467•May 18, 2026•0 citations

Quantum teleportation of an arbitrary N-qubit state using and identifying only Bell states

Zhanjun Zhang

First, I show explicitly a scheme to {\it faithfully} and {\it deterministically} teleport an arbitrary 2-qubit state from Alice to Bob. In this scheme two same Bell states are sufficient for use. Bob can recover the 2-qubit state by performing at most 4 single-qubit unitary operations conditioned on Alice's 4-bit classical public message corresponding to her two Bell-state measurement outcomes. Then I generalize the 2-qubit teleportation scheme to an aribitrary $N(N\ge 3)$-qubit state teleportation case by using $N$ same Bell states. In the generalized scheme, Alice only needs to identify $N$ Bell states after quantum swapping and then publish her measurement outcomes ($2N$-bit classical message). Conditioned on Alice's $2N$-bit classical message, Bob only needs to perform at most $2N$ single-qubit unitary operations to {\it fully} recover the arbitrary state. By comparing with the newest relevant work [Phys. Rev. A{\bf 71}, 032303(2005)], the advantages of the present schemes are revealed, respectively.

•Apr 17, 2005•0 citations

Quantum Machine Learning: Adaptive Learning Algorithms

Jincheng Zhang

This paper investigates the potential of quantum machine learning to revolutionize the field of machine learning through adaptive learning algorithms. Traditional machine learning algorithms often rely on static parameter settings, limiting their adaptability and potentially hindering optimal performance. We propose a novel quantum learning framework that leverages quantum entanglement and quantum computation to dynamically adjust model parameters during the learning process, resulting in enhanced learning efficiency and generalization capabilities. The core mechanism centers around utilizing quantum entanglement to create a dynamic feedback loop that continuously refines the model's parameters based on its internal state. We present a detailed theoretical analysis and preliminary experimental validation demonstrating the effectiveness of this approach in a simplified learning scenario. The study explores the potential advantages of quantum-enhanced learning over classical methods.

•Sep 1, 2026•0 citations

Benchmark for Quantum Teleportation with Non-Uniform Prior Distributions

Tomáš Opatrný, Allison Brattley, Kunal K. Das

Quantum teleportation should surpass maximum fidelity thresholds possible with local measurements and classical communications. Benchmarks have been established when states are drawn from a uniform distribution of qubits or coherent states of harmonic oscillators. These are not applicable when there is prior knowledge about the input that skews the distribution. We determine the highest mean fidelity achievable for teleportation of states without using entanglement but drawn from a non-uniform prior distribution, specifically a von Mises - Fisher distribution. Using Bayesian methods, we derive benchmark functions for single qubit teleportation that utilize projective measurement on specific axes on the Bloch sphere. We demonstrate that similar results can be achieved with a coherent spin positive operator-valued measure (POVM), based upon heterodyne detection. These methods are then used to derive corresponding benchmarks for teleporting multi-qubit systems that we model as spin coherent states, covering the full range of particle number $N\in [1, \infty)$. The results show that fidelity thresholds to declare quantum advantage can be significantly higher than is typically assumed with uniform distribution.

quant-pharXiv:2605.24861•May 26, 2026•0 citations
We present a general algorithm, based on machine learning, which can create optimal unitary operators to implement quantum teleportation in any system with well-defined set of measurements in a relevant entangled basis. We illustrate it with a collective spin model and demonstrate its versatility by applying it to teloportation of single and multiple qubit states, coherent and Dicke states, and for systems with prior distributions and unequal dimensions. All cases display significant regimes of quantum advantage over corresponding classical schemes with no entanglement. The algorithm offers the flexibility to choose a balance between target fidelity and computational cost.
Quantum entanglement, a peculiar phenomenon in quantum mechanics, offers the potential for fundamentally novel approaches to machine learning. This paper explores the application of quantum entanglement to optimize machine learning model parameters, aiming to enhance model adaptability and generalization. We propose a novel algorithm, leveraging the unique properties of entangled states to dynamically adjust model parameters, creating a more robust and versatile learning process. The core mechanism centers around manipulating entangled states to influence the model's internal representation and parameter space. The paper details the theoretical framework, the implementation of the algorithm, and preliminary experimental results demonstrating improved performance on a specific dataset. The investigation suggests that this approach could represent a significant advancement in machine learning algorithm optimization, particularly in scenarios demanding high adaptability and robustness.
Machine Learning (ML) aims at designing models that learn from previous experience, without being explicitly formulated. Applications of machine learning are inexhaustible, including recognizing patterns, predicting future trends and making decisions, and they are capable of handling sizable quantities of multi-dimensional data in the form of large vectors and tensors. To perform these operations on classical computers, however, requires vast time and computational resources. Unlike the classical computers that rely on computations using binary bits, Quantum Computers (QC) benefit from qubits which can hold combinations of 0 and 1 at the same time via superposition and entanglement. This makes QCs powerful at handling and post processing large tensors, making them a prime target for implementing ML algorithms. While several models used for ML on QCs are based on concepts from their classical computing counterparts, utilization of the QC's potential has made them the superior of the two. This paper presents an overview of the current state of knowledge in application of ML on QC, and evaluates the speed up, and complexity advantages of using quantum machines.
Quantum teleportation have a central role in quantum information science and allows transferring of an unknown quantum state through entanglement and classical communication. Unfortunately, the interaction with external and internal noise severely affects the quality of teleportation and poses limitations on practical applications of quantum communication networks. In this work, instead of conventional Bell teleportation, we introduce a Machine Learned adaptive protocol for optimizing multiple components of Quantum Teleportation in order to achieve higher fidelity in various noise environments. In order to demonstrate the performance of the proposed scheme, we study three different noise models, including bit-flip, amplitude damping, and depolarizing noise, both in case of single-qubit and two-qubit channels. As a result, we observe substantial improvement in the teleportation fidelity in comparison to the classical Bell-state teleportation protocol in certain noise conditions. Furthermore, the machine-learned protocol reveals a nontrivial strategy for compensation of decoherence and information losses. In addition, obtained results indicate the flexibility and reliability of the proposed framework for implementing various adaptive quantum communications while shedding light on possibilities of discovery of optimal quantum algorithms by means of automated approache
First, I show explicitly a scheme to {\it faithfully} and {\it deterministically} teleport an arbitrary 2-qubit state from Alice to Bob. In this scheme two same Bell states are sufficient for use. Bob can recover the 2-qubit state by performing at most 4 single-qubit unitary operations conditioned on Alice's 4-bit classical public message corresponding to her two Bell-state measurement outcomes. Then I generalize the 2-qubit teleportation scheme to an aribitrary N(N≥3)N(N\ge 3)N(N≥3)-qubit state teleportation case by using NNN same Bell states. In the generalized scheme, Alice only needs to identify NNN Bell states after quantum swapping and then publish her measurement outcomes (2N2N2N-bit classical message). Conditioned on Alice's 2N2N2N-bit classical message, Bob only needs to perform at most 2N2N2N single-qubit unitary operations to {\it fully} recover the arbitrary state. By comparing with the newest relevant work [Phys. Rev. A{\bf 71}, 032303(2005)], the advantages of the present schemes are revealed, respectively.
This paper investigates the potential of quantum machine learning to revolutionize the field of machine learning through adaptive learning algorithms. Traditional machine learning algorithms often rely on static parameter settings, limiting their adaptability and potentially hindering optimal performance. We propose a novel quantum learning framework that leverages quantum entanglement and quantum computation to dynamically adjust model parameters during the learning process, resulting in enhanced learning efficiency and generalization capabilities. The core mechanism centers around utilizing quantum entanglement to create a dynamic feedback loop that continuously refines the model's parameters based on its internal state. We present a detailed theoretical analysis and preliminary experimental validation demonstrating the effectiveness of this approach in a simplified learning scenario. The study explores the potential advantages of quantum-enhanced learning over classical methods.
Quantum teleportation should surpass maximum fidelity thresholds possible with local measurements and classical communications. Benchmarks have been established when states are drawn from a uniform distribution of qubits or coherent states of harmonic oscillators. These are not applicable when there is prior knowledge about the input that skews the distribution. We determine the highest mean fidelity achievable for teleportation of states without using entanglement but drawn from a non-uniform prior distribution, specifically a von Mises - Fisher distribution. Using Bayesian methods, we derive benchmark functions for single qubit teleportation that utilize projective measurement on specific axes on the Bloch sphere. We demonstrate that similar results can be achieved with a coherent spin positive operator-valued measure (POVM), based upon heterodyne detection. These methods are then used to derive corresponding benchmarks for teleporting multi-qubit systems that we model as spin coherent states, covering the full range of particle number N∈[1,∞)N\in [1, \infty)N∈[1,∞). The results show that fidelity thresholds to declare quantum advantage can be significantly higher than is typically assumed with uniform distribution.