Related papers: Spectroscopic estimation of the photon number for …
Quantum annealing (QA) is an algorithm to find the ground state of the problem Hamiltonian by using an adiabatic time evolution. An approach to evaluate adiabaticity in the experiment by applying spectroscopic techniques has recently been…
Kerr parametric oscillators (KPOs) implemented in the circuit QED architecture can operate as qubits. Their applications to quantum annealing and universal quantum computation have been studied intensely. For these applications, the readout…
A method of quantum annealing (QA) using Kerr-nonlinear parametric oscillators (KPOs) was proposed. This method is described by bosonic operators and has different characteristics from QA based on the transverse-field Ising model. As the…
Quantum annealing provides a promising way to solve combinational optimization problems where the solutions correspond to the ground state of the Ising Hamiltonian. We can implement quantum annealing using the Kerr non-linear resonators,…
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…
Quantum computers are ideal for solving chemistry problems due to their polynomial scaling with system size in contrast to classical computers which scale exponentially. Until now molecular energy calculations using quantum computing…
Quantum computers with Kerr-nonlinear parametric oscillators (KPOs) have recently been proposed by the author and others. Quantum computation using KPOs is based on quantum adiabatic bifurcations of the KPOs, which lead to quantum…
Quantum annealing aims to solve combinatorial optimization problems mapped on to Ising interactions between quantum spins. A critical factor that limits the success of a quantum annealer is its sensitivity to noise, and intensive research…
Quantum annealers can solve QUBO problems efficiently but struggle with continuous optimization tasks like regression due to their discrete nature. We introduce Quadratic Continuous Quantum Optimization (QCQO), an anytime algorithm that…
A two-dimensional array of Kerr-nonlinear parametric oscillators (KPOs) with local four-body interactions is a promising candidate for realizing an Ising machine with all-to-all spin couplings, based on adiabatic quantum computation in the…
We study parametric oscillations of two capacitively coupled Kerr parametric oscillators (KPOs) with frequency-chirped two- and one-photon drives. The two-KPO system adiabatically evolves from the initial vacuum state to an oscillation…
We revisit the idea of quantum nondemolition measurement (QND) of optical quanta via a resonantly enhanced Kerr nonlinearity taking into account quantum back action and show that the monolithic microcavities enable QND measurement of number…
Kerr parametric oscillators (KPOs) can stabilize the superpositions of coherent states, which can be utilized as qubits, and are promising candidates for realizing hardware-efficient quantum computers. Although elementary gates for…
Quantum annealing is a powerful tool for solving and approximating combinatorial optimization problems such as graph partitioning, community detection, centrality, routing problems, and more. In this paper we explore the use of quantum…
Quantum nondemolition (QND) measurements of photons is a much pursued endeavor in the field of quantum optics and quantum information processing. Here we propose a novel hybrid optoelectromechanical platform that integrates a cavity system…
Quantum information offers the promise of being able to perform certain communication and computation tasks that cannot be done with conventional information technology (IT). Optical Quantum Information Processing (QIP) holds particular…
Extracting information from weak optical signals is a critical challenge across a broad range of technologies. Conventional imaging techniques, constrained to integrating over detected signals and classical post-processing, are limited in…
Linear optics with photon counting is a prominent candidate for practical quantum computing. The protocol by Knill, Laflamme, and Milburn [Nature 409, 46 (2001)] explicitly demonstrates that efficient scalable quantum computing with single…
Quantum machine learning with variational quantum algorithms (VQA) has been actively investigated as a practical algorithm in the noisy intermediate-scale quantum (NISQ) era. Recent researches reveal that the data reuploading, which…
Quantum computers are expected to be able to solve mathematical problems that cannot be solved using conventional computers. Many of these problems are of practical importance, especially in the areas of cryptography and secure…