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:2602.10115 · International Conference on 3D Vision (3DV)

Quantum Multiple Rotation Averaging

Shuteng Wang, Natacha Kuete Meli, Michael Möller, Vladislav Golyanik

Published Mar 20, 2026• 1 citation
arXivHTMLPDF

Abstract

Multiple rotation averaging (MRA) is a fundamental optimization problem in 3D vision and robotics that aims to recover globally consistent absolute rotations from noisy relative measurements Established classical methods, such as L1-IRLS and Shonan, face limitations including local minima susceptibility and reliance on convex relaxations that fail to preserve the exact manifold geometry, leading to reduced accuracy in high-noise scenarios. We introduce IQARS (Iterative Quantum Annealing for Rotation Synchronization), the first algorithm that reformulates MRA as a sequence of local quadratic non-convex sub-problems executable on quantum annealers after binarization, to leverage inherent hardware advantages. IQARS removes convex relaxation dependence and better preserves non-Euclidean rotation manifold geometry while leveraging quantum tunneling and parallelism for efficient solution space exploration. We evaluate IQARS's performance on synthetic and real-world datasets. While current annealers remain in their nascent phase and only support solving problems of limited scale with constrained performance, we observed that IQARS on D-Wave annealers can already achieve$\approx 12 {\%}$higher accuracy than Shonan-the bestperforming classical method evaluated empirically. Project page: https://4dqv.mpi-inf.mpg.de/QMRA/.

DOI
10.1109/3dv69130.2026.00013

Related papers

Outlier-Robust Multi-Model Fitting on Quantum Annealers

Saurabh Pandey, Luca Magri, Federica Arrigoni +1 more

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 data11Project page: https://4dqv.mpi-inf.mpg.de/RQMMF/.

IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)•Jun 11, 2025•1 citation

Multi-Task Quantum Annealing for Rapid Multi-Class Classification

Jargalsaikhan Artag, Moe Shimada, Jun‐ichi Shirakashi

Quantum computing offers new paradigms in machine learning, notably through Quantum Annealing (QA), which offers promising approaches to optimization problems. This study introduces an application of Multi-tasking Quantum Annealing (MTQA) to enhance multi-class Support Vector Machines (SVMs). Traditional QA methods require multiple cycles to classify multi-class datasets, significantly increasing computational demands. In contrast, MTQA embeds multiple SVM classifiers in parallel on a quantum annealer, thereby reducing the number of required annealing cycles to a single cycle. Utilizing the D-Wave Advantage 6.4 system, we evaluated our method across three benchmark datasets: a synthetic dataset (Blob), subsets of handwritten digits, and the Iris dataset with different feature focuses. Our findings demonstrate that MTQA achieves accuracy equivalent to that of classical Sequential Minimal Optimization (SMO), Simulated Annealing (SA), and standard QA methods while significantly improving computational efficiency. Despite the current limitations in quantum technology and the empirical selection of model parameters, these results highlight the emergent potential of quantum computing in machine learning. Further advancements in quantum algorithm optimization and parameter tuning are anticipated to enhance the efficacy of QA and MTQA, solidifying their practical application roles.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•1 citation

Multi-tasking through quantum annealing

Jargalsaikhan Artag, Koki Awaya, Takumi Kanezashi +3 more

Quantum annealing approximately solves combinatorial optimization problems by leveraging the principles of adiabatic quantum systems. In this approach, the system's Hamiltonian evolves from an initial general state to a problem-specific state. This study introduces multi-tasking quantum annealing (MTQA), a method that enables the parallel processing of multiple optimization problems by embedding them into spatially distinct regions on quantum hardware. MTQA is evaluated using two NP-hard problems: the minimum vertex cover problem (MVCP) and the graph partitioning problem (GPP). This parallel approach optimizes quantum resource utilization by concurrently utilizing idle qubits. The findings demonstrate that MTQA achieves a solution quality comparable to single-problem quantum annealing and classical simulated annealing (SA), while notably reducing the time-to-solution (TTS) metrics. Eigenspectrum analysis further theoretically supports the hypothesis that parallel embedding preserves quantum coherence and does not increase computational complexity by efficiently utilizing available quantum hardware (e.g., qubits and couplers). MTQA enables efficient multitasking in quantum annealing, optimizing hardware utilization and improving throughput for concurrent tasks and demonstrating performance for problems up to 100 nodes in real-world applications.

