Towards Super-polynomial Quantum Speedup of Equivariant Quantum Algorithms with SU($d$) Symmetry
원문 초록
We introduce a framework of the equivariant convolutional quantum algorithms which is tailored for a number of machine-learning tasks on physical systems with arbitrary SU$(d)$ symmetries. It allows us to enhance a natural model of quantum computation -- permutational quantum computing (PQC) [Quantum Inf. Comput., 10, 470-497 (2010)] -- and define a more powerful model: PQC+. While PQC was shown to be efficiently classically simulatable, we exhibit a problem which can be efficiently solved on PQC+ machine, whereas no classical polynomial time algorithm is known; thus providing evidence against PQC+ being classically simulatable. We further discuss practical quantum machine learning algorithms which can be carried out in the paradigm of PQC+.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
The interplay of robustness and generalization in quantum machine learning
Qiskit Machine Learning: an open-source library for quantum machine learning tasks at scale on quantum hardware and classical simulators
QuXAI: Explainers for Hybrid Quantum Machine Learning Models
Distributed Quantum Neural Networks on Distributed Photonic Quantum Computing
Quorum: Zero-Training Unsupervised Anomaly Detection using Quantum Autoencoders
Fine-Tuning Large Language Models on Quantum Optimization Problems for Circuit Generation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.