Engineering Papers⌕ Search

Engineering topics

Sone, Akira

Publications and source records attributed to Sone, Akira.

Inference-Based Quantum Sensing

In a standard quantum sensing (QS) task one aims at estimating an unknown parameter θ, encoded into an n-qubit probe state, via measurements of the system. The success of this task hinges on the ability to correlate changes in the parameter to changes in the system response $\mathscr{R}$⁡(θ) (i.e., changes in the measurement outcomes). For simple cases the form of $\mathscr{R}$⁡(θ) is known, but the same cannot be said for realistic scenarios, as no general closed-form expression exists. Here, in this Letter, we present an inference-based scheme for QS. We show that, for a general class of unitary families of encoding, $\mathscr{R}$⁡(θ) can be fully characterized by only measuring the system response at 2⁢n+1 parameters. This allows us to infer the value of an unknown parameter given the measured response, as well as to determine the sensitivity of the scheme, which characterizes its overall performance. We show that inference error is, with high probability, smaller than δ, if one measures the system response with a number of shots that scales only as Ω⁢(log 3 ⁡(n)/δ 2 ). Furthermore, the framework presented can be broadly applied as it remains valid for arbitrary probe states and measurement schemes, and, even holds in the presence of quantum noise. We also discuss how to extend our results beyond unitary families. Finally, to showcase our method we implement it for a QS task on real quantum hardware, and in numerical simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum computational phase transition in combinatorial problems

Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical computers, without a proof that bounded-error quantum polynomial time (BQP) ≠ nondeterministic polynomial time (NP), it is necessary to investigate the empirical advantages of QAOA. We identify a computational phase transition of QAOA when solving hard problems such as SAT—random instances are most difficult to train at a critical problem density. We connect the transition to the controllability and the complexity of QAOA circuits. Moreover, we find that the critical problem density in general deviates from the SAT-UNSAT phase transition, where the hardest instances for classical algorithms lies. Then, we show that the high problem density region, which limits QAOA’s performance in hard optimization problems (reachability deficits), is actually a good place to utilize QAOA: its approximation ratio has a much slower decay with the problem density, compared to classical approximate algorithms. Indeed, it is exactly in this region that quantum advantages of QAOA over classical approximate algorithms can be identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