most citedHamiltonian and measuring time for analog quantum search

1 citations · 2 across the 6 of their papers we have counts for

collaborators

6 papers

quant-ph20041 cited

Analytical technique for simplification of the encoder-decoder circuit for a perfect five-qubit error correction

Jin-Yuan Hsieh, Che-Ming Li, Der-San Chuu

Simpler encoding and decoding networks are necessary for more reliable quantum error correcting codes (QECCs). The simplification of the encoder-decoder circuit for a perfect five-…

quant-ph2004

Creating Boolean Functions for the Five-EPR-Pair, Single-Error-Correcting Code

Jin-Yuan Hsieh, Che-Ming Li

A quantum single-error-correcting scheme can be derived from a one-way entanglement purification protocol in purifying one Bell state from a finite block of five Bell states. The m…

quant-ph2002

Formulation of a Family of Sure-Success Quantum Search Algorithms

Jin-Yuan Hsieh, Che-Ming Li, Jenn-Sen Lin +1

In this work, we consider a family of sure-success quantum algorithms, which is grouped into even and odd members for solving a generalized Grover search problem. We prove the matc…

quant-ph20021 cited

Hamiltonian and measuring time for analog quantum search

Jin-Yuan Hsieh, Che-Ming Li, Der-San Chuu

We derive in this study a Hamiltonian to solve with certainty the analog quantum search problem analogue to the Grover algorithm. The general form of the initial state is considere…

quant-ph2002

An improved phase error tolerance in Quantum search algorithm

Jin-Yuan Hsieh, Che-Ming Li, Der-San Chuu

As the matching condition in Grover search algorithm is transgressed due to inevitable errors in phase inversions, it gives a reduction in maximum probability of success. With a gi…

quant-ph2002

Multi-object searching algorithm using subgrouped oracles

Jin-Yuan Hsieh, Che-Ming Li, Der-San Chuu

We present in this work, if a set of well organized suboracles is available, an algorithm for multiobject search with certainty in an unsorted database of items. Depending on t…