quant-pharXiv:2603.09468•EPJ Quantum Technology•Mar 11, 2026•0 citations

Quantum annealing for combinatorial optimization: a benchmarking study

Seongmin Kim, Sang-Woo Ahn, In‐Saeng Suh +3 more

Quantum annealing (QA) has the potential to significantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods. However, due to the limited number of qubits and their connectivity, the QA hardware did not show such an advantage over classical methods in past benchmarking studies. Recent advancements in QA with more than 5000 qubits, enhanced qubit connectivity, and the hybrid architecture promise to realize the quantum advantage. Here, we use a quantum annealer with state-of-the-art techniques and benchmark its performance against classical solvers. To compare their performance, we solve over 50 optimization problem instances represented by large and dense Hamiltonian matrices using quantum and classical solvers. The results demonstrate that a state-of-the-art quantum solver has higher accuracy (~0.013%) and a significantly faster problem-solving time (~6561×) than the best classical solver. Our results highlight the advantages of leveraging QA over classical counterparts, particularly in hybrid configurations, for achieving high accuracy and substantially reduced problem solving time in large-scale real-world optimization problems.

arXiv:2504.06201•npj Quantum Information•May 16, 2025•70 citations

Optimized QUBO formulation methods for quantum computing

Dario De Santis, Salvatore Tirone, Stefano Marmi +1 more

Abstract Quantum computers have strict requirements for the problems that they can efficiently solve. One of the principal limiting factor for the performances of noisy intermediate-scale quantum (NISQ) devices is the number of qubits required by the running algorithm. Several combinatorial optimization problems can be solved with NISQ devices once that a corresponding quadratic unconstrained binary optimization (QUBO) form is derived. Numerous techniques have been proposed to achieve such reformulations and, depending on the method chosen, the number of binary variables required, and therefore of qubits, can vary considerably. The aim of this work is to drastically reduce the variables needed for these QUBO reformulations in order to unlock the possibility to efficiently obtain optimal solutions for a class of optimization problems with NISQ devices. This goal is achieved by introducing novel tools that allow an efficient use of slack variables, even for problems with non-linear constraints, without the need to approximate the starting problem. We divide our new techniques in two independent parts, called the iterative quadratic polynomial and the master-satellite methods. Hence, we show how to apply our techniques in case of an NP-hard optimization problem inspired by a real-world financial scenario called Max-Profit Balance Settlement . We follow by submitting several instances of this problem to two D-wave quantum annealers, comparing the performances of our novel approach with the standard methods used in these scenarios. Moreover, this study allows to appreciate several performance differences between the D-wave Advantage and next-generation Advantage2 quantum annealers. We show that the adoption of our techniques in this context allows to obtain QUBO formulations with significantly fewer slack variables, i.e. around 90% less, and D-wave annealers provide considerably higher correct solution rates, which moreover do not decrease with the input size as fast as when adopting standard techniques.

arXiv:2406.07681•Quantum Science and Technology•Jan 21, 2026•17 citations

Quantum-driven real-time object detection systems

Seema Kaloria, Indrajit Ghosal, Narayanage Jayantha Dewasiri

