Search results for "Algorithm"
showing 10 items of 4887 documents
QSAR Analysis of Hypoglycemic Agents Using the Topological Indices
2001
The molecular topology model and discriminant analysis have been applied to the prediction of some pharmacological properties of hypoglycemic drugs using multiple regression equations with their statistical parameters. Regression analysis showed that the molecular topology model predicts these properties. The corresponding stability (cross-validation) studies performed on the selected prediction models confirmed the goodness of the fits. The method used for hypoglycemic activity selection was a linear discriminant analysis (LDA). We make use of the pharmacological distribution diagrams (PDDs) as a visualizing technique for the identification and selection of new hypoglycemic agents, and we …
Properties and application of nondeterministic quantum query algorithms
2006
Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact, zero-error, bounded-error and even nondeterministic. In this paper, we study the latter class of algorithms. We introduce a fresh notion in addition to already studied nondeterministic algorithms and introduce dual nondeterministic quantum query algorithms. We examine properties of such algorithms and prove relations with exact and nondeterministic quantum query algorithm complexity. As a result and as an example of the application of discovered properties, we…
Distributed construction of quantum fingerprints
2003
Quantum fingerprints are useful quantum encodings introduced by Buhrman, Cleve, Watrous, and de Wolf (Physical Review Letters, Volume 87, Number 16, Article 167902, 2001; quant-ph/0102001) in obtaining an efficient quantum communication protocol. We design a protocol for constructing the fingerprint in a distributed scenario. As an application, this protocol gives rise to a communication protocol more efficient than the best known classical protocol for a communication problem.
Toward Pricing Financial Derivatives with an IBM Quantum Computer
2021
Pricing interest-rate financial derivatives is a major problem in finance, in which it is crucial to accurately reproduce the time evolution of interest rates. Several stochastic dynamics have been proposed in the literature to model either the instantaneous interest rate or the instantaneous forward rate. A successful approach to model the latter is the celebrated Heath-Jarrow-Morton framework, in which its dynamics is entirely specified by volatility factors. In its multifactor version, this model considers several noisy components to capture at best the dynamics of several time-maturing forward rates. However, as no general analytical solution is available, there is a trade-off between t…
Quantum algorithm complexity
2008
Elektroniskā versija nesatur pielikumus
Unveiling the Effect of Magnetic Noise in the Coherence of Single-Molecule Quantum Processors.
2019
Quantum bits (qubits) constitute the most elementary building-blocks of any quantum technology, where information is stored and processed in the form of quantum superpositions between discrete energy levels. In particular, the fabrication of quantum processors is a key long-term goal that will allow us conducting specific tasks much more efficiently than the most powerful classical computers can do. Motivated by recent experiments in which three addressable spin qubits are defined on a potential single-molecule quantum processor, namely the [Gd(H2O)P5W30O110]12− polyoxometalate, we investigate the decohering effect of magnetic noise on the encoded quantum information. Our state-of-the-art m…
Unveiling two-dimensional discrete quantum walks dynamics via dispersion relations
2011
The discrete, or coined, quantum walk (QW) [1] is a process originally introduced as the quantum counterpart of the classical random walk (RW). In both cases there is a walker and a coin: at every time step the coin is tossed and the walker moves depending on the toss output. Unlike the RW, in the QW the walker and coin are quantum in nature what allows the coherent superpositions right/left and head/tail happen. This feature endows the QW with outstanding properties, such as making the standard deviation of the position of an initially localized walker grow linearly with time t, unlike the RW in which this growth goes as t1/2. This has strong consequences in algorithmics and is one of the …
Phase transition of light on complex quantum networks
2012
Recent advances in quantum optics and atomic physics allow for an unprecedented level of control over light-matter interactions, which can be exploited to investigate new physical phenomena. In this work we are interested in the role played by the topology of quantum networks describing coupled optical cavities and local atomic degrees of freedom. In particular, using a mean-field approximation, we study the phase diagram of the Jaynes-Cummings-Hubbard model on complex networks topologies, and we characterize the transition between a Mott-like phase of localized polaritons and a superfluid phase. We found that, for complex topologies, the phase diagram is non-trivial and well defined in the…
Grover’s Search with Faults on Some Marked Elements
2018
Grover’s algorithm is a quantum query algorithm solving the unstructured search problem of size [Formula: see text] using [Formula: see text] queries. It provides a significant speed-up over any classical algorithm [3]. The running time of the algorithm, however, is very sensitive to errors in queries. Multiple authors have analysed the algorithm using different models of query errors and showed the loss of quantum speed-up [2, 6]. We study the behavior of Grover’s algorithm in the model where the search space contains both faulty and non-faulty marked elements. We show that in this setting it is indeed possible to find one of marked elements in [Formula: see text] queries. We also analyze…
Recent Developments in Quantum Algorithms and Complexity
2014
We survey several recent developments in quantum algorithms and complexity: Reichardt’s characterization of quantum query algorithms via span programs [15]; New bounds on the number of queries that are necessary for simulating a quantum algorithm that makes a very small number of queries [2]; Exact quantum algorithms with superlinear advantage over the best classical algorithm [4].