Searcharxiv⌕ Search

arXiv subjects

Dong Pyo Chi

Publications and source records attributed to Dong Pyo Chi.

24 records · Page 2Linked to original sources

Sturmian words, $β$-shifts, and transcendence

Consider the minimal $β$-shift containing the shift space generated by given Sturmian word. In this paper we characterize such $β$ and investigate its combinatorial, dynamical and topological properties and prove that such $β$ are transcendental numbers.

math.CO↗

Function-dependent Phase Transform in Quantum Computing

We construct a quantum algorithm that performs function-dependent phase transform and requires no initialization of an ancillary register. The algorithm recovers the initial state of an ancillary register regardless of whether its state is pure or mixed. Thus we can use any qubits as an ancillary register even though they are entangled with others and are occupied by other computational process. We also show that our algorithm is optimal in the sense of the number of function evaluations.

quant-ph↗

Quantum Algorithm for Generalized Deutsch-Jozsa Problem

We generalize the Deutsch-Jozsa problem and present a quantum algorithm that can solve the generalized Deutsch-Jozsa problem by a single evaluation of a given function. We discuss the initialization of an auxiliary register and present a generalized Deutsch-Jozsa algorithm that requires no initialization of an auxiliary register.

quant-ph↗

The f-conditioned Phase Transform

We present a quantum algorithm for the f-conditioned phase transform which does not require any initialization of ancillary register. We also develop a quantum algorithm that can solve the generalized Deutsch-Jozsa problem by a single evaluation of a function.

quant-ph↗

Quantum Database Searching by a Single Query

In this paper we give a quantum mechanical algorithm that can search a database by a single query, when the number of solutions is more than a quarter. It utilizes modified Grover operator of arbitrary phase.

quant-ph↗

A Polynomial-Time Quantum Algorithm for Collision Problem

In this paper, we give a quantum algorithm which solves collision problem in an expected polynomial time. Especially, when the function is two-to-one, we present a quantum algorithm which can find a collision with certainty in a worst-case polynomial time. We also give a quantum algorithm which solves claw problem with certainty in a worst-case polynomial time.

quant-ph↗