Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuantum Permutation Synchronization
441
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We present QuantumSync, the first quantum algorithm for solving a synchronization problem in the context of computer vision. In particular, we focus on permutation synchronization which involves solving a non-convex optimization problem in discrete variables. We start by formulating synchronization into a quadratic unconstrained binary optimization problem (QUBO). While such formulation respects the binary nature of the problem, ensuring that the result is a set of permutations requires extra care. Hence, we: (i) show how to insert permutation constraints into a QUBO problem and (ii) solve the constrained QUBO problem on the current generation of the adiabatic quantum computers D-Wave. Thanks to the quantum annealing, we guarantee global optimality with high probability while sampling the energy landscape to yield confidence estimates. Our proof-of-concepts realization on the adiabatic D-Wave computer demonstrates that quantum machines offer a promising way to solve the prevalent yet difficult synchronization problems.
rate research
Read More
We employ a quantum trajectory approach to characterize synchronization and phase-locking between open quantum systems in nonequilibrium steady states. We exemplify our proposal for the paradigmatic case of two quantum Van der Pol oscillators interacting through dissipative coupling. We show the deep impact of synchronization on the statistics of phase-locking indicators and other correlation measures defined for single trajectories, spotting a link between the presence of synchronization and the emergence of large tails in the probability distribution for the entanglement along trajectories. Our results shed new light on fundamental issues regarding quantum synchronization providing new methods for its precise quantification.
Quantum error mitigation (QEM) is a class of promising techniques capable of reducing the computational error of variational quantum algorithms tailored for current noisy intermediate-scale quantum computers. The recently proposed permutation-based methods are practically attractive, since they do not rely on any a priori information concerning the quantum channels. In this treatise, we propose a general framework termed as permutation filters, which includes the existing permutation-based methods as special cases. In particular, we show that the proposed filter design algorithm always converge to the global optimum, and that the optimal filters can provide substantial improvements over the existing permutation-based methods in the presence of narrowband quantum noise, corresponding to large-depth, high-error-rate quantum circuits.
Macroscopic ensembles of radiating dipoles are ubiquitous in the physical and natural sciences. In the classical limit the dipoles can be described as damped-driven oscillators, which are able to spontaneously synchronize and collectively lock their phases. Here we investigate the correspond- ing phenomenon in the quantum regime with arrays of quantized two-level systems coupled via long-range and anisotropic dipolar interactions. Our calculations demonstrate that the dipoles may overcome the decoherence induced by quantum fluctuations and inhomogeneous couplings and evolve to a synchronized steady-state. This steady-state bears much similarity to that observed in classical systems, and yet also exhibits genuine quantum properties such as quantum correlations and quan- tum phase diffusion (reminiscent of lasing). Our predictions could be relevant for the development of better atomic clocks and a variety of noise tolerant quantum devices.
We study synchronization in a two-node network built out of the smallest possible self-sustained oscillator: a spin 1. We first demonstrate that phase locking between the quantum oscillators can be achieved, even for limit cycles that cannot be synchronized to an external semi-classical signal. Building upon the analytical description of the system, we then clarify the relation between quantum synchronization and the generation of entanglement. These findings establish the spin-based architecture as a promising platform for understanding synchronization in complex quantum networks.
We study the quantum synchronization between a pair of two-level systems inside two coupled cavities. By using a digital-analog decomposition of the master equation that rules the system dynamics, we show that this approach leads to quantum synchronization between both two-level systems. Moreover, we can identify in this digital-analog block decomposition the fundamental elements of a quantum machine learning protocol, in which the agent and the environment (learning units) interact through a mediating system, namely, the register. If we can additionally equip this algorithm with a classical feedback mechanism, which consists of projective measurements in the register, reinitialization of the register state and local conditional operations on the agent and environment subspace, a powerful and flexible quantum machine learning protocol emerges. Indeed, numerical simulations show that this protocol enhances the synchronization process, even when every subsystem experience different loss/decoherence mechanisms, and give us the flexibility to choose the synchronization state. Finally, we propose an implementation based on current technologies in superconducting circuits.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