This study explores the application of quantum annealing (QA) and reverse annealing (RA) to enhance the efficiency and accuracy of Multiple Object Tracking (MOT), a critical task in image recognition with wide-ranging real-time applications. MOT is particularly valuable in scenarios with high object density and frequent occlusions, such as traffic flow measurement, collision avoidance for autonomous systems, and industrial quality control. Traditional MOT methods, often modeled as combinatorial optimization problems, face computational bottlenecks as problem size scales. QA offers a breakthrough by leveraging quantum mechanics, including quantum superposition and tunneling, to rapidly and effectively search for optimal solutions. The proposed methods integrate QA for parallel processing of object tracking data and RA for fine-tuning solutions based on initial predictions, significantly reducing computation time while improving tracking accuracy. Experimental validation using the University at Albany DEtection and TRACking (UA-DETRAC) dataset demonstrates the effectiveness of these quantum-enhanced approaches. By combining multiple tracking solutions through ensemble techniques and leveraging RA for refinement, the methods achieved notable improvements in MOT metrics, including reduced identity switches, enhanced accuracy, and faster processing times. Applications in traffic management, autonomous systems, and industrial automation highlight the transformative potential of quantum-driven MOT systems in addressing real-time operational challenges. This work underscores the promise of quantum technologies as a foundational pillar for advancing next-generation image recognition and tracking systems.

