paper-with-me

Papers

Hybrid adiabatic quantum computing for tomographic image reconstruction -- opportunities and limitations

2022-12-02 · Merlin A. Nau, A. Hans Vija, Wesley Gohn, Maximilian P. Reymann, Andreas K. Maier

Our goal is to reconstruct tomographic images with few measurements and a low signal-to-noise ratio. In clinical imaging, this helps to improve patient comfort and reduce radiation exposure. As quantum computing advances, we propose to use an adiabatic quantum computer and associated hybrid methods to solve the reconstruction problem. Tomographic reconstruction is an ill-posed inverse problem. We test our reconstruction technique for image size, noise content, and underdetermination of the measured projection data. We then present the reconstructed binary and integer-valued images of up to 32 by 32 pixels. The demonstrated method competes with traditional reconstruction algorithms and is superior in terms of robustness to noise and reconstructions from few projections. We postulate that hybrid quantum computing will soon reach maturity for real applications in tomographic reconstruction. Finally, we point out the current limitations regarding the problem size and interpretability of the algorithm.

📄 PDF Abstract BibTeX arXiv:2212.01312

Code (0)

등록된 구현이 없습니다.

Tasks

Image Reconstruction

Methods 이 논문이 사용한 방법론

Test 설명 없음

Similar Papers 제목 키워드 기반

Adiabatic Quantum Computing for Binary Clustering

2017-06-17 · Christian Bauckhage, Eduardo Brito, Kostadin Cvejoski, Cesar Ojeda 외

Quantum computing for machine learning attracts increasing attention and recent technological developments suggest that especially adiabatic quantum computing may soon be of practical interest. In this paper, we therefor…

BIG-bench Machine LearningClustering

Adiabatic Quantum Graph Matching with Permutation Matrix Constraints

2021-07-08 · Marcel Seelbach Benkner, Vladislav Golyanik, Christian Theobalt, Michael Moeller

Matching problems on 3D shapes and images are challenging as they are frequently formulated as combinatorial quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. In this work, we a…

Graph Matchingvalid

Hard instance learning for quantum adiabatic prime factorization

2021-10-10 · Jian Lin, Zhengfeng Zhang, Junping Zhang, Xiaopeng Li

Prime factorization is a difficult problem with classical computing, whose exponential hardness is the foundation of Rivest-Shamir-Adleman (RSA) cryptography. With programmable quantum devices, adiabatic quantum computin…

Deep Reinforcement LearningReinforcement Learning (RL)Transfer Learning

Training Neural Networks with Universal Adiabatic Quantum Computing

2023-08-24 · Steve Abel, Juan Carlos Criado, Michael Spannowsky

The training of neural networks (NNs) is a computationally intensive task requiring significant time and resources. This paper presents a novel approach to NN training using Adiabatic Quantum Computing (AQC), a paradigm …

Adiabatic Quantum Optimization Fails to Solve the Knapsack Problem

2020-08-17 · Lauren Pusey-Nazzaro, Prasanna Date

In this work, we attempt to solve the integer-weight knapsack problem using the D-Wave 2000Q adiabatic quantum computer. The knapsack problem is a well-known NP-complete problem in computer science, with applications in …