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:2610.35657

Quantum-Inspired and Optimization-Based CT Reconstruction Through Spin-Error

Hyunju Lee, Jeonghwa Lee, Yushuang Sam Yang, Clement Chu, Anthony B. Murphy, Kyungtaek Jun

quant-phSubmitted Oct 26, 2026• Announced Oct 27, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum-optimization-based computed tomography (CT) reconstruction has demonstrated quantum supremacy in reconstruction accuracy over conventional classical methods under sparse-view and corrupted-sinogram conditions. However, scaling this approach remains challenging because larger images require increasingly many binary variables and interactions in the underlying quadratic unconstrained binary optimization (QUBO) model. Even with iterative region-of-interest (ROI) refinement, a 60 by 60 ROI with three X-ray mass attenuation coefficients requires 10,800 binary variables under our encoding. As an initial step toward larger quantum CT images, we investigate simulated annealing (SA) followed by spin-error mitigation for optimisation (SEMO), without altering the CT-QUBO objective. We evaluate three 54-view ROI reconstruction instances and nine-view reconstruction with detector-row corruption, comparing SA and SEMO with selected hybrid quantum-classical solver results. For the ROI cases, SEMO reduced the numbers of incorrectly reconstructed pixels in low-budget SA outputs from 13 to 1, 38 to 0, and 54 to 15. With 20 percent detector-row corruption, three of four selected SA and SEMO pairs achieved exact reconstruction. Applying SEMO to one hybrid-solver output reduced its ROI error from 78 to 1 pixel. Improvements were instance-dependent: in one corrupted-sinogram case, QUBO energy decreased while image-domain error increased slightly; in one ROI case, the refined image retained 15 incorrect pixels despite having lower QUBO energy than ground truth. At the evaluated problem sizes, SA and SEMO attained reconstruction accuracy comparable to or better than selected unmitigated hybrid-solver results, providing an initial solution-quality benchmark for future larger-scale, parallelized quantum CT image reconstruction.

AI Summary

This paper examines whether classical simulated annealing (SA), followed by spin-error mitigation for optimisation (SEMO), can improve CT reconstructions formulated as quadratic unconstrained binary optimisation (QUBO) problems. The motivation is scaling: under the stated encoding, a $60\times60$ region of interest (ROI) with three X-ray mass attenuation coefficients requires 10,800 binary variables. SEMO is applied as post-processing without changing the CT-QUBO objective. The reported evaluation covers three 54-view ROI reconstruction instances and nine-view reconstruction with detector-row corruption, with comparisons against selected hybrid quantum–classical solver outputs. For the three ROI instances, SEMO reduced incorrectly reconstructed pixels in low-budget SA outputs from 13 to 1, 38 to 0, and 54 to 15. Under 20% detector-row corruption, three of four selected SA–SEMO pairs achieved exact reconstruction. Post-processing one hybrid-solver output reduced its ROI error from 78 pixels to 1. At these evaluated sizes, SA with SEMO produced accuracy comparable to or better than the selected unmitigated hybrid-solver results. The abstract identifies instance-dependent performance and a mismatch between optimisation energy and reconstruction accuracy. In one corrupted-sinogram instance, lower QUBO energy accompanied slightly greater image error; in one ROI instance, 15 incorrect pixels remained despite an energy below that of the ground-truth image. The results are presented as an initial solution-quality benchmark, rather than a demonstration of larger-scale reconstruction or quantum advantage. Only the abstract is available, limiting assessment of implementation details, computational budgets, and comparison protocols.

Little sign of AI-generated textOverclaimsIncrementalSmall numerics onlyMissing comparison

Written by gpt-6.1-sol from the abstract only. Automated: it can be wrong.

Comments
15 pages, 3 figures

Related papers

Quantum-assisted tomographic image refinement with limited qubits for high-resolution imaging

Hyunju Lee, Kyungtaek Jun