Chapman & Hall/CRC eBooks•Jun 11, 2025•2 citations
Multiple rotation averaging (MRA) is a fundamental optimization problem in 3D vision and robotics that aims to recover globally consistent absolute rotations from noisy relative measurements Established classical methods, such as L1-IRLS and Shonan, face limitations including local minima susceptibility and reliance on convex relaxations that fail to preserve the exact manifold geometry, leading to reduced accuracy in high-noise scenarios. We introduce IQARS (Iterative Quantum Annealing for Rotation Synchronization), the first algorithm that reformulates MRA as a sequence of local quadratic non-convex sub-problems executable on quantum annealers after binarization, to leverage inherent hardware advantages. IQARS removes convex relaxation dependence and better preserves non-Euclidean rotation manifold geometry while leveraging quantum tunneling and parallelism for efficient solution space exploration. We evaluate IQARS's performance on synthetic and real-world datasets. While current annealers remain in their nascent phase and only support solving problems of limited scale with constrained performance, we observed that IQARS on D-Wave annealers can already achieve≈12%\approx 12 {\%}≈12%higher accuracy than Shonan-the bestperforming classical method evaluated empirically. Project page: https://4dqv.mpi-inf.mpg.de/QMRA/.
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 data11Project page: https://4dqv.mpi-inf.mpg.de/RQMMF/.
Quantum computing offers new paradigms in machine learning, notably through Quantum Annealing (QA), which offers promising approaches to optimization problems. This study introduces an application of Multi-tasking Quantum Annealing (MTQA) to enhance multi-class Support Vector Machines (SVMs). Traditional QA methods require multiple cycles to classify multi-class datasets, significantly increasing computational demands. In contrast, MTQA embeds multiple SVM classifiers in parallel on a quantum annealer, thereby reducing the number of required annealing cycles to a single cycle. Utilizing the D-Wave Advantage 6.4 system, we evaluated our method across three benchmark datasets: a synthetic dataset (Blob), subsets of handwritten digits, and the Iris dataset with different feature focuses. Our findings demonstrate that MTQA achieves accuracy equivalent to that of classical Sequential Minimal Optimization (SMO), Simulated Annealing (SA), and standard QA methods while significantly improving computational efficiency. Despite the current limitations in quantum technology and the empirical selection of model parameters, these results highlight the emergent potential of quantum computing in machine learning. Further advancements in quantum algorithm optimization and parameter tuning are anticipated to enhance the efficacy of QA and MTQA, solidifying their practical application roles.
Quantum annealing approximately solves combinatorial optimization problems by leveraging the principles of adiabatic quantum systems. In this approach, the system's Hamiltonian evolves from an initial general state to a problem-specific state. This study introduces multi-tasking quantum annealing (MTQA), a method that enables the parallel processing of multiple optimization problems by embedding them into spatially distinct regions on quantum hardware. MTQA is evaluated using two NP-hard problems: the minimum vertex cover problem (MVCP) and the graph partitioning problem (GPP). This parallel approach optimizes quantum resource utilization by concurrently utilizing idle qubits. The findings demonstrate that MTQA achieves a solution quality comparable to single-problem quantum annealing and classical simulated annealing (SA), while notably reducing the time-to-solution (TTS) metrics. Eigenspectrum analysis further theoretically supports the hypothesis that parallel embedding preserves quantum coherence and does not increase computational complexity by efficiently utilizing available quantum hardware (e.g., qubits and couplers). MTQA enables efficient multitasking in quantum annealing, optimizing hardware utilization and improving throughput for concurrent tasks and demonstrating performance for problems up to 100 nodes in real-world applications.
Quantum annealing (QA) has the potential to significantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods. However, due to the limited number of qubits and their connectivity, the QA hardware did not show such an advantage over classical methods in past benchmarking studies. Recent advancements in QA with more than 5000 qubits, enhanced qubit connectivity, and the hybrid architecture promise to realize the quantum advantage. Here, we use a quantum annealer with state-of-the-art techniques and benchmark its performance against classical solvers. To compare their performance, we solve over 50 optimization problem instances represented by large and dense Hamiltonian matrices using quantum and classical solvers. The results demonstrate that a state-of-the-art quantum solver has higher accuracy (~0.013%) and a significantly faster problem-solving time (~6561×) than the best classical solver. Our results highlight the advantages of leveraging QA over classical counterparts, particularly in hybrid configurations, for achieving high accuracy and substantially reduced problem solving time in large-scale real-world optimization problems.
Abstract Quantum computers have strict requirements for the problems that they can efficiently solve. One of the principal limiting factor for the performances of noisy intermediate-scale quantum (NISQ) devices is the number of qubits required by the running algorithm. Several combinatorial optimization problems can be solved with NISQ devices once that a corresponding quadratic unconstrained binary optimization (QUBO) form is derived. Numerous techniques have been proposed to achieve such reformulations and, depending on the method chosen, the number of binary variables required, and therefore of qubits, can vary considerably. The aim of this work is to drastically reduce the variables needed for these QUBO reformulations in order to unlock the possibility to efficiently obtain optimal solutions for a class of optimization problems with NISQ devices. This goal is achieved by introducing novel tools that allow an efficient use of slack variables, even for problems with non-linear constraints, without the need to approximate the starting problem. We divide our new techniques in two independent parts, called the iterative quadratic polynomial and the master-satellite methods. Hence, we show how to apply our techniques in case of an NP-hard optimization problem inspired by a real-world financial scenario called Max-Profit Balance Settlement . We follow by submitting several instances of this problem to two D-wave quantum annealers, comparing the performances of our novel approach with the standard methods used in these scenarios. Moreover, this study allows to appreciate several performance differences between the D-wave Advantage and next-generation Advantage2 quantum annealers. We show that the adoption of our techniques in this context allows to obtain QUBO formulations with significantly fewer slack variables, i.e. around 90% less, and D-wave annealers provide considerably higher correct solution rates, which moreover do not decrease with the input size as fast as when adopting standard techniques.
This study explores the application of quantum annealing (QA) and reverse annealing (RA) to enhance the efficiency and accuracy of Multiple Object Tracking (MOT), a critical task in image recognition with wide-ranging real-time applications. MOT is particularly valuable in scenarios with high object density and frequent occlusions, such as traffic flow measurement, collision avoidance for autonomous systems, and industrial quality control. Traditional MOT methods, often modeled as combinatorial optimization problems, face computational bottlenecks as problem size scales. QA offers a breakthrough by leveraging quantum mechanics, including quantum superposition and tunneling, to rapidly and effectively search for optimal solutions. The proposed methods integrate QA for parallel processing of object tracking data and RA for fine-tuning solutions based on initial predictions, significantly reducing computation time while improving tracking accuracy. Experimental validation using the University at Albany DEtection and TRACking (UA-DETRAC) dataset demonstrates the effectiveness of these quantum-enhanced approaches. By combining multiple tracking solutions through ensemble techniques and leveraging RA for refinement, the methods achieved notable improvements in MOT metrics, including reduced identity switches, enhanced accuracy, and faster processing times. Applications in traffic management, autonomous systems, and industrial automation highlight the transformative potential of quantum-driven MOT systems in addressing real-time operational challenges. This work underscores the promise of quantum technologies as a foundational pillar for advancing next-generation image recognition and tracking systems.