Výsledky vyhľadávania - Theory of computation → Quantum query complexity

On Exact Quantum Query Complexity Autor Montanaro, Ashley, Jozsa, Richard, Mitchison, Graeme

“… We also characterise the model of nonadaptive exact quantum query complexity in terms of coding theory and completely characterise the query complexity of symmetric boolean functions in this context…”
Získať plný text

Quantum Private Set Intersection Cardinality Protocol With Application to Privacy-Preserving Condition Query Autor Shi, Run-Hua, Li, Yi-Fei

“… In this paper, we present a novel quantum PSI-CA protocol, in which we adopt oblivious quantum key distribution, secure quantum summation and quantum counting algorithm…”
Získať plný text

Optimal Parallel Quantum Query Algorithms Autor Jeffery, Stacey, Magniez, Frederic, de Wolf, Ronald

“…We study the complexity of quantum query algorithms that make p queries in parallel in each timestep…”
Získať plný text

Strong Direct Product Theorems for Quantum Communication and Query Complexity Autor Sherstov, Alexander A.

“… We prove that quantum query complexity obeys an SDPT whenever the query lower bound for a single instance is proved by the polynomial method, one of the two main techniques in that model…”
Získať plný text

Quantum Pattern Matching Fast on Average Autor Montanaro, Ashley

“… This work describes a quantum algorithm which solves the pattern matching problem for random patterns and texts in time O ~ ( ( n / m ) d / 2 2 O ( d 3 / 2 log m…”
Získať plný text

Nearly Optimal Communication and Query Complexity of Bipartite Matching Autor Blikstad, Joakim, Van Den Brand, Jan, Efron, Yuval, Mukhopadhyay, Sagnik, Nanongkai, Danupon

“…) up to polylogarithmic factors in five models of computation: the two-party communication, AND query, OR query, XOR query, and quantum edge query models…”
Získať plný text

Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing Autor Lee, Troy, Magniez, Frédéric, Santha, Miklos

“…We show that the quantum query complexity of detecting if an n -vertex graph contains a triangle is O ( n 9 / 7…”
Získať plný text

Partial Boolean Functions With Exact Quantum Query Complexity One Autor Xu, Guoliang, Qiu, Daowen

“…We provide two sufficient and necessary conditions to characterize any n-bit partial Boolean function with exact quantum query complexity 1…”
Získať plný text

Cut Query Algorithms with Star Contraction Autor Apers, Simon, Efron, Yuval, Gawrychowski, Pawel, Lee, Troy, Mukhopadhyay, Sagnik, Nanongkai, Danupon

“…We study the complexity of determining the edge connectivity of a simple graph with cut queries. We show…”
Získať plný text

Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions Autor Ye, Ze-Kun, Li, Lv-Zhou

“… Usually, quantum advantages are revealed by presenting a quantum algorithm that has a better query complexity than its classical counterpart…”
Získať plný text

Nonadaptive quantum query complexity Autor Montanaro, Ashley

“…We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries…”
Získať plný text

Oracles and Query Lower Bounds in Generalised Probabilistic Theories Autor Barnum, Howard, Lee, Ciarán M., Selby, John H.

“…We investigate the connection between interference and computational power within the operationally defined framework of generalised probabilistic theories…”
Získať plný text

Tight Quantum Time-Space Tradeoffs for Function Inversion Autor Chung, Kai-Min, Guo, Siyao, Liu, Qipeng, Qian, Luowen

“… T . This is a well studied problem with profound connections to cryptography, data structures, communication complexity, and circuit lower bounds…”
Získať plný text

Energy-Consumption Advantage of Quantum Computation Autor Meier, Florian, Yamasaki, Hayata

“… of complexity for quantum computation. To bridge this gap, we introduce a general framework for studying the energy consumption of quantum and classical computation, based on a computational model conventionally used for studying query…”
Získať plný text

Quantum Algorithm for Lexicographically Minimal String Rotation Autor Wang, Qisheng, Ying, Mingsheng

“… In this paper, we propose an O ( n 3 / 4 ) quantum query algorithm for LMSR. In particular, the algorithm has average-case query complexity O ( n log n…”
Získať plný text

Qunity: A Unified Language for Quantum and Classical Computing Autor Voichick, Finn, Li, Liyi, Rand, Robert, Hicks, Michael

“…We introduce Qunity, a new quantum programming language designed to treat quantum computing as a natural generalization of classical computing…”
Získať plný text

Exponentially more precise quantum simulation of fermions in second quantization Autor Babbush, Ryan, Berry, Dominic W, Kivlichan, Ian D, Wei, Annie Y, Love, Peter J, Aspuru-Guzik, Alán

“… The key difficulty in applying algorithms for general sparse Hamiltonian simulation to fermionic simulation is that a query, corresponding to computation of an entry of the Hamiltonian, is costly to compute…”
Získať plný text

Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision Autor Jeffery, Stacey, Kothari, Robin, Le Gall, François, Magniez, Frédéric

“…The quantum query complexity of Boolean matrix multiplication is typically studied as a function of the matrix dimension, n , as well as the number of 1 s in the output, ℓ…”
Získať plný text

Approximate Span Programs Autor Ito, Tsuyoshi, Jeffery, Stacey

“…Span programs are a model of computation that have been used to design quantum algorithms, mainly in the query model…”
Získať plný text

From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm Autor Xu, Guoliang, Qiu, Daowen

“…In quantum computation, designing an optimal exact quantum query algorithm (i.e., a quantum decision tree algorithm…”
Získať plný text