Pages that link to "Item:Q4376184"
From MaRDI portal
The following pages link to Strengths and Weaknesses of Quantum Computing (Q4376184):
Displaying 50 items.
- An optical model of computation (Q1779303) (← links)
- Quantum computers and unstructured search: finding and counting items with an arbitrarily entangled initial state (Q1840940) (← links)
- Computing with quanta -- impacts of quantum theory on computation. (Q1853471) (← links)
- Quantum communication and complexity. (Q1853475) (← links)
- Searching a database under decoherence (Q1854573) (← links)
- Mathematical models of quantum computation (Q1862645) (← links)
- One complexity theorist's view of quantum computing (Q1870556) (← links)
- A lower bound on the quantum query complexity of read-once functions (Q1880783) (← links)
- Quantum speed-up for unsupervised learning (Q1945031) (← links)
- Intricacies of quantum computational paths (Q1952642) (← links)
- Complexity limitations on quantum computation (Q1961375) (← links)
- Coloring invariants of knots and links are often intractable (Q1983547) (← links)
- Quantum partial search for uneven distribution of multiple target items (Q1993754) (← links)
- On the role of dealing with quantum coherence in amplitude amplification (Q1993814) (← links)
- Controlled quantum search (Q1994702) (← links)
- Quantum-access-secure message authentication via blind-unforgeability (Q2055681) (← links)
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work (Q2056756) (← links)
- Towards quantum computing based community detection (Q2065973) (← links)
- Dynamic multi-party quantum key agreement protocol based on commutative encryption (Q2090074) (← links)
- The variational quantum eigensolver: a review of methods and best practices (Q2092477) (← links)
- Evaluation of exact quantum query complexities by semidefinite programming (Q2100824) (← links)
- Entanglement measures of a pentapartite W-class state in the noninertial frame (Q2102258) (← links)
- Quantum search degeneration under amplitude noise in queries to the oracle (Q2107916) (← links)
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms (Q2119016) (← links)
- New approaches for quantum copy-protection (Q2120093) (← links)
- Layering quantum-resistance into classical digital signature algorithms (Q2154036) (← links)
- Multi-party quantum key agreement protocol for detection of collusive attacks in each sub-circle segment by headers (Q2165335) (← links)
- PKP-based signature scheme (Q2179377) (← links)
- The Python's lunch: geometric obstructions to decoding Hawking radiation (Q2225762) (← links)
- A relational time-symmetric framework for analyzing the quantum computational speedup (Q2286506) (← links)
- Key establishment à la Merkle in a quantum world (Q2318085) (← links)
- Quantum branch-and-bound algorithm and its application to the travelling salesman problem (Q2331339) (← links)
- Quantum de Finetti theorems under local measurements with applications (Q2358805) (← links)
- The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries (Q2384174) (← links)
- An \(R||C_{\max}\) quantum scheduling algorithm (Q2384180) (← links)
- Progress in quantum algorithms (Q2386407) (← links)
- Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters (Q2393688) (← links)
- Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device (Q2411545) (← links)
- Approximate span programs (Q2414858) (← links)
- A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions (Q2436429) (← links)
- Evolutionary algorithms for quantum computers (Q2441596) (← links)
- A universal quantum circuit scheme for finding complex eigenvalues (Q2454202) (← links)
- Quantum partial search of a database with several target items (Q2460283) (← links)
- Quantum mechanical search and harmonic perturbation (Q2462665) (← links)
- Quantum certificate complexity (Q2475404) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- Improved bounds on quantum learning algorithms (Q2491374) (← links)
- On the complexity of searching for a maximum of a function on a quantum computer (Q2491387) (← links)
- Discrete quantum walks hit exponentially faster (Q2571012) (← links)
