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

The Japan Society of Applied Physics

Approximated quantum computing and its application for near-term quantum devices

Keisuke Fujii

Published Feb 8, 2018• 0 citations
OpenAlex

Related papers

Quantum Computing on near term devices

Alessandro Baroni

•Feb 21, 2024•0 citations

Approximation in Quantum Computing

Leonhard Kunczik

Springer eBooks•Jan 1, 2022•0 citations

Variational Parameter Optimization of Quantum-classical Hybrid Heuristics on Near-term Quantum Computer

Tsukasa Miki, Daisuke Tsukayama, Ryo Okita +2 more

Currently available quantum processors are noisy intermediate-scale quantum (NISQ) devices. The variational quantum eigensolver (VQE) is an algorithm that is closer to near-term applicability due to lower quantum hardware requirements. In VQE, trial states with variational parameters are prepared by quantum computers, and the optimal parameters are determined by a classical optimizer. This optimization is known to be an NP-hard problem. In this work, we make a comparison between various gradient-free optimizers in terms of approximation ratio and function evaluations. As a result, we find that COBYLA method is the best to find the approximated solution with a lower number of executions of quantum computers.

IEEE International Conference on Manipulation, Manufacturing and Measurement on the Nanoscale (3M-NANO)•Aug 8, 2022•3 citations

Near-Term Stepping Stones on the Path to Useful Quantum Computing

Abigail McClain Gomez

In 2000, David P. DiVincenzo proposed seven necessary criteria to construct a physical quantum computer. His requirements included device scalability, having well-defined qubits with long coherence times, and the ability to implement a universal gate set. Since then, research has propelled several experimental platforms to the forefront as contenders for quantum computing. The near-term implementations of these various architectures often face technical challenges -- such as limited scalability, short coherence times, or sub-universal computation -- leading to only a partial fulfillment of DiVincenzo's criteria. Despite device shortcomings, progress marches forward with increasingly useful demonstrations of quantum computation and simulation. Towards this end, the research compiled in this thesis presents novel quantum computing methods and applications that can be leveraged in the current era of constrained hardware capabilities. This thesis examines a diverse array of near-term topics, including the use of machine learning to aid in sample-efficient quantum state reconstruction via Born machines, methods to link distributed quantum simulators with incomplete information transfer for approximate fragmented simulation, universal computation with globally controlled analog simulators, and fast scrambling achieved with measurement-only quantum circuits.

•Jan 1, 2025•0 citations

Simplified Quantum Computing with Applications

Koji Nagata, Do Ngoc Diep, Ahmed Farouk +1 more

Institute of Physics eBooks•Jul 1, 2022•10 citations

Tabu-driven Quantum Neighborhood Samplers

Moussa, C., Wang, H., Calandra, H. +2 more

Combinatorial optimization is an important application targeted by quantum computing. However, near-term hardware constraints make quantum algorithms unlikely to be competitive when compared to high-performing classical heuristics on large practical problems. One option to achieve advantages with near-term devices is to use them in combination with classical heuristics. In particular, we propose using quantum methods to sample from classically intractable distributions -- which is the most probable approach to attain a true provable quantum separation in the near-term -- which are used to solve optimization problems faster. We numerically study this enhancement by an adaptation of Tabu Search using the Quantum Approximate Optimization Algorithm (QAOA) as a neighborhood sampler. We show that QAOA provides a flexible tool for exploration-exploitation in such hybrid settings and can provide evidence that it can help in solving problems faster by saving many tabu iterations and achieving better solutions.

•Jan 1, 2020•3 citations
Currently available quantum processors are noisy intermediate-scale quantum (NISQ) devices. The variational quantum eigensolver (VQE) is an algorithm that is closer to near-term applicability due to lower quantum hardware requirements. In VQE, trial states with variational parameters are prepared by quantum computers, and the optimal parameters are determined by a classical optimizer. This optimization is known to be an NP-hard problem. In this work, we make a comparison between various gradient-free optimizers in terms of approximation ratio and function evaluations. As a result, we find that COBYLA method is the best to find the approximated solution with a lower number of executions of quantum computers.
In 2000, David P. DiVincenzo proposed seven necessary criteria to construct a physical quantum computer. His requirements included device scalability, having well-defined qubits with long coherence times, and the ability to implement a universal gate set. Since then, research has propelled several experimental platforms to the forefront as contenders for quantum computing. The near-term implementations of these various architectures often face technical challenges -- such as limited scalability, short coherence times, or sub-universal computation -- leading to only a partial fulfillment of DiVincenzo's criteria. Despite device shortcomings, progress marches forward with increasingly useful demonstrations of quantum computation and simulation. Towards this end, the research compiled in this thesis presents novel quantum computing methods and applications that can be leveraged in the current era of constrained hardware capabilities. This thesis examines a diverse array of near-term topics, including the use of machine learning to aid in sample-efficient quantum state reconstruction via Born machines, methods to link distributed quantum simulators with incomplete information transfer for approximate fragmented simulation, universal computation with globally controlled analog simulators, and fast scrambling achieved with measurement-only quantum circuits.
Combinatorial optimization is an important application targeted by quantum computing. However, near-term hardware constraints make quantum algorithms unlikely to be competitive when compared to high-performing classical heuristics on large practical problems. One option to achieve advantages with near-term devices is to use them in combination with classical heuristics. In particular, we propose using quantum methods to sample from classically intractable distributions -- which is the most probable approach to attain a true provable quantum separation in the near-term -- which are used to solve optimization problems faster. We numerically study this enhancement by an adaptation of Tabu Search using the Quantum Approximate Optimization Algorithm (QAOA) as a neighborhood sampler. We show that QAOA provides a flexible tool for exploration-exploitation in such hybrid settings and can provide evidence that it can help in solving problems faster by saving many tabu iterations and achieving better solutions.