Outlier-Robust Multi-Model Fitting on Quantum Annealers
- URL: http://arxiv.org/abs/2504.13836v1
- Date: Fri, 18 Apr 2025 17:59:53 GMT
- Title: Outlier-Robust Multi-Model Fitting on Quantum Annealers
- Authors: Saurabh Pandey, Luca Magri, Federica Arrigoni, Vladislav Golyanik,
- Abstract summary: Multi-model fitting (MMF) presents a significant challenge in Computer Vision.<n>Existing quantum-based approaches for model fitting are either limited to a single model or consider multi-model scenarios within outlier-free datasets.<n>This paper introduces a novel approach, the robust quantum multi-model fitting (R-QuMF) algorithm to handle outliers effectively.
- Score: 29.24367815462826
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Multi-model fitting (MMF) presents a significant challenge in Computer Vision, particularly due to its combinatorial nature. While recent advancements in quantum computing offer promise for addressing NP-hard problems, existing quantum-based approaches for model fitting are either limited to a single model or consider multi-model scenarios within outlier-free datasets. This paper introduces a novel approach, the robust quantum multi-model fitting (R-QuMF) algorithm, designed to handle outliers effectively. Our method leverages the intrinsic capabilities of quantum hardware to tackle combinatorial challenges inherent in MMF tasks, and it does not require prior knowledge of the exact number of models, thereby enhancing its practical applicability. By formulating the problem as a maximum set coverage task for adiabatic quantum computers (AQC), R-QuMF outperforms existing quantum techniques, demonstrating superior performance across various synthetic and real-world 3D datasets. Our findings underscore the potential of quantum computing in addressing the complexities of MMF, especially in real-world scenarios with noisy and outlier-prone data.
Related papers
- An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks.<n>We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings.<n>We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
arXiv Detail & Related papers (2025-04-13T11:49:53Z) - MQFL-FHE: Multimodal Quantum Federated Learning Framework with Fully Homomorphic Encryption [5.713063730561454]
homomorphic encryption (FHE) in federated learning (FL) has led to significant advances in data privacy.<n>We propose a novel multimodal quantum federated learning framework that utilizes quantum computing to counteract the performance drop resulting from FHE.<n>Our results also demonstrate that the quantum-enhanced approach mitigates the performance degradation associated with FHE and improves classification accuracy across diverse datasets, validating the potential of quantum interventions in enhancing privacy in FL.
arXiv Detail & Related papers (2024-11-30T19:53:25Z) - Learning Density Functionals from Noisy Quantum Data [0.0]
noisy intermediate-scale quantum (NISQ) devices are used to generate training data for machine learning (ML) models.
We show that a neural-network ML model can successfully generalize from small datasets subject to noise typical of NISQ algorithms.
Our findings suggest a promising pathway for leveraging NISQ devices in practical quantum simulations.
arXiv Detail & Related papers (2024-09-04T17:59:55Z) - Attention to Quantum Complexity [21.766643620345494]
We introduce the Quantum Attention Network (QuAN), a versatile classical AI framework.
QuAN treats measurement snapshots as tokens while respecting their permutation invariance.
We rigorously test QuAN across three distinct quantum simulation settings.
arXiv Detail & Related papers (2024-05-19T17:46:40Z) - Quantum Mixed-State Self-Attention Network [3.1280831148667105]
This paper introduces a novel Quantum Mixed-State Self-Attention Network (QMSAN) for natural language processing tasks.<n>QMSAN uses a quantum attention mechanism based on mixed state, allowing for direct similarity estimation between queries and keys in the quantum domain.<n>We also propose an innovative quantum positional encoding scheme, implemented through fixed quantum gates within the circuit, improving the model's ability to capture sequence information without additional qubit resources.
arXiv Detail & Related papers (2024-03-05T11:29:05Z) - GQHAN: A Grover-inspired Quantum Hard Attention Network [53.96779043113156]
Grover-inspired Quantum Hard Attention Mechanism (GQHAM) is proposed.
GQHAN adeptly surmounts the non-differentiability hurdle, surpassing the efficacy of extant quantum soft self-attention mechanisms.
The proposal of GQHAN lays the foundation for future quantum computers to process large-scale data, and promotes the development of quantum computer vision.
arXiv Detail & Related papers (2024-01-25T11:11:16Z) - Multimodal deep representation learning for quantum cross-platform
verification [60.01590250213637]
Cross-platform verification, a critical undertaking in the realm of early-stage quantum computing, endeavors to characterize the similarity of two imperfect quantum devices executing identical algorithms.
We introduce an innovative multimodal learning approach, recognizing that the formalism of data in this task embodies two distinct modalities.
We devise a multimodal neural network to independently extract knowledge from these modalities, followed by a fusion operation to create a comprehensive data representation.
arXiv Detail & Related papers (2023-11-07T04:35:03Z) - Dynamic Programming on a Quantum Annealer: Solving the RBC Model [1.0681288493631977]
We introduce a novel approach to solving dynamic programming problems, such as those in many economic models, on a quantum annealer.
We achieve an order-of-magnitude speed-up in solving the real business cycle model over benchmarks in the literature.
arXiv Detail & Related papers (2023-06-07T09:38:42Z) - Quantum Multi-Model Fitting [38.11392123303445]
This paper proposes the first quantum approach to multi-model fitting (MMF)
We formulate MMF as a problem that can be efficiently sampled by modern adiabatic quantum computers without the relaxation of the objective function.
The experimental evaluation demonstrates promising results on a variety of datasets.
arXiv Detail & Related papers (2023-03-27T17:59:54Z) - A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
We focus on the case of learning with a single qubit, using data re-uploading techniques.
We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
arXiv Detail & Related papers (2022-11-23T18:25:32Z) - Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the
Race to Practical Quantum Advantage [43.3054117987806]
We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits.
We show this method significantly improves the trainability and performance of PQCs on a variety of problems.
By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
arXiv Detail & Related papers (2022-08-29T15:24:03Z) - Quantum Federated Learning with Quantum Data [87.49715898878858]
Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems.
This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
arXiv Detail & Related papers (2021-05-30T12:19:27Z) - 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)
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.