Search results for "Quantum computer"
showing 10 items of 211 documents
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…
Molecular excited state calculations with adaptive wavefunctions on a quantum eigensolver emulation: reducing circuit depth and separating spin states
2021
Ab initio electronic excited state calculations are necessary for the quantitative study of photochemical reactions, but their accurate computation on classical computers is plagued by prohibitive resource scaling. The Variational Quantum Deflation (VQD) is an extension of the quantum-classical Variational Quantum Eigensolver (VQE) algorithm for calculating electronic excited state energies, and has the potential to address some of these scaling challenges using quantum computers. However, quantum computers available in the near term can only support a limited number of quantum circuit operations, so reducing the quantum computational cost in VQD methods is critical to their realisation. In…
Nonlocality threshold for entanglement under general dephasing evolutions: A case study
2015
Determining relationships between different types of quantum correlations in open composite quantum systems is important since it enables the exploitation of a type by knowing the amount of another type. We here review, by giving a formal demonstration, a closed formula of the Bell function, witnessing nonlocality, as a function of the concurrence, quantifying entanglement, valid for a system of two noninteracting qubits initially prepared in extended Werner-like states undergoing any local pure-dephasing evolution. This formula allows for finding nonlocality thresholds for the concurrence depending only on the purity of the initial state. We then utilize these thresholds in a paradigmatic …
Peptides as Versatile Platforms for Quantum Computing
2018
The pursuit of novel functional building blocks for the emerging field of quantum computing is one of the most appealing topics in the context of quantum technologies. Herein we showcase the urgency of introducing peptides as versatile platforms for quantum computing. In particular, we focus on lanthanide-binding tags, originally developed for the study of protein structure. We use pulsed electronic paramagnetic resonance to demonstrate quantum coherent oscillations in both neodymium and gadolinium peptidic qubits. Calculations based on density functional theory followed by a ligand field analysis indicate the possibility of influencing the nature of the spin qubit states by means of contro…
Quantum inductive inference by finite automata
2008
AbstractFreivalds and Smith [R. Freivalds, C.H. Smith Memory limited inductive inference machines, Springer Lecture Notes in Computer Science 621 (1992) 19–29] proved that probabilistic limited memory inductive inference machines can learn with probability 1 certain classes of total recursive functions, which cannot be learned by deterministic limited memory inductive inference machines. We introduce quantum limited memory inductive inference machines as quantum finite automata acting as inductive inference machines. These machines, we show, can learn classes of total recursive functions not learnable by any deterministic, nor even by probabilistic, limited memory inductive inference machin…
Quantum computing with molecular spin systems
2009
Molecular spintronics promises to combine the flexibility offered by synthetic chemistry with the advantages of an electronics which is based on the electron spin rather than its charge degree of freedom. Here, we review recent work on the description of transport across molecular spin systems and on a proposal for an all-electrical scheme for the implementation of a fundamental two-qubit gate in a certain class of molecular systems.
Cryogenic nanoelectromechanical switch enabled by Bi2Se3 nanoribbons
2022
Abstract Nanoelectromechanical (NEM) switches are potential candidates for memory and logic devices for low standby-current and harsh environment applications. Cryogenic operation of these devices would allow to use them, e.g., in space probes and in conjunction with quantum computers. Herein, it is demonstrated that cryogenic application requirements such as good flexibility and conductivity are satisfied by using Bi2Se3 nanoribbons as active elements in NEM switches. Experimental proof of principle NEM switching at temperatures as low as 5 K is achieved in volatile and non-volatile reversible regimes, exhibiting distinct ON and OFF states, backed by theoretical modelling. The results open…
Efficient protocol for qubit initialization with a tunable environment
2017
We propose an efficient qubit initialization protocol based on a dissipative environment that can be dynamically adjusted. Here the qubit is coupled to a thermal bath through a tunable harmonic oscillator. On-demand initialization is achieved by sweeping the oscillator rapidly into resonance with the qubit. This resonant coupling with the engineered environment induces fast relaxation to the ground state of the system, and a consecutive rapid sweep back to off resonance guarantees weak excess dissipation during quantum computations. We solve the corresponding quantum dynamics using a Markovian master equation for the reduced density operator of the qubit-bath system. This allows us to optim…
Exact results for accepting probabilities of quantum automata
2001
One of the properties of Kondacs-Watrous model of quantum finite automata (QFA) is that the probability of the correct answer for a QFA cannot be amplified arbitrarily. In this paper, we determine the maximum probabilities achieved by QFAs for several languages. In particular, we show that any language that is not recognized by an RFA (reversible finite automaton) can be recognized by a QFA with probability at most 0.7726...
Suppression law of quantum states in a 3D photonic fast Fourier transform chip
2015
The identification of phenomena able to pinpoint quantum interference is attracting large interest. Indeed, a generalization of the Hong–Ou–Mandel effect valid for any number of photons and optical modes would represent an important leap ahead both from a fundamental perspective and for practical applications, such as certification of photonic quantum devices, whose computational speedup is expected to depend critically on multi-particle interference. Quantum distinctive features have been predicted for many particles injected into multimode interferometers implementing the Fourier transform over the optical modes. Here we develop a scalable approach for the implementation of the fast Fouri…