Related papers: A new algorithm for automatic photopeak searches
In gamma ray imaging, a scintillation crystal is typically used to convert the gamma radiation into visible light. Photosensors are used to transform this light into measurable signals. Several types of photosensors are currently in use…
Scaling properties of gamma-spectra recorded by semiconductor detectors are investigated. For practical purposes the method of simulation multicomponent spectra using single experimental spectrum are suggested.
Photoreflectance is used for the characterisation of semiconductor samples, usually by sweeping the monochromatized probe beam within the energy range comprised between the highest value set by the pump beam and the lowest absorption…
We consider detecting objects in an image by iteratively selecting from a set of arbitrarily shaped candidate regions. Our generic approach, which we term visual chunking, reasons about the locations of multiple object instances in an image…
A novel photonics-assisted method based on presampling and MDA technique is proposed for significantly improving the frequency estimation precision without introducing other complex algorithms. This method is also compatible with existing…
We propose a model for computing of a certain set of analytical functions based on estimating the output distribution of multiphoton outcomes in an optical scheme with an initial single-mode squeezed vacuum (SMSV) state and photonic states…
Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel…
Enormous activity in the Quantum Computing area has resulted in considering them to solve different difficult problems, including those of applied nature, together with classical computers. An attempt is made in this work to nail down a…
Magnetic Bright Points (MBPs) in the internetwork are among the smallest objects in the solar photosphere and appear bright against the ambient environment. An algorithm is presented that can be used for the automated detection of the MBPs…
Recent advances in artificial intelligence (AI) and quantum computing are accelerating automation in scientific and engineering processes, fundamentally reshaping research methodologies. This perspective highlights parallels between…
In this paper, we propose a resources-optimal linear-optical scheme for quantum nondemolition detection of single-photon presence. By measuring the state of ancillary photons, the presence of a photon in signal mode is revealed with a…
A framework is presented for the design and analysis of quantum mechanical algorithms, the sqrt(N) step quantum search algorithm is an immediate consequence of this framework. It leads to several other search-type applications - several…
In this paper we present a novel quantum algorithm, namely the quantum grid search algorithm, to solve a special search problem. Suppose $ k $ non-empty buckets are given, such that each bucket contains some marked and some unmarked items.…
Over the past 30 years, numerous large-scale photometric astronomical surveys have been conducted, including SDSS, Pan-STARRS, Gaia,2MASS, WISE, and others. These surveys provide extensive photometric measurements that can be used to infer…
The maximal clique problem, to find the maximally sized clique in a given graph, is classically an NP-complete computational problem, which has potential applications ranging from electrical engineering, computational chemistry,…
In neutral atom quantum computers, readout and preparation of the atomic qubits are usually based on fluorescence imaging and subsequent analysis of the acquired image. For each atom site, the brightness or some comparable metric is…
The quantum SearchRank algorithm is a promising tool for a future quantum search engine based on PageRank quantization. However, this algorithm loses its functionality when the $N/M$ ratio between the network size $N$ and the number of…
Continuous-time quantum walks provide a natural framework to tackle the fundamental problem of finding a node among a set of marked nodes in a graph, known as spatial search. Whether spatial search by continuous-time quantum walk provides a…
Anytime heuristic search algorithms try to find a (potentially suboptimal) solution as quickly as possible and then work to find better and better solutions until an optimal solution is obtained or time is exhausted. The most widely-known…
Characterization of quantum processes is a preliminary step necessary in the development of quantum technology. The conventional method uses standard quantum process tomography, which requires $d^2$ input states and $d^4$ quantum…