We propose a quantum-assisted reconstruction framework for high-resolution tomographic imaging that reduces qubit/variable requirements by combining sinogram downsampling and region-wise iterative refinement. Previous quantum optimization–based CT reconstruction methods require solving QUBO (Quadratic Unconstrained Binary Optimization) problems over full-resolution image grids, which limits scalability under current hardware constraints. Our method addresses this by combining sinogram downscaling with region-wise iterative refinement, allowing reconstruction to begin from a reduced-resolution sinogram and image, and then to be progressively upscaled and optimized region by region. Each region is independently transformed into a compact QUBO problem and solved via a D-Wave hybrid quantum-classical solver while keeping the surrounding image fixed. The framework supports both full-view and sparse-view sinograms and is compatible with diverse acquisition geometries, including parallel-beam, fan-beam, cone-beam, synchrotron tomography, and electron tomography (ET). Adaptive region selection (including overlapping or boundary-covering subregions) enables targeted refinement of residual-error under a limited qubit/variable budget. Experimental validation on binary and integer-valued Shepp-Logan phantoms, together with an additional chest CT slice experiment, demonstrates accurate reconstructions under both dense-view and sparse-view angular sampling using reduced qubit/variable budgets. We observed that nearest-neighbor interpolation may cause edge artifacts that hinder convergence, which can be mitigated by smoother interpolation and Gaussian filtering. Sparse-view experiments indicate that the refinement pipeline can remain effective under angular undersampling in our discrete setting, suggesting potential relevance to low-dose imaging scenarios, while a dose–quality trade-off analysis is left for future work. These findings highlight the practicality of QUBO-based, quantum-assisted refinement for high-resolution tomographic reconstruction under current hardware constraints and provide a pathway for scaling as hybrid quantum optimization capabilities evolve.

arXiv:2504.20654•EPJ Quantum Technology•Jul 17, 2026•0 citations

High-Fidelity ROI CT Reconstruction with Limited Quantum Resources via Hybrid Classical-Quantum Refinement

Hyunju Lee, Jeonghwa Lee, Kyungtaek Jun

Quantum optimization for computed tomography (CT) reconstruction is constrained by the number of binary variables required for image representation, making direct whole-image quantum reconstruction difficult for large or structurally complex objects. We propose a hybrid region-of-interest (ROI) refinement framework in which a coarse global image is first reconstructed by quantum tomographic reconstruction (QTR) and quantum compressed sensing tomographic reconstruction (QCSTR), filtered backprojection (FBP), or simultaneous algebraic reconstruction technique (SART), and quantum optimization is then applied only to the selected ROI through a residual projection-image formulation. This strategy reduces the effective QUBO size while preserving high-fidelity reconstruction in the target region. Experiments on three discrete phantom samples show that both QTR/QCSTR+QTR/QCSTR and SART+QTR/QCSTR achieve accurate ROI reconstruction for moderate-size cases under a reduced-angle setting. For the largest and most complex sample, the quality of the coarse global estimate becomes critical, and the best result is obtained when a stable classical coarse reconstruction is combined with second-stage ROI-only QTR/QCSTR. Among the tested pipelines, SART+QTR/QCSTR achieves the lowest average ROI RMSE and MAE. The results indicate that the practical advantage of quantum-assisted CT reconstruction lies in reserving quantum optimization for local refinement while using classical reconstruction to stabilize the global background.

quant-pharXiv:2605.29472•May 29, 2026•0 citations

Quantum CT via Dynamic Interval Encoding and Prior-Balanced QUBO Reconstruction

A F Wang, Yikuang Yuluo, Yujie Liu +7 more

