Ningyi Xie

Ningyi Xie

Auto-generated profile, based on publicly available information

Ningyi Xie

The University of Tsukuba, Tsukuba, Japan

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
5 May 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
XLXinwei Lee
Xinwei Lee
NXNingyi Xie
Ningyi Xie
DCDongsheng Cai
Dongsheng Cai
YSYoshiyuki Saito
Yoshiyuki Saito
NANobuyoshi Asai
Nobuyoshi Asai
The quantum approximate optimization algorithm (QAOA) is known for its capability and universality in solving combinatorial optimization problems on near-term quantum devices. The results yielded by QAOA depend strongly on its initial variational parameters. Hence, parameter selection for QAOA becomes an active area of research, as bad initialization might deteriorate the quality of the results, especially at great circuit depths. We first discuss the patterns of optimal parameters in QAOA in two directions: the angle index and the circuit depth. Then, we discuss the symmetries and periodicity of the expectation that is used to determine the bounds of the search space. Based on the patterns in optimal parameters and the bounds restriction, we propose a strategy that predicts the new initial parameters by taking the difference between the previous optimal parameters. Unlike most other strategies, the strategy we propose does not require multiple trials to ensure success. It only requires one prediction when progressing to the next depth. We compare this strategy with our previously proposed strategy and the layerwise strategy for solving the Max-cut problem in terms of the approximation ratio and the optimization cost. We also address the non-optimality in previous parameters, which is seldom discussed in other works despite its importance in explaining the behavior of variational quantum algorithms.

29 July 2024 in Quantum Information Processing
Verified
Journal Article
Closed access
PDF file
NXNingyi Xie
Ningyi Xie
XLXinwei Lee
Xinwei Lee
DCDongsheng Cai
Dongsheng Cai
YSYoshiyuki Saito
Yoshiyuki Saito
NANobuyoshi Asai
Nobuyoshi Asai
HLHoong Chuin Lau
Hoong Chuin Lau

2 January 2025 in Physical Review A
Verified
Journal Article
Closed access
NXNingyi Xie
Ningyi Xie
JXJiahua Xu
Jiahua Xu
TCTiejin Chen
Tiejin Chen
XLXinwei Lee
Xinwei Lee
YSYoshiyuki Saito
Yoshiyuki Saito
DCDongsheng Cai
Dongsheng Cai

18 December 2023
Verified
Conference Paper
Closed access
YSYoshiyuki Saito
Yoshiyuki Saito
NXNingyi Xie
Ningyi Xie
Jungpil SHINJungpil SHIN
Jungpil SHIN
XLXinwei Lee
Xinwei Lee
DCDongsheng Cai
Dongsheng Cai
NANobuyoshi Asai
Nobuyoshi Asai
Quantum Amplitude Estimation (QAE) is an important quantum algorithm that has the potential to quadratically speed up Monte Carlo based calculations.In this paper, we present a variant of the QAE without Phase Estimation Algorithm called Iterative Refinement QAE (IRQAE). IRQAE can refine the current estimation to a more accurate estimation iteratively, hence it can provide an estimation with arbitrary required accuracy ∊. The key idea of IRQAE is to use a rotation gate to create a quantum state for samplings with the current estimation. Using this idea, we show that IRQAE can provide a highly accurate estimation with lower classical computational complexity and with the same quantum computational complexity compared to state-of-the-art QAEs without phase estimation using numerical experiments. We prove that the computational complexity of IRQAE of the quantum part is O(1/∊) and the classical one is O(1/∊). The quantum cost gives a quadratic advantage over that of the classical Monte Carlo simulation.

21 April 2024 in arXiv
Verified
Preprint
Open access
PDF file
NXNingyi Xie
Ningyi Xie
XLXinwei Lee
Xinwei Lee
DCDongsheng Cai
Dongsheng Cai
YSYoshiyuki Saito
Yoshiyuki Saito
NANobuyoshi Asai
Nobuyoshi Asai
HLHoong Chuin Lau
Hoong Chuin Lau
The Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO) that arises in various fields including transportation and logistics. The CVRP extends from the Vehicle Routing Problem (VRP), aiming to determine the most efficient plan for a fleet of vehicles to deliver goods to a set of customers, subject to the limited carrying capacity of each vehicle. As the number of possible solutions skyrockets when the number of customers increases, finding the optimal solution remains a significant challenge. Recently, the Quantum Approximate Optimization Algorithm (QAOA), a quantum-classical hybrid algorithm, has exhibited enhanced performance in certain combinatorial optimization problems compared to classical heuristics. However, its ability diminishes notably in solving constrained optimization problems including the CVRP. This limitation primarily arises from the typical approach of encoding the given problems as penalty-inclusive binary optimization problems. In this case, the QAOA faces challenges in sampling solutions satisfying all constraints. Addressing this, our work presents a new binary encoding for the CVRP, with an alternative objective function of minimizing the shortest path that bypasses the vehicle capacity constraint of the CVRP. The search space is further restricted by the constraint-preserving mixing operation. We examine and discuss the effectiveness of the proposed encoding under the framework of the variant of the QAOA, Quantum Alternating Operator Ansatz (AOA), through its application to several illustrative examples. Compared to the typical QAOA approach, the proposed method not only preserves the feasibility but also achieves a significant enhancement in the probability of measuring optimal solutions.

12 June 2026 in Quantum Information Processing
Verified
Journal Article
Closed access
PDF file
ZTZhenyu Ta
Zhenyu Ta
NXNingyi Xie
Ningyi Xie
DCDongsheng Cai
Dongsheng Cai
NANobuyoshi Asai
Nobuyoshi Asai