Related papers: Microwave Experiments Simulating Quantum Search an…
Matched filtering is a common method for detecting gravitational waves. However, the computational costs of searching large template banks limit the efficiency of classical algorithms when searching for massive black hole binary (MBHB)…
Quantum computing has noteworthy speedup over classical computing by taking advantage of quantum parallelism, i.e., the superposition of states. In particular, quantum search is widely used in various computationally hard problems. Grover's…
An efficient computational methodology is used to explore charge transport properties in chemically-modified (and randomly disordered) graphene-based materials. The Hamiltonians of various complex forms of graphene are constructed using…
Continuous gravitational waves signals, emitted by asymmetric spinning neutron stars, are among the main targets of current detectors like Advanced LIGO and Virgo. In the case of sources, like pulsars, which rotational parameters are…
The search for "a quantum needle in a quantum haystack" is a metaphor for the problem of finding out which one of a permissible set of unitary mappings---the oracles---is implemented by a given black box. Grover's algorithm solves this…
We propose GravNet (Global detector network to search for high-frequency gravitational waves), a novel experimental scheme enabling the search for gravitational waves in the MHz to GHz frequency range. Such high-frequency gravitational…
Theoretical progress in graphene physics has largely relied on the application of a simple nearest-neighbor tight-binding model capable of predicting many of the electronic properties of this material. However, important features that…
The execution of Grover's quantum search algorithm needs rather limited resources without much fine tuning. Consequently, the algorithm can be implemented in a variety of physical set-ups, which involve wave dynamics but may not need other…
Gravitational-wave data analysis is rapidly absorbing techniques from deep learning, with a focus on convolutional networks and related methods that treat noisy time series as images. We pursue an alternative approach, in which waveforms…
Quantum robots are described as mobile quantum computers and ancillary systems that move in and interact with arbitrary environments. Their dynamics is given as tasks which consist of sequences of alternating computation and action phases.…
Quantum search on the two-dimensional lattice with one marked vertex and cyclic boundary conditions is an important problem in the context of quantum algorithms with an interesting unfolding. It avails to test the ability of quantum walk…
We present a general scheme to realize a cold-atom quantum simulator of bidimensional atomic crystals. Our model is based on the use of two independently trapped atomic species: the first one, subject to a strong in-plane confinement,…
Kronecker graphs, obtained by repeatedly performing the Kronecker product of the adjacency matrix of an "initiator" graph with itself, have risen in popularity in network science due to their ability to generate complex networks with…
Large scale numerical experiments are commonplace today in theoretical physics. The high performance algorithms described herein are the most compact, efficient methods known for representing and analyzing systems modeled well by sets or…
The Grover search algorithm performs an unstructured search of a marked item in a database quadratically faster than classical algorithms and is shown to be optimal. Here, we show that if the search space is divided into two blocks with the…
Graphene provides a fascinating testbed for new physics and exciting opportunities for future applications based on quantum phenomena. To understand the coherent flow of electrons through a graphene device, we employ a nanoscale probe that…
We utilize degenerate perturbation theory to investigate continuous-time quantum search on second-order truncated simplex lattices. In this work, we show that the construction of the Hamiltonian must consider the structure of the lattice.…
Spatial search is the problem of finding a marked vertex in a graph. A continuous-time quantum walk in the single-excitation subspace of an $n$ spin system solves the problem of spatial search by finding the marked vertex in $O(\sqrt{n})$…
A quantum algorithm for combinatorial search is presented that provides a simple framework for utilizing search heuristics. The algorithm is evaluated in a new case that is an unstructured version of the graph coloring problem. It performs…
We study transport length scales in carbon nanotubes and graphene ribbons under the influence of Anderson disorder. We present generalized analytical expressions for the density of states, the elastic mean free path and the localization…