Search results for "asma"
showing 10 items of 4204 documents
Supervised Quantum Learning without Measurements
2017
We propose a quantum machine learning algorithm for efficiently solving a class of problems encoded in quantum controlled unitary operations. The central physical mechanism of the protocol is the iteration of a quantum time-delayed equation that introduces feedback in the dynamics and eliminates the necessity of intermediate measurements. The performance of the quantum algorithm is analyzed by comparing the results obtained in numerical simulations with the outcome of classical machine learning methods for the same problem. The use of time-delayed equations enhances the toolbox of the field of quantum machine learning, which may enable unprecedented applications in quantum technologies. The…
Superlinear advantage for exact quantum algorithms
2012
A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1). A key question is: how big is the advantage of exact quantum algorithms over their classical counterparts: deterministic algorithms. For total Boolean functions in the query model, the biggest known gap was just a factor of 2: PARITY of N inputs bits requires $N$ queries classically but can be computed with N/2 queries by an exact quantum algorithm. We present the first example of a Boolean function f(x_1, ..., x_N) for which exact quantum algorithms have superlinear advantage over the deterministic algorithms. Any deterministic algorithm that computes our function must use N qu…
Fractal surfaces from simple arithmetic operations
2015
Fractal surfaces ('patchwork quilts') are shown to arise under most general circumstances involving simple bitwise operations between real numbers. A theory is presented for all deterministic bitwise operations on a finite alphabet. It is shown that these models give rise to a roughness exponent $H$ that shapes the resulting spatial patterns, larger values of the exponent leading to coarser surfaces.
Bootstrap validation of links of a minimum spanning tree
2018
We describe two different bootstrap methods applied to the detection of a minimum spanning tree obtained from a set of multivariate variables. We show that two different bootstrap procedures provide partly distinct information that can be highly informative about the investigated complex system. Our case study, based on the investigation of daily returns of a portfolio of stocks traded in the US equity markets, shows the degree of robustness and completeness of the information extracted with popular information filtering methods such as the minimum spanning tree and the planar maximally filtered graph. The first method performs a "row bootstrap" whereas the second method performs a "pair bo…
Centrality measures for networks with community structure
2016
Understanding the network structure, and finding out the influential nodes is a challenging issue in the large networks. Identifying the most influential nodes in the network can be useful in many applications like immunization of nodes in case of epidemic spreading, during intentional attacks on complex networks. A lot of research is done to devise centrality measures which could efficiently identify the most influential nodes in the network. There are two major approaches to the problem: On one hand, deterministic strategies that exploit knowledge about the overall network topology in order to find the influential nodes, while on the other end, random strategies are completely agnostic ab…
Dirac equation as a quantum walk over the honeycomb and triangular lattices
2018
A discrete-time Quantum Walk (QW) is essentially an operator driving the evolution of a single particle on the lattice, through local unitaries. Some QWs admit a continuum limit, leading to well-known physics partial differential equations, such as the Dirac equation. We show that these simulation results need not rely on the grid: the Dirac equation in $(2+1)$--dimensions can also be simulated, through local unitaries, on the honeycomb or the triangular lattice. The former is of interest in the study of graphene-like materials. The latter, we argue, opens the door for a generalization of the Dirac equation to arbitrary discrete surfaces.
Laplacian versus Adjacency Matrix in Quantum Walk Search
2015
A quantum particle evolving by Schr\"odinger's equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace's operator. In discrete space, this is replaced by the discrete or graph Laplacian, which gives rise to a continuous-time quantum walk. Besides this natural definition, some quantum walk algorithms instead use the adjacency matrix to effect the walk. While this is equivalent to the Laplacian for regular graphs, it is different for non-regular graphs, and is thus an inequivalent quantum walk. We algorithmically explore this distinction by analyzing search on the complete bipartite graph with multiple marked vertices, using both the Lapla…
Strongly interacting Fermi gases with density imbalance
2005
We consider density-imbalanced Fermi gases of atoms in the strongly interacting, i.e. unitarity, regime. The Bogoliubov-deGennes equations for a trapped superfluid are solved. They take into account the finite size of the system, as well as give rise to both phase separation and FFLO type oscillations in the order parameter. We show how radio-frequency spectroscopy reflects the phase separation, and can provide direct evidence of the FFLO-type oscillations via observing the nodes of the order parameter.
Robustness of Coherence: An Operational and Observable Measure of Quantum Coherence
2016
Quantifying coherence is an essential endeavour for both quantum foundations and quantum technologies. Here the robustness of coherence is defined and proven a full monotone in the context of the recently introduced resource theories of quantum coherence. The measure is shown to be observable, as it can be recast as the expectation value of a coherence witness operator for any quantum state. The robustness of coherence is evaluated analytically on relevant classes of states, and an efficient semidefinite program that computes it on general states is given. An operational interpretation is finally provided: the robustness of coherence quantifies the advantage enabled by a quantum state in a …
A minimal tight-binding model for the quasi-one-dimensional superconductor K2Cr3As3
2019
We present a systematic derivation of a minimal five-band tight-binding model for the description of the electronic structure of the recently discovered quasi one-dimensional superconductor K2Cr3As3. Taking as a reference the density-functional theory (DFT) calculation, we use the outcome of a Lowdin procedure to refine a Wannier projection and fully exploit the predominant weight at the Fermi level of the states having the same symmetry of the crystal structure. Such states are described in terms of five atomic-like d orbitals: four planar orbitals, two dxy and two dx2-y2, and a single out-of-plane one, dz2 . We show that this minimal model reproduces with great accuracy the DFT band struc…