Pages that link to "Item:Q4376184"
From MaRDI portal
The following pages link to Strengths and Weaknesses of Quantum Computing (Q4376184):
Displaying 50 items.
- Quantum and classical tradeoffs (Q2575086) (← links)
- Universal test for quantum one-way permutations (Q2575756) (← links)
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions (Q2661695) (← links)
- Super-quantum discord in ferromagnetic and antiferromagnetic materials (Q2681031) (← links)
- Total functions in QMA (Q2684235) (← links)
- Optimal fixed-point quantum search in an interacting Ising spin system (Q2687186) (← links)
- Implementation of efficient quantum search algorithms on NISQ computers (Q2690526) (← links)
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness (Q2692335) (← links)
- Improved classical and quantum algorithms for subset-sum (Q2692398) (← links)
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384) (← links)
- Post-Quantum Cryptography: State of the Art (Q2803619) (← links)
- On the efficiency of Hamiltonian-based quantum computation for low-rank matrices (Q2861773) (← links)
- Quantum Distributed Computing Applied to Grover’s Search Algorithm (Q2944889) (← links)
- Spatial search on a honeycomb network (Q3061155) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- Information and computation: Classical and quantum aspects (Q3077099) (← links)
- The role of relative entropy in quantum information theory (Q3077102) (← links)
- Random matrix model of adiabatic quantum computing (Q3102395) (← links)
- Lower bound for quantum phase estimation (Q3102418) (← links)
- Algebraic analysis of quantum search with pure and mixed states (Q3102421) (← links)
- Quantum computing and hidden variables (Q3102441) (← links)
- Spatial search and the Dirac equation (Q3102517) (← links)
- Characterization of pure quantum states of multiple qubits using the Groverian entanglement measure (Q3114929) (← links)
- Quantum computation and quantum information† (Q3375535) (← links)
- SIMULATION OF QUANTUM ADIABATIC SEARCH IN THE PRESENCE OF NOISE (Q3430387) (← links)
- An upper bound on the rate of information transfer by Grover's oracle (Q3439252) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
- Quantum Walk Based Search Algorithms (Q3502631) (← links)
- VERIFIER-BASED ALGORITHM FOR UNSORTED DATABASE SEARCH PROBLEM (Q3509799) (← links)
- HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL (Q3534111) (← links)
- Language Classes Defined by Generalized Quantum Turing Machine (Q3567163) (← links)
- Rapid solution of problems by quantum computation (Q4033175) (← links)
- Quantum machine learning: a classical perspective (Q4556858) (← links)
- Quantum simulation from the bottom up: the case of rebits (Q4565125) (← links)
- Forrelation: A Problem That Optimally Separates Quantum from Classical Computing (Q4571925) (← links)
- Quantum-walk speedup of backtracking algorithms (Q4612479) (← links)
- The quantum walk search algorithm: factors affecting efficiency (Q4623131) (← links)
- A classical limit of Grover’s algorithm induced by dephasing: Coherence versus entanglement (Q4629310) (← links)
- Quantum Query Algorithms Are Completely Bounded Forms (Q4634058) (← links)
- QUANTUM SEARCH ALGORITHM CAN BE IMPROVED (Q4663283) (← links)
- QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS (Q4819288) (← links)
- Search on a hypercubic lattice using a quantum random walk. I.<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:mi>d</mml:mi><mml:mo>></mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math> (Q4903073) (← links)
- Faster quantum-walk algorithm for the two-dimensional spatial search (Q4903104) (← links)
- Exact quantum search by parallel unitary discrimination schemes (Q4903114) (← links)
- Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer (Q4972864) (← links)
- Quantum Query Algorithms are Completely Bounded Forms. (Q4993266) (← links)
- (Q5020598) (← links)
- A public key cryptosystem based on data complexity under quantum environment (Q5046478) (← links)
- Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite (Q5056039) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
