Renata Wong

Dr. Renata Wong

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 March 2022 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
RWRenata Wong
Renata Wong
WCWeng-Long Chang
Weng-Long Chang

10 March 2021 in IEEE Transactions on Nanobioscience
Verified
Journal Article
Closed access
RWRenata Wong
Renata Wong
WCWeng-Long Chang
Weng-Long Chang
Protein structure prediction (PSP) predicts the native conformation for a given protein sequence. Classically, the problem has been shown to belong to the NP-complete complexity class. Its applications range from physics, through bioinformatics to medicine and quantum biology. It is possible however to speed it up with quantum computational methods, as we show in this paper. Here we develop a fast quantum algorithm for PSP in three-dimensional hydrophobic-hydrophilic model on body-centered cubic lattice with quadratic speedup over its classical counterparts. Given a protein sequence of n amino acids, our algorithm reduces the temporal and spatial complexities to, respectively, O(2n/2 ) and O(n2 log n). With respect to oracle-related quantum algorithms for the NP-complete problems, we identify our algorithm as optimal. To justify the feasibility of the proposed algorithm we successfully solve the problem on IBM quantum simulator involving 21 and 25 qubits. We confirm the experimentally obtained high probability of success in finding the desired conformation by calculating the theoretical probability estimations.

26 April 2021 in IEEE Transactions on Nanobioscience
Verified
Journal Article
Closed access
WCWeng-Long Chang
Weng-Long Chang
JCJu-Chin Chen
Ju-Chin Chen
WCWen-Yu Chung
Wen-Yu Chung
CHChun-Yuan Hsiao
Chun-Yuan Hsiao
RWRenata Wong
Renata Wong
Athanasios V. VasilakosAthanasios V. Vasilakos
Athanasios V. Vasilakos
In this paper, we propose a bio-molecular algorithm with O( ${n}^{{2}} + {m}$ ) biological operations, O( $2^{n}$ ) DNA strands, O( ${n}$ ) tubes and the longest DNA strand, O( ${n}$ ), for solving the independent-set problem for any graph G with ${m}$ edges and ${n}$ vertices. Next, we show that a new kind of the straightforward Boolean circuit yielded from the bio-molecular solutions with ${m}$ NAND gates, ( ${m} +{n} \times $ ( ${n} + {1}$ )) AND gates and (( ${n} \times $ ( ${n} + {1}$ ))/2) NOT gates can find the maximal independent-set(s) to the independent-set problem for any graph ${G}$ with ${m}$ edges and ${n}$ vertices. We show that a new kind of the proposed quantum-molecular algorithm can find the maximal independent set(s) with the lower bound $\Omega $ ( $2^{n/{2}}$ ) queries and the upper bound O( $2^{n/{2}}$ ) queries. This work offers an obvious evidence for that to solve the independent-set problem in any graph ${G}$ with ${m}$ edges and ${n}$ vertices, bio-molecular computers are able to generate a new kind of the straightforward Boolean circuit such that by means of implementing it quantum computers can give a quadratic speed-up. This work also offers one obvious evidence that quantum computers can significantly accelerate the speed and enhance the scalability of bio-molecular computers. Next, the element distinctness problem with input of ${n}$ bits is to determine whether the given $2^{n}$ real numbers are distinct or not. The quantum lower bound of solving the element distinctness problem is $\Omega $ ( $2^{n\times {(}{2}/{3}{)}}$ ) queries in the case of a quantum walk algorithm. We further show that the proposed quantum-molecular algorithm reduces the quantum lower bound to $\Omega $ (( $2^{n/{2}}$ )/( $2^{\text {1/2}}{)}$ ) queries. Furthermore, to justify the feasibility of the proposed quantum-molecular algorithm, we successfully solve a typical independent set problem for a graph G with two vertices and one edge by carrying out experiments on the backend ibmqx4 with five quantum bits and the backend simulator with 32 quantum bits on IBM’s quantum computer.

25 November 2021 in IEEE Transactions on Nanobioscience
Verified
Journal Article
Closed access
WCWeng-Long Chang
Weng-Long Chang
WCWen-Yu Chung
Wen-Yu Chung
CHChun-Yuan Hsiao
Chun-Yuan Hsiao
RWRenata Wong
Renata Wong
JCJu-Chin Chen
Ju-Chin Chen
Athanasios V. VasilakosAthanasios V. Vasilakos
Athanasios V. Vasilakos
In this paper, we propose a bio-molecular algorithm with O( ${n}$ 2 ) biological operations, O( $2^{n-1}$ ) DNA strands, O( ${n}$ ) tubes and the longest DNA strand, O( ${n}$ ), for inferring the value of a bit from the only output satisfying any given condition in an unsorted database with $2^{n}$ items of ${n}$ bits. We show that the value of each bit of the outcome is determined by executing our bio-molecular algorithm ${n}$ times. Then, we show how to view a bio-molecular solution space with $2^{{\textit {n-1}}}$ DNA strands as an eigenvector and how to find the corresponding unitary operator and eigenvalues for inferring the value of a bit in the output. We also show that using an extension of the quantum phase estimation and quantum counting algorithms computes its unitary operator and eigenvalues from bio-molecular solution space with $2^{{\textit {n-1}}}$ DNA strands. Next, we demonstrate that the value of each bit of the output solution can be determined by executing the proposed extended quantum algorithms ${n}$ times. To verify our theorem, we find the maximum-sized clique to a graph with two vertices and one edge and the solution ${b}$ that satisfies ${b}^{2} \equiv 1$ (mod 15) and $1 < {b} < (15/2)$ using IBM Quantum’s backend.

22 August 2020 in International Journal of Theoretical Physics
Verified
Journal Article
Closed access
PDF file
DDDo Ngoc Diep
Do Ngoc Diep
KNKoji Nagata
Koji Nagata
RWRenata Wong
Renata Wong

1 January 2012 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
RBRingo Baumann
Ringo Baumann
GBGerhard Brewka
Gerhard Brewka
RWRenata Wong
Renata Wong