Quadratic unconstrained binary optimization (QUBO)-based quantum computed tomography (CT) casts reconstruction as a binary quadratic problem for quantum annealing and hybrid quantum--classical solvers. For grayscale CT, however, image encoding is constrained by the binary-variable budget: fixed global bit-plane encodings increase QUBO size and coupling complexity as gray-level precision improves, whereas low-bit encodings introduce quantization error. We propose a QUBO-based grayscale CT reconstruction framework that combines dynamic interval encoding with prior-balanced optimization. Each refinement round encodes active pixels only within local gray-level intervals around the current estimate, and a boundary-hit-guided update rule adaptively switches between search expansion and local refinement. To improve optimization stability, the method balances projection-domain data consistency and an edge-preserving quadratic prior before forming the final QUBO. Sparse-view and limited-angle fan-beam CT experiments show that the proposed method recovers structures and gray-level distributions more faithfully than the evaluated analytic, iterative, variational, and representation-based baselines. Expressivity analysis and ablation studies further indicate that the improvement mainly arises from effective gray-level representation through dynamic local encoding and more stable data-fidelity--prior coupling. Experiments on the D-Wave hybrid binary quadratic model (BQM) solver further demonstrate that the formulation is executable on a hardware-backed hybrid quantum--classical backend.

arXiv:2606.24561•Jun 23, 2026•0 citations

Quantum optimization algorithms for CT image segmentation from X-ray data

Kyungtaek Jun, Hyunju Lee

Computed tomography (CT) is an important imaging technique used in medical analysis of the internal structure of the human body. Previously, image segmentation methods were required after acquiring reconstructed CT images to obtain segmented CT images which made it susceptible to errors from both reconstruction and segmentation algorithms. However, this paper introduces a new approach using an advanced quantum optimization algorithm called quadratic unconstrained binary optimization (QUBO) for CT image segmentation. This algorithm allows CT image reconstruction and segmentation to be performed simultaneously. This algorithm segments CT images by minimizing the difference between a sinogram in a superposition state with qubits, obtained using the mathematical projection including the Radon transform, and the experimentally acquired sinogram from X-ray images for various angles. Furthermore, we leveraged X-ray mass attenuation coefficients to reduce the number of logical qubits required for our quantum optimization algorithm, and we employed D-Wave's hybrid solver to solve the optimization problem. We compared the segmentation results of our algorithm with those of classical algorithms using X-ray images of actual tooth samples to validate the results of our algorithm. The comparison revealed that, after undergoing appropriate image post-processing, our algorithm's segmentation results matched those of classical algorithms that perform segmentation after reconstruction, except for some pixels at the boundary. We expect that the new quantum optimization CT algorithm will bring about great advancements in medical imaging.

arXiv:2306.05522•Scientific Reports•Jul 1, 2025•8 citations

Quantum Compressed Sensing Tomographic Reconstruction Algorithm

Arim Ryou, Kiwoong Kim, Kyungtaek Jun

Computed tomography (CT) is a non-destructive technique for observing internal images and has proven highly valuable in medical diagnostics. Recent advances in quantum computing have begun to influence tomographic reconstruction techniques. The quantum tomographic reconstruction algorithm is less affected by artifacts or noise than classical algorithms by using the square function of the difference between pixels obtained by projecting CT images in quantum superposition states and pixels obtained from experimental data. In particular, by using quantum linear systems, a fast quadratic unconstrained binary optimization (QUBO) model formulation for quantum tomographic reconstruction is possible. In this paper, we formulate the QUBO model for quantum compressed sensing tomographic reconstruction, which is a linear combination of the QUBO model for quantum tomographic reconstruction and the QUBO model for total variation in quantum superposition-state CT images. In our experiments, we used sinograms obtained by using the Radon transform of Shepp-Logan images and body CT images. We evaluate the performance of the new algorithm by reconstructing CT images using a hybrid solver with the QUBO model computed from each sinogram. The new algorithm was able to obtain a solution within 5 projection images for 30 × 30 image samples and within 6 projection images for 60 × 60 image samples, reconstructing error-free CT images. We anticipate that quantum compressed sensing tomographic reconstruction algorithms could significantly reduce the total radiation dose when quantum computing performance advances.

