Suchergebnisse - Theory of computation → Quantum query complexity

On Exact Quantum Query Complexity von 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 …”
Volltext

Quantum Private Set Intersection Cardinality Protocol With Application to Privacy-Preserving Condition Query von 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 …”
Volltext

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

“… We study the complexity of quantum query algorithms that make p queries in parallel in each timestep …”
Volltext

Strong Direct Product Theorems for Quantum Communication and Query Complexity von 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 …”
Volltext

Quantum Pattern Matching Fast on Average von 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 …”
Volltext

Nearly Optimal Communication and Query Complexity of Bipartite Matching von 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 …”
Volltext

Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing von 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 …”
Volltext

Partial Boolean Functions With Exact Quantum Query Complexity One von 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 …”
Volltext

Cut Query Algorithms with Star Contraction von 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 …”
Volltext

Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions von 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 …”
Volltext

Nonadaptive quantum query complexity von 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 …”
Volltext

Oracles and Query Lower Bounds in Generalised Probabilistic Theories von 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 …”
Volltext

Tight Quantum Time-Space Tradeoffs for Function Inversion von 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 …”
Volltext

Energy-Consumption Advantage of Quantum Computation von 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 …”
Volltext

Quantum Algorithm for Lexicographically Minimal String Rotation von 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 …”
Volltext

Qunity: A Unified Language for Quantum and Classical Computing von 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 …”
Volltext

Exponentially more precise quantum simulation of fermions in second quantization von 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 …”
Volltext

Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision von 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, ℓ …”
Volltext

Approximate Span Programs von Ito, Tsuyoshi, Jeffery, Stacey

“… Span programs are a model of computation that have been used to design quantum algorithms, mainly in the query model …”
Volltext

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

“… In quantum computation, designing an optimal exact quantum query algorithm (i.e., a quantum decision tree algorithm …”
Volltext