RWRenata Wong

Renata Wong

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Renata Wong has a total of 20 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A quantum Bluestein’s algorithm for arbitrary-size quantum Fourier transform

    by Nan-Hong Kuo, Renata Wong

    We propose a quantum analogue of Bluestein’s algorithm (QBA) that implements an algebraically exact N -point quantum Fourier transform (QFT) for arbitrary N . Our construction factors the N -dimensional QFT unitary U QFT N into three diagonal quadratic-phase gates and two standard radix-2 QFT subcircuits of size M = 2 m (with M ⩾ 2 N − 1 ). This achieves asymptotic gate complexity of O ( N ) and uses O ( log ⁡ N ) qubits. We validate the correctness of the algorithm through a concrete implementation in Qiskit, confirming that QBA produces the exact N -point discrete Fourier transform on arbitrary-length inputs. The proposed framework is especially relevant for biomedical time-series analysis and quantum-kernel methods, where irregular, non-power-of-two signal lengths are common and zero-padding may introduce distortions in the represented N -point spectrum.

  • Open Access

    Bioinspired Quantum Oracle Circuits for Biomolecular Solutions of the Maximum Cut Problem

    by Weng-Long Chang, Renata Wong, Yu-Hao Chen, Wen-Yu Chung, Ju-Chin Chen, Athanasios V. Vasilakos

    Given an undirected, unweighted graph with n vertices and m edges, the maximum cut problem is to find a partition of the n vertices into disjoint subsets V1 and V2 such that the number of edges between them is as large as possible. Classically, it is an NP-complete problem, which has potential applications ranging from circuit layout design, statistical physics, computer vision, machine learning and network science to clustering. In this paper, we propose a biomolecular and a quantum algorithm to solve the maximum cut problem for any graph G. The quantum algorithm is inspired by the biomolecular algorithm and has a quadratic speedup over its classical counterparts, where the temporal and spatial complexities are reduced to, respectively, \(O(\sqrt{2^n/r})\) and \(O(m^2)\). With respect to oracle-related quantum algorithms for NP-complete problems, we identify our algorithm as optimal. Furthermore, to justify the feasibility of the proposed algorithm, we successfully solve a typical maximum cut problem for a graph with three vertices and two edges by carrying out experiments on IBM’s quantum simulator.

  • Bioinspired Quantum Oracle Circuits for Biomolecular Solutions of the Maximum Cut Problem

    by Weng-Long Chang, Renata Wong, Yu-Hao Chen, Wen-Yu Chung, Ju-Chin Chen, Athanasios V. Vasilakos

    Given an undirected, unweighted graph with n vertices and m edges, the maximum cut problem is to find a partition of the n vertices into disjoint subsets V 1 and V 2 such that the number of edges between them is as large as possible. Classically, it is an NP-complete problem, which has potential applications ranging from circuit layout design, statistical physics, computer vision, machine learning and network science to clustering. In this paper, we propose a biomolecular and a quantum algorithm to solve the maximum cut problem for any graph G. The quantum algorithm is inspired by the biomolecular algorithm and has a quadratic speedup over its classical counterparts, where the temporal and spatial complexities are reduced to, respectively, O(√2 n /r) and O(m 2 ). With respect to oracle-related quantum algorithms for NP-complete problems, we identify our algorithm as optimal. Furthermore, to justify the feasibility of the proposed algorithm, we successfully solve a typical maximum cut problem for a graph with three vertices and two edges by carrying out experiments on IBM’s quantum simulator.


  • Quantum Speedup for Inferring the Value of Each Bit of a Solution State in Unsorted Databases Using a Bio-Molecular Algorithm on IBM Quantum’s Computers

    by Weng-Long Chang, Wen-Yu Chung, Chun-Yuan Hsiao, Renata Wong, Ju-Chin Chen, Mang Feng, 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.


  • Quantum Speedup and Mathematical Solutions of Implementing Bio-Molecular Solutions for the Independent Set Problem on IBM Quantum Computers

    by Weng-Long Chang, Ju-Chin Chen, Wen-Yu Chung, Chun-Yuan Hsiao, Renata Wong, 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.


  • Quantum Speedup for Protein Structure Prediction

    by Renata Wong, 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.


  • Recent Progress in Quantum Machine Learning

    by Amandeep Singh Bhatia, Renata Wong

    Quantum computing is a new exciting field which can be exploited to great speed and innovation in machine learning and artificial intelligence. Quantum machine learning at crossroads explores the interaction between quantum computing and machine learning, supplementing each other to create models and also to accelerate existing machine learning models predicting better and accurate classifications. The main purpose is to explore methods, concepts, theories, and algorithms that focus and utilize quantum computing features such as superposition and entanglement to enhance the abilities of machine learning computations enormously faster. It is a natural goal to study the present and future quantum technologies with machine learning that can enhance the existing classical algorithms. The objective of this chapter is to facilitate the reader to grasp the key components involved in the field to be able to understand the essentialities of the subject and thus can compare computations of quantum computing with its counterpart classical machine learning algorithms.


  • Quantum Algorithms

    by Renata Wong, Amandeep Singh Bhatia

    In the last two decades, the interest in quantum computation has increased significantly among research communities. Quantum computing is the field that investigates the computational power and other properties of computers on the basis of the underlying quantum-mechanical principles. The main purpose is to find quantum algorithms that are significantly faster than any existing classical algorithms solving the same problem. While the quantum computers currently freely available to wider public count no more than two dozens of qubits, and most recently developed quantum devices offer some 50-60 qubits, quantum computer hardware is expected to grow in terms of qubit counts, fault tolerance, and resistance to decoherence. The main objective of this chapter is to present an introduction to the core quantum computing algorithms developed thus far for the field of cryptography.