Related papers: Quantum graph resonances by cut-off technique
This work deals with the scattering entropy of quantum graphs in many different circumstances. We first consider the case of the Shannon entropy and then the R\'enyi and Tsallis entropies, which are more adequate to study distinct…
The conductance of a quantum wire containing a single magnetic barrier is studied numerically by means of the recursive Greens function technique. For sufficiently strong and localized barriers, Fano - type reflection resonances are…
We consider the effects of plane-wave states scattering off finite graphs, as an approach to implementing single-qubit unitary operations within the continuous-time quantum walk framework of universal quantum computation. Four semi-infinite…
A state-of-the-art method that combines a quantum computational algorithm and machine learning, so-called quantum machine learning, can be a powerful approach for solving quantum many-body problems. However, the research scope in the field…
We study analytically as well as numerically the dynamics of a quantum map near a quantum resonance of an order q. The map is embedded into a continuous unitary transformation generated by a time-independent quasi-Hamiltonian. Such a…
Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…
In modern mathematical and theoretical physics various generalizations, in particular supersymmetric or quantum, of Riemann surfaces and complex algebraic curves play a prominent role. We show that such supersymmetric and quantum…
The main features of quantum computing are described in the framework of spin resonance methods. Stress is put on the fact that quantum computing is in itself nothing but a re-interpretation (fruitful indeed) of well-known concepts. The…
In a recent article, we have advanced a semiclassical theory of quantum circuits with discrete charge and electrical resistance. In this work, we present a few elementary applications of this theory. For the zero resistance, inductive…
On a finite connected metric graph, we establish upper bounds for the eigenvalues of the Laplacian. These bounds depend on the length, the Betti number, and the number of pendant vertices. For trees, these estimates are sharp. We also…
The current noisy intermediate-scale quantum (NISQ) era is characterized by substantial errors and noise, which limit the practical feasibility of deep, many-qubit circuits. To address these constraints, quantum circuit cutting has emerged…
We address the "inverse problem" for discrete geometry, which consists in determining whether, given a discrete structure of a type that does not in general imply geometrical information or even a topology, one can associate with it a…
Semiconductor quantum dots driven by the broadband radiation fields of nearby quantum point contacts provide an exciting new setting for probing dynamics in driven quantum systems at the nanoscale. We report on real-time charge-sensing…
We identify a set of quantum graphs with unique and precisely defined spectral properties called {\it regular quantum graphs}. Although chaotic in their classical limit with positive topological entropy, regular quantum graphs are…
We provide an exhaustive spectral analysis of the two-dimensional periodic square graph lattice with a magnetic field. We show that the spectrum consists of the Dirichlet eigenvalues of the edges and of the preimage of the spectrum of a…
The impressive pace of advance of quantum technology calls for robust and scalable techniques for the characterization and validation of quantum hardware. Quantum process tomography, the reconstruction of an unknown quantum channel from…
We present experiments in which self-assembled InAs quantum dots are coupled to a thin, suspended-beam GaAs resonator. The quantum dots are driven resonantly and the resonance fluorescence is detected. The narrow quantum-dot linewidths,…
We study the spectra of quantum graphs with the method of trace identities (sum rules), which are used to derive inequalities of Lieb-Thirring, Payne-P\'olya-Weinberger, and Yang types, among others. We show that the sharp constants of…
We present a theoretical analysis of a possible route for directly detecting Kondo resonances in local density of states (LDOS) of an interacting quantum dot. By very weakly couple a third and/or a fourth lead to a two-probe quantum dot and…
We show that all scaling quantum graphs are explicitly integrable, i.e. any one of their spectral eigenvalues $E_n$ is computable analytically, explicitly, and individually for any given $n$. This is surprising, since quantum graphs are…