Adiabatic Quantum Computing for Solving the Multi-Target Data Association Problem

Author(s):  
Felix Govaers ◽  
Veit Stoob ◽  
Martin Ulmke
2021 ◽  
Vol 15 (2) ◽  
Author(s):  
Narendra N. Hegade ◽  
Koushik Paul ◽  
Yongcheng Ding ◽  
Mikel Sanz ◽  
F. Albarrán-Arriagada ◽  
...  

2009 ◽  
Vol 9 (5&6) ◽  
pp. 487-499
Author(s):  
S.S. Bullock ◽  
D.P. O'Leary

In this paper, we study the complexity of Hamiltonians whose groundstate is a stabilizer code. We introduce various notions of $k$-locality of a stabilizer code, inherited from the associated stabilizer group. A choice of generators leads to a Hamiltonian with the code in its groundspace. We establish bounds on the locality of any other Hamiltonian whose groundspace contains such a code, whether or not its Pauli tensor summands commute. Our results provide insight into the cost of creating an energy gap for passive error correction and for adiabatic quantum computing. The results simplify in the cases of XZ-split codes such as Calderbank-Shor-Steane stabilizer codes and topologically-ordered stabilizer codes arising from surface cellulations.


Sensors ◽  
2019 ◽  
Vol 19 (3) ◽  
pp. 741 ◽  
Author(s):  
Sufyan Memon ◽  
Myungun Kim ◽  
Hungsun Son

Tracking problems, including unknown number of targets, target trajectories behaviour and uncertain motion of targets in the surveillance region, are challenging issues. It is also difficult to estimate cross-over targets in heavy clutter density environment. In addition, tracking algorithms including smoothers which use measurements from upcoming scans to estimate the targets are often unsuccessful in tracking due to low detection probabilities. For efficient and better tracking performance, the smoother must rely on backward tracking to fetch measurement from future scans to estimate forward track in the current time. This novel idea is utilized in the joint integrated track splitting (JITS) filter to develop a new fixed-interval smoothing JITS (FIsJITS) algorithm for tracking multiple cross-over targets. The FIsJITS initializes tracks employing JITS in two-way directions: Forward-time moving JITS (fJITS) and backward-time moving JITS (bJITS). The fJITS acquires the bJITS predictions when they arrive from future scans to the current scan for smoothing. As a result, the smoothing multi-target data association probabilities are obtained for computing the fJITS and smoothing output estimates. This significantly improves estimation accuracy for multiple cross-over targets in heavy clutter. To verify this, numerical assessments of the FIsJITS are tested and compared with existing algorithms using simulations.


2015 ◽  
Vol 17 (4) ◽  
pp. 2742-2749 ◽  
Author(s):  
Satoru Yamamoto ◽  
Shigeaki Nakazawa ◽  
Kenji Sugisaki ◽  
Kazunobu Sato ◽  
Kazuo Toyota ◽  
...  

Molecular spin QCs for adiabatic quantum computing: a phthalocyanine derivative with three electron qubits and a glutaconic acid radical with one electron bus qubit and two nuclear client qubits.


Sign in / Sign up

Export Citation Format

Share Document