Application of distributed semi-quantum computing model in phase estimation
From MaRDI portal
Publication:506164
DOI10.1016/j.ipl.2016.12.002zbMath1401.68082OpenAlexW2561472792MaRDI QIDQ506164
Zhenbang Rong, Shenggen Zheng, Lvzhou Li, Kai Li, Dao Wen Qiu
Publication date: 31 January 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2016.12.002
parallel processingquantum computingdistributed computingapproximation algorithmsrandomized algorithms
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm ⋮ Distributed Bernstein-Vazirani algorithm ⋮ Three Attacks on the Mediated Semi‐Quantum Key Distribution without Invoking Quantum Measurement ⋮ Quantum speedup for pool-based active learning ⋮ Distributed Grover's algorithm ⋮ Modeling of RNA secondary structures using two-way quantum finite automata ⋮ Quantum-enhanced feature selection with forward selection and backward elimination
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds on the size of semi-quantum finite automata
- State succinctness of two-way finite automata with quantum and classical states
- Exponentially more concise quantum recognition of non-RMM regular languages
- Two-way finite automata with quantum and classical states.
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
- On hybrid models of quantum finite automata
- Generalizations of the distributed Deutsch–Jozsa promise problem
- Quantum Key Distribution with Classical Bob
- One-Way Finite Automata with Quantum and Classical States
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- The Semi-Quantum Computer
- SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES
- On the state complexity of semi-quantum finite automata
- Computational Complexity
This page was built for publication: Application of distributed semi-quantum computing model in phase estimation