arXiv:2505.11286•IEEE Transactions on Quantum Engineering•Jan 1, 2026•0 citations

Quantum computing for the optimization of CT image reconstruction

Hyunju Lee, Youngpyo Ryu, Jennifer Kim +1 more

Computed tomography (CT) is an important diagnostic technique used to analyze the inner structure of the human body. Various reconstruction methods of CT images have been proposed and utilized for a long time. The existing optimization methods for CT reconstruction images, however, usually suffer from substantial computational complexities. To circumvent this difficulty, a quadratic unconstrained binary optimization (QUBO) model for fast and accurate reconstruction of CT images was recently developed. In this paper, we apply the QUBO model to the 15-by-15 sized Shepp-Logan phantom image sample of the largest computable image in the D-Wave Advantage System. Herein, we reconstructed the CT image of the QUBO model in the D-Wave system using a QPU solver and a hybrid solver. Here are our results.

International Conference on Information and Communication Technology Convergence (ICTC)•Oct 19, 2022•1 citation
Quantum-optimization-based computed tomography (CT) reconstruction has demonstrated quantum supremacy in reconstruction accuracy over conventional classical methods under sparse-view and corrupted-sinogram conditions. However, scaling this approach remains challenging because larger images require increasingly many binary variables and interactions in the underlying quadratic unconstrained binary optimization (QUBO) model. Even with iterative region-of-interest (ROI) refinement, a 60 by 60 ROI with three X-ray mass attenuation coefficients requires 10,800 binary variables under our encoding. As an initial step toward larger quantum CT images, we investigate simulated annealing (SA) followed by spin-error mitigation for optimisation (SEMO), without altering the CT-QUBO objective. We evaluate three 54-view ROI reconstruction instances and nine-view reconstruction with detector-row corruption, comparing SA and SEMO with selected hybrid quantum-classical solver results. For the ROI cases, SEMO reduced the numbers of incorrectly reconstructed pixels in low-budget SA outputs from 13 to 1, 38 to 0, and 54 to 15. With 20 percent detector-row corruption, three of four selected SA and SEMO pairs achieved exact reconstruction. Applying SEMO to one hybrid-solver output reduced its ROI error from 78 to 1 pixel. Improvements were instance-dependent: in one corrupted-sinogram case, QUBO energy decreased while image-domain error increased slightly; in one ROI case, the refined image retained 15 incorrect pixels despite having lower QUBO energy than ground truth. At the evaluated problem sizes, SA and SEMO attained reconstruction accuracy comparable to or better than selected unmitigated hybrid-solver results, providing an initial solution-quality benchmark for future larger-scale, parallelized quantum CT image reconstruction.
This paper examines whether classical simulated annealing (SA), followed by spin-error mitigation for optimisation (SEMO), can improve CT reconstructions formulated as quadratic unconstrained binary optimisation (QUBO) problems. The motivation is scaling: under the stated encoding, a 60×6060\times6060×60 region of interest (ROI) with three X-ray mass attenuation coefficients requires 10,800 binary variables. SEMO is applied as post-processing without changing the CT-QUBO objective.
The reported evaluation covers three 54-view ROI reconstruction instances and nine-view reconstruction with detector-row corruption, with comparisons against selected hybrid quantum–classical solver outputs. For the three ROI instances, SEMO reduced incorrectly reconstructed pixels in low-budget SA outputs from 13 to 1, 38 to 0, and 54 to 15. Under 20% detector-row corruption, three of four selected SA–SEMO pairs achieved exact reconstruction. Post-processing one hybrid-solver output reduced its ROI error from 78 pixels to 1. At these evaluated sizes, SA with SEMO produced accuracy comparable to or better than the selected unmitigated hybrid-solver results.
The abstract identifies instance-dependent performance and a mismatch between optimisation energy and reconstruction accuracy. In one corrupted-sinogram instance, lower QUBO energy accompanied slightly greater image error; in one ROI instance, 15 incorrect pixels remained despite an energy below that of the ground-truth image. The results are presented as an initial solution-quality benchmark, rather than a demonstration of larger-scale reconstruction or quantum advantage. Only the abstract is available, limiting assessment of implementation details, computational budgets, and comparison protocols.
We propose a quantum-assisted reconstruction framework for high-resolution tomographic imaging that reduces qubit/variable requirements by combining sinogram downsampling and region-wise iterative refinement. Previous quantum optimization–based CT reconstruction methods require solving QUBO (Quadratic Unconstrained Binary Optimization) problems over full-resolution image grids, which limits scalability under current hardware constraints. Our method addresses this by combining sinogram downscaling with region-wise iterative refinement, allowing reconstruction to begin from a reduced-resolution sinogram and image, and then to be progressively upscaled and optimized region by region. Each region is independently transformed into a compact QUBO problem and solved via a D-Wave hybrid quantum-classical solver while keeping the surrounding image fixed. The framework supports both full-view and sparse-view sinograms and is compatible with diverse acquisition geometries, including parallel-beam, fan-beam, cone-beam, synchrotron tomography, and electron tomography (ET). Adaptive region selection (including overlapping or boundary-covering subregions) enables targeted refinement of residual-error under a limited qubit/variable budget. Experimental validation on binary and integer-valued Shepp-Logan phantoms, together with an additional chest CT slice experiment, demonstrates accurate reconstructions under both dense-view and sparse-view angular sampling using reduced qubit/variable budgets. We observed that nearest-neighbor interpolation may cause edge artifacts that hinder convergence, which can be mitigated by smoother interpolation and Gaussian filtering. Sparse-view experiments indicate that the refinement pipeline can remain effective under angular undersampling in our discrete setting, suggesting potential relevance to low-dose imaging scenarios, while a dose–quality trade-off analysis is left for future work. These findings highlight the practicality of QUBO-based, quantum-assisted refinement for high-resolution tomographic reconstruction under current hardware constraints and provide a pathway for scaling as hybrid quantum optimization capabilities evolve.
Quantum optimization for computed tomography (CT) reconstruction is constrained by the number of binary variables required for image representation, making direct whole-image quantum reconstruction difficult for large or structurally complex objects. We propose a hybrid region-of-interest (ROI) refinement framework in which a coarse global image is first reconstructed by quantum tomographic reconstruction (QTR) and quantum compressed sensing tomographic reconstruction (QCSTR), filtered backprojection (FBP), or simultaneous algebraic reconstruction technique (SART), and quantum optimization is then applied only to the selected ROI through a residual projection-image formulation. This strategy reduces the effective QUBO size while preserving high-fidelity reconstruction in the target region. Experiments on three discrete phantom samples show that both QTR/QCSTR+QTR/QCSTR and SART+QTR/QCSTR achieve accurate ROI reconstruction for moderate-size cases under a reduced-angle setting. For the largest and most complex sample, the quality of the coarse global estimate becomes critical, and the best result is obtained when a stable classical coarse reconstruction is combined with second-stage ROI-only QTR/QCSTR. Among the tested pipelines, SART+QTR/QCSTR achieves the lowest average ROI RMSE and MAE. The results indicate that the practical advantage of quantum-assisted CT reconstruction lies in reserving quantum optimization for local refinement while using classical reconstruction to stabilize the global background.
Quadratic unconstrained binary optimization (QUBO)-based quantum computed tomography (CT) casts reconstruction as a binary quadratic problem for quantum annealing and hybrid quantum--classical solvers. For grayscale CT, however, image encoding is constrained by the binary-variable budget: fixed global bit-plane encodings increase QUBO size and coupling complexity as gray-level precision improves, whereas low-bit encodings introduce quantization error. We propose a QUBO-based grayscale CT reconstruction framework that combines dynamic interval encoding with prior-balanced optimization. Each refinement round encodes active pixels only within local gray-level intervals around the current estimate, and a boundary-hit-guided update rule adaptively switches between search expansion and local refinement. To improve optimization stability, the method balances projection-domain data consistency and an edge-preserving quadratic prior before forming the final QUBO. Sparse-view and limited-angle fan-beam CT experiments show that the proposed method recovers structures and gray-level distributions more faithfully than the evaluated analytic, iterative, variational, and representation-based baselines. Expressivity analysis and ablation studies further indicate that the improvement mainly arises from effective gray-level representation through dynamic local encoding and more stable data-fidelity--prior coupling. Experiments on the D-Wave hybrid binary quadratic model (BQM) solver further demonstrate that the formulation is executable on a hardware-backed hybrid quantum--classical backend.
Computed tomography (CT) is an important imaging technique used in medical analysis of the internal structure of the human body. Previously, image segmentation methods were required after acquiring reconstructed CT images to obtain segmented CT images which made it susceptible to errors from both reconstruction and segmentation algorithms. However, this paper introduces a new approach using an advanced quantum optimization algorithm called quadratic unconstrained binary optimization (QUBO) for CT image segmentation. This algorithm allows CT image reconstruction and segmentation to be performed simultaneously. This algorithm segments CT images by minimizing the difference between a sinogram in a superposition state with qubits, obtained using the mathematical projection including the Radon transform, and the experimentally acquired sinogram from X-ray images for various angles. Furthermore, we leveraged X-ray mass attenuation coefficients to reduce the number of logical qubits required for our quantum optimization algorithm, and we employed D-Wave's hybrid solver to solve the optimization problem. We compared the segmentation results of our algorithm with those of classical algorithms using X-ray images of actual tooth samples to validate the results of our algorithm. The comparison revealed that, after undergoing appropriate image post-processing, our algorithm's segmentation results matched those of classical algorithms that perform segmentation after reconstruction, except for some pixels at the boundary. We expect that the new quantum optimization CT algorithm will bring about great advancements in medical imaging.
Computed tomography (CT) is a non-destructive technique for observing internal images and has proven highly valuable in medical diagnostics. Recent advances in quantum computing have begun to influence tomographic reconstruction techniques. The quantum tomographic reconstruction algorithm is less affected by artifacts or noise than classical algorithms by using the square function of the difference between pixels obtained by projecting CT images in quantum superposition states and pixels obtained from experimental data. In particular, by using quantum linear systems, a fast quadratic unconstrained binary optimization (QUBO) model formulation for quantum tomographic reconstruction is possible. In this paper, we formulate the QUBO model for quantum compressed sensing tomographic reconstruction, which is a linear combination of the QUBO model for quantum tomographic reconstruction and the QUBO model for total variation in quantum superposition-state CT images. In our experiments, we used sinograms obtained by using the Radon transform of Shepp-Logan images and body CT images. We evaluate the performance of the new algorithm by reconstructing CT images using a hybrid solver with the QUBO model computed from each sinogram. The new algorithm was able to obtain a solution within 5 projection images for 30 × 30 image samples and within 6 projection images for 60 × 60 image samples, reconstructing error-free CT images. We anticipate that quantum compressed sensing tomographic reconstruction algorithms could significantly reduce the total radiation dose when quantum computing performance advances.
Computed tomography (CT) is an important diagnostic technique used to analyze the inner structure of the human body. Various reconstruction methods of CT images have been proposed and utilized for a long time. The existing optimization methods for CT reconstruction images, however, usually suffer from substantial computational complexities. To circumvent this difficulty, a quadratic unconstrained binary optimization (QUBO) model for fast and accurate reconstruction of CT images was recently developed. In this paper, we apply the QUBO model to the 15-by-15 sized Shepp-Logan phantom image sample of the largest computable image in the D-Wave Advantage System. Herein, we reconstructed the CT image of the QUBO model in the D-Wave system using a QPU solver and a hybrid solver. Here are our results.