Pages that link to "Item:Q4376179"
From MaRDI portal
The following pages link to Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (Q4376179):
Displaying 27 items.
- Global versus local quantum correlations in the Grover search algorithm (Q264626) (← links)
- Quantum theory, namely the pure and reversible theory of information (Q406178) (← links)
- An algorithm for simulating the Ising model on a type-II quantum computer (Q709554) (← links)
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states (Q766174) (← links)
- Processing information in quantum decision theory (Q845444) (← links)
- On the security of stepwise triangular systems (Q851759) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Integrative connectionist learning systems inspired by nature: Current models, future trends and challenges (Q1024033) (← links)
- Classical versus quantum communication in XOR games (Q1654152) (← links)
- A lattice-based group signature scheme with verifier-local revocation (Q1749538) (← 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)
- Quantum phase gate based on multiphoton process in multimode cavity QED (Q1990978) (← links)
- X states of the same spectrum and entanglement as all two-qubit states (Q1994745) (← links)
- Quantum private information retrieval has linear communication complexity (Q2018821) (← links)
- Coined quantum walks lift the cospectrality of graphs and trees (Q2270832) (← links)
- The quantum query complexity of the abelian hidden subgroup problem (Q2373740) (← links)
- The quantum query complexity of the hidden subgroup problem is polynomial (Q2390280) (← links)
- Improving the security of arbitrated quantum signature against the forgery attack (Q2436403) (← links)
- A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions (Q2436429) (← links)
- Graph Isomorphism is in SPP (Q2495656) (← links)
- Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
- SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES (Q4902896) (← links)
- Quantum algorithm for the computation of the reactant conversion rate in homogeneous turbulence (Q5032260) (← links)
- Decoherence in quantum walks – a review (Q5437029) (← links)
- Algorithms on ensemble quantum computers (Q5962063) (← links)
