filter diagonalization
Recently Published Documents


TOTAL DOCUMENTS

114
(FIVE YEARS 5)

H-INDEX

30
(FIVE YEARS 1)

Author(s):  
Ricardo Macías-Quijas ◽  
Ramiro Velázquez ◽  
Roberto De Fazio ◽  
Paolo Visconti ◽  
Nicola Ivan Giannoccaro ◽  
...  

This paper introduces a compact, affordable electronic nose (e-nose) device devoted to detect the presence of toxic compounds that could affect human health, such as carbon monoxide, combustible gas, hydrogen, methane, and smoke, among others. Such artificial olfaction device consists of an array of six metal oxide semiconductor (MOS) sensors and a computer-based information system for signal acquisition, processing, and visualization. This study further proposes the use of the filter diagonalization method (FDM) to extract the spectral contents of the signals obtained from the sensors. Preliminary results show that the prototype is functional and that the FDM approach is suitable for a later classification stage. Example deployment scenarios of the proposed e-nose include indoor facilities (buildings and warehouses), compromised air quality places (mines and sanitary landfills), public transportation, mobile robots, and wireless sensor networks.


PRX Quantum ◽  
2021 ◽  
Vol 2 (4) ◽  
Author(s):  
Jeffrey Cohn ◽  
Mario Motta ◽  
Robert M. Parrish

2021 ◽  
Vol 11 (2) ◽  
Author(s):  
David J. Luitz

Periodically driven quantum many-body systems play a central role for our understanding of nonequilibrium phenomena. For studies of quantum chaos, thermalization, many-body localization and time crystals, the properties of eigenvectors and eigenvalues of the unitary evolution operator, and their scaling with physical system size LL are of interest. While for static systems, powerful methods for the partial diagonalization of the Hamiltonian were developed, the unitary eigenproblem remains daunting. % In this paper, we introduce a Krylov space diagonalization method to obtain exact eigenpairs of the unitary Floquet operator with eigenvalue closest to a target on the unit circle. Our method is based on a complex polynomial spectral transformation given by the geometric sum, leading to rapid convergence of the Arnoldi algorithm. We demonstrate that our method is much more efficient than the shift invert method in terms of both runtime and memory requirements, pushing the accessible system sizes to the realm of 20 qubits, with Hilbert space dimensions \geq 10^6≥106.


Author(s):  
Moritz Kreutzer ◽  
Dominik Ernst ◽  
Alan R. Bishop ◽  
Holger Fehske ◽  
Georg Hager ◽  
...  

2016 ◽  
Vol 325 ◽  
pp. 226-243 ◽  
Author(s):  
Andreas Pieper ◽  
Moritz Kreutzer ◽  
Andreas Alvermann ◽  
Martin Galgon ◽  
Holger Fehske ◽  
...  

2016 ◽  
Vol 116 (23) ◽  
pp. 1818-1821
Author(s):  
Thomas Markovich ◽  
Samuel M. Blau ◽  
Jacob N. Sanders ◽  
Alán Aspuru-Guzik

Sign in / Sign up

Export Citation Format

Share Document