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 commitments from complexity assumptions (Q260394) (← links)
- Challenges of adiabatic quantum evaluation of NAND trees (Q264902) (← links)
- Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces (Q265339) (← links)
- Highlighting the mechanism of the quantum speedup by time-symmetric and relational quantum mechanics (Q285982) (← links)
- Robust quantum spatial search (Q331506) (← links)
- Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
- Quantum entanglement and the communication complexity of the inner product function (Q387020) (← links)
- Quantum search in a possible three-dimensional complex subspace (Q430091) (← links)
- Can quantum entanglement detection schemes improve search? (Q430116) (← links)
- Is Hilbert space discrete? (Q451958) (← links)
- Using quantum key distribution for cryptographic purposes: a survey (Q477173) (← links)
- A new hybrid classical-quantum algorithm for continuous global optimization problems (Q486403) (← links)
- An exact quantum search algorithm with arbitrary database (Q490398) (← links)
- Quantum pattern matching fast on average (Q513289) (← links)
- Szegedy's quantum walk with queries (Q513418) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- A desired state can not be found with certainty for Grover's algorithm in a possible three-dimensional complex subspace (Q544841) (← links)
- \texttt{QUCON}: a fast Krylov-Newton code for dipole quantum control problems (Q546806) (← links)
- Tree search and quantum computation (Q638594) (← links)
- Noise-based logic hyperspace with the superposition of \(2^N\) states in a single wire (Q653131) (← links)
- The quadratic speedup in Grover's search algorithm from the entanglement perspective (Q663021) (← links)
- On the obfuscatability of quantum point functions (Q669933) (← links)
- A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function (Q669952) (← links)
- A quantum computer only needs one universe (Q720555) (← links)
- On the solution of trivalent decision problems by quantum state identification (Q734207) (← links)
- On the quantum query complexity of local search in two and three dimensions (Q835649) (← links)
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- Quest for fast partial search algorithm (Q850550) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Quantum algorithm for SAT problem andquantum mutual entropy (Q930728) (← links)
- Entanglement in the Grover search algorithm (Q936965) (← links)
- The geometry of quantum learning (Q989901) (← links)
- Quantum approaches to graph colouring (Q1004074) (← links)
- A new connection between quantum circuits, graphs and the Ising partition function (Q1007123) (← links)
- Quantum lower bounds for the Goldreich-Levin problem (Q1045938) (← links)
- An oracle builder's toolkit (Q1398366) (← links)
- On the simulation of quantum Turing machines. (Q1401393) (← links)
- Quantum multi-prover interactive proof systems with limited prior entanglement. (Q1401955) (← links)
- New quantum algorithm for studying NP-complete problems (Q1422459) (← links)
- Diagonalization of diffusion matrix in Grover's algorithm (Q1569561) (← links)
- Quantum search on structured problems (Q1573936) (← links)
- The Landauer resistance and band spectra for the counting quantum Turing machine. (Q1586959) (← links)
- Computational complexity of uniform quantum circuit families and quantum Turing machines (Q1605308) (← links)
- Completing the physical representation of quantum algorithms provides a quantitative explanation of their computational speedup (Q1643528) (← links)
- A review on quantum search algorithms (Q1698826) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Oracles and query lower bounds in generalised probabilistic theories (Q1735899) (← links)
- A modified quantum search algorithm (Q1740835) (← links)
- New quantum algorithm solving the NP complete problem (Q1760321) (← links)
- Spatial search using the discrete time quantum walk (Q1761706) (← links)