arXiv subjects

Meng-Jun Hu

Publications and source records attributed to Meng-Jun Hu.

At least 19 recordsLinked to original sources

arXiv2026

M\"obius-Guided Diagonal-Gate Compilation with Native Multiqubit Controlled-Phase Gates on Neutral-Atom Processors

Diagonal gates are ubiquitous primitives in quantum algorithms, from phase oracles, hypergraph-state preparation, and multi-control logic to Hamiltonian simulation of spin models and digitized lattice field theories, where Ising interactions and local potential terms are diagonal in the encoded basis. Standard compilers, however, often lower diagonal structure into one- and two-qubit gates before neutral-atom hardware can exploit native Rydberg-mediated multiqubit controlled-phase operations. We propose a M\"obius-guided compiler that maps a diagonal phase function to a phase hypergraph via subset-lattice M\"obius inversion. The hypergraph retains the support and angle of each many-body phase term, allowing sparse or local high-order structure to be routed as native multiqubit controlled-phase candidates when feasible and decomposed otherwise. The neutral-atom scheduler accounts for atom motion, interaction-zone constraints, blockade feasibility, and error costs, enabling a direct comparison between native high-order execution and decomposed alternatives. Benchmarks against routed ZAP and ZX-calculus baselines show improved estimated success for algorithmic instances with exploitable three- and four-body phase terms, and comparable performance on predominantly two-body instances. These results provide a feasible compilation strategy for more fully exploiting the native capabilities of neutral-atom hardware, using atom reconfigurability and Rydberg-mediated multiqubit phase operations as practical resources for more efficient quantum computation.

quant-ph↗

arXiv2026

The Transformation-Response Framework: An Operational Reformulation of Quantum Mechanics

We present the transformation-response framework, an operational reformulation of quantum mechanics. A quantum state is not a Hilbert space object but the catalog of a system's responses to all physical transformations: for each operation $g$ from the system's local group $G$, an interference experiment gives a complex value $\chi(g)$. The collection $\{\chi(g): g\in G \}$ is the characteristic function and defines the state. The only postulate is that $\chi$ is positive-definite, encoding the requirement that no superposition of transformations yields negative probability. From this single assumption, the entire standard formalism is derived: Hilbert space via GNS construction, Born rule via Bochner theorem, Schr\"odinger equation from group automorphisms, and especially Feynman path integral as a Trotter limit. The framework is background-independent and time-neutral: time is a coordinate along a one-parameter subgroup of $G$. It also reveals a new physical constraint, product order positivity, which may lead to testable predictions. The framework provides a unified, economical, and falsifiable foundation for quantum theory rooted in operational primitives.

quant-ph↗

arXiv2025

Hierarchical Quantum Optimization via Backbone-Driven Problem Decomposition: Integrating Tabu-Search with QAOA

As quantum computing advances, quantum approximate optimization algorithms (QAOA) have shown promise in addressing combinatorial optimization problems. However, the limitations of Noisy Intermediate Scale Quantum (NISQ) devices hinder the scalability of QAOA for large-scale optimization tasks. To overcome these challenges, we propose Backbone-Driven QAOA, a hybrid framework that leverages adaptive Tabu search for classical preprocessing to decompose large-scale quadratic unconstrained binary (QUBO) problems into NISQ-compatible subproblems. In our approach, adaptive Tabu search dynamically identifies and fixes backbone variables to construct reduced-dimensional subspaces that preserve the critical optimization landscape. These quantum-tractable subproblems are then solved via QAOA, with the resulting solutions iteratively refining the backbone selection in a closed-loop quantum-classical cycle. Experimental results demonstrate that our approach not only competes with, and in some cases surpasses, traditional classical algorithms but also performs comparably with recently proposed hybrid classical-quantum algorithms. Our proposed framework effectively orchestrates the allocation of quantum and classical resources, thereby enabling the solution of large-scale combinatorial optimization problems on current NISQ hardware.

quant-ph↗

arXiv2025

PPO-Q: Proximal Policy Optimization with Parametrized Quantum Policies or Values

Quantum machine learning (QML), which combines quantum computing with machine learning, is widely believed to hold the potential to outperform traditional machine learning in the era of noisy intermediate-scale quantum (NISQ). As one of the most important types of QML, quantum reinforcement learning (QRL) with parameterized quantum circuits as agents has received extensive attention in the past few years. Various algorithms and techniques have been introduced, demonstrating the effectiveness of QRL in solving some popular benchmark environments such as CartPole, FrozenLake, and MountainCar. However, tackling more complex environments with continuous action spaces and high-dimensional state spaces remains challenging within the existing QRL framework. Here we present PPO-Q, which, by integrating hybrid quantum-classical networks into the actor or critic part of the proximal policy optimization (PPO) algorithm, achieves state-of-the-art performance in a range of complex environments with significantly reduced training parameters. The hybrid quantum-classical networks in the PPO-Q incorporate two additional traditional neural networks to aid the parameterized quantum circuits in managing high-dimensional state encoding and action selection. When evaluated on 8 diverse environments, including four with continuous action space, the PPO-Q achieved comparable performance with the PPO algorithm but with significantly reduced training parameters. Especially, we accomplished the BipedalWalker environment, with a high-dimensional state and continuous action space simultaneously, which has not previously been reported in the QRL. More importantly, the PPO-Q is very friendly to the current NISQ hardware. We successfully trained two representative environments on the real superconducting quantum devices via the Quafu quantum cloud service.

quant-ph↗

arXiv2025

QSteed: A Resource-Virtualized and Hardware-Aware Quantum Compilation Framework for Real Quantum Computing Processors

As quantum computing systems continue to scale up and become more clustered, efficiently compiling user quantum programs into high fidelity executable sequences on real hardware remains a key challenge for current quantum compilation systems. In this study, we introduce a system software framework that integrates resource virtualization and hardware aware compilation for real quantum computing processors, termed QSteed. QSteed virtualizes quantum processors through a four layer abstraction hierarchy comprising the Real Quantum Processing Unit (QPU), Standard QPU (StdQPU), Substructure of the QPU (SubQPU), and Virtual QPU (VQPU). These abstractions, together with calibration data, device topology, and noise descriptors, are maintained in a dedicated database to enable unified and fine grained management across superconducting quantum platforms. At run time, the modular compiler queries the database to match each incoming circuit with the most suitable VQPU, after which it confines layout, routing, gate resynthesis, and noise adaptive optimizations to that virtual subregion. The complete stack has been deployed on the Quafu superconducting cluster, where experimental runs confirm the correctness of the virtualization model and the efficacy of the compiler without requiring modifications to user code. By integrating resource virtualization with a select-then-compile workflow, QSteed demonstrates a robust architecture for compiling programs on noisy superconducting processors. This architectural approach offers a promising path towards efficient compilation needs across various superconducting quantum computing platforms in the noisy intermediate scale quantum (NISQ) era.

quant-ph↗

arXiv2024

ZAP: Zoned Architecture and Performant Compiler for Field Programmable Atom Array

The scalability of neutral-atom quantum computing is increasingly limited by a compiler--architecture challenge: logical circuits must be mapped onto dynamically reconfigurable atom arrays while controlling crosstalk, transport overhead, and hardware constraints. To address this problem, we present ZAP, a co-designed zoned architecture and deterministic compiler for field-programmable atom arrays. ZAP partitions the array into storage and entanglement zones and combines hardware-aware ASAP-separate scheduling, look-ahead placement, and conflict-aware routing in a single-pass compilation flow, thereby avoiding the repeated global search used in prior approaches. Evaluated on structured quantum benchmarks and random 3-regular circuits, ZAP consistently delivers multi-order-of-magnitude compilation speedups while maintaining competitive or superior execution quality. Relative to ZAC and PowerMove, ZAP typically reduces compilation time from tens of seconds to below 0.1~s and achieves speedups exceeding 1,000$\times$; relative to Enola, the speedup exceeds 10,000$\times$ on the evaluated suite. ZAP's fidelity gains are most pronounced on structured workloads with irregular connectivity and nonuniform qubit reuse, where its scheduling and placement decisions more effectively suppress crosstalk and limit transport-related loss, while on random circuits it remains competitive and preserves the same scalability advantage. These results show that hardware-structured, non-iterative compilation provides a practical path toward fast, scalable, and noise-aware neutral-atom quantum computing.

quant-ph↗

arXiv2023

Demonstration of Maxwell Demon-assistant Einstein-Podolsky-Rosen Steering via Superconducting Quantum Processor

The concept of Maxwell demon plays an essential role in connecting thermodynamics and information theory, while entanglement and non-locality are fundamental features of quantum theory. Given the rapid advancements in the field of quantum information science, there is a growing interest and significance in investigating the connection between Maxwell demon and quantum correlation. The majority of research endeavors thus far have been directed towards the extraction of work from quantum correlation through the utilization of Maxwell demon. Recently, a novel concept called Maxwell demon-assistant Einstein-Podolsky-Rosen (EPR) steering has been proposed, which suggests that it is possible to simulate quantum correlation by doing work. This seemingly counterintuitive conclusion is attributed to the fact that Alice and Bob need classical communication during EPR steering task, a requirement that does not apply in the Bell test. In this study, we demonstrate Maxwell demon-assistant EPR steering with superconducting quantum circuits. By compiling and optimizing a quantum circuit to be implemented on a 2D superconducting chip, we were able to achieve a steering parameter of $S_{2} = 0.770 \pm 0.005$ in the case of two measurement settings, which surpasses the classical bound of $1/\sqrt{2}$ by 12.6 standard deviations. In addition, experimental observations have revealed a linear correlation between the non-locality demonstrated in EPR steering and the work done by the demon. Considering the errors in practical operation, the experimental results are highly consistent with theoretical predictions. Our findings not only suggest the presence of a Maxwell demon loophole in the EPR steering, but also contribute to a deeper comprehension of the interplay between quantum correlation, information theory, and thermodynamics.

quant-ph↗

arXiv2023

Proposal for Sequential Stern-Gerlach Experiment with Programmable Quantum Processors

The historical significance of the Stern-Gerlach experiment lies in its provision of the initial evidence for space quantization. Over time, its sequential form has evolved into an elegant paradigm that effectively illustrates the fundamental principles of quantum theory. To date, the practical implementation of the sequential Stern-Gerlach experiment has not been fully achieved. In this study, we demonstrate the capability of programmable quantum processors to simulate the sequential Stern-Gerlach experiment. The specific parametric shallow quantum circuits, which are suitable for the limitations of current noisy quantum hardware, are given to replicate the functionality of Stern-Gerlach devices with the ability to perform measurements in different directions. Surprisingly, it has been demonstrated that Wigner's Stern-Gerlach interferometer can be readily implemented in our sequential quantum circuit. With the utilization of the identical circuits, it is also feasible to implement Wheeler's delayed-choice experiment. We propose the utilization of cross-shaped programmable quantum processors to showcase sequential experiments, and the simulation results demonstrate a strong alignment with theoretical predictions. With the rapid advancement of cloud-based quantum computing, such as BAQIS Quafu, it is our belief that the proposed solution is well-suited for deployment on the cloud, allowing for public accessibility. Our findings not only expand the potential applications of quantum computers, but also contribute to a deeper comprehension of the fundamental principles underlying quantum theory.

quant-ph↗

arXiv2023

Digital Holographic Imaging via Direct Quantum Wavefunction Reconstruction

Wavefunction is a fundamental concept of quantum theory. Recent studies have shown surprisingly that wavefunction can be directly reconstructed via the measurement of weak value. The weak value based direct wavefunction reconstruction not only gives the operational meaning of wavefunction, but also provides the possibility of realizing holographic imaging with a totally new quantum approach. Here, we review the basic background knowledge of weak value based direct wavefunction reconstruction combined with recent experimental demonstrations. The main purpose of this work focuses on the idea of holographic imaging via direct wavefunction reconstruction. Since research on this topic is still in its early stage, we hope that this work can attract interest in the field of traditional holographic imaging. In addition, the wavefunction holographic imaging may find important applications in quantum information science.

quant-ph↗

arXiv2023

Information scrambling and entanglement in quantum approximate optimization algorithm circuits

Variational quantum algorithms, which consist of optimal parameterized quantum circuits, are promising for demonstrating quantum advantages in the noisy intermediate-scale quantum (NISQ) era. Apart from classical computational resources, different kinds of quantum resources have their contributions to the process of computing, such as information scrambling and entanglement. Characterizing the relation between the complexity of specific problems and quantum resources consumed by solving these problems is helpful for us to understand the structure of VQAs in the context of quantum information processing. In this work, we focus on the quantum approximate optimization algorithm (QAOA), which aims to solve combinatorial optimization problems. We study information scrambling and entanglement in QAOA circuits, respectively, and discover that for a harder problem, more quantum resource is required for the QAOA circuit to obtain the solution in most cases. We note that in the future, our results can be used to benchmark the complexity of quantum many-body problems by information scrambling or entanglement accumulation in the computing process.

quant-ph↗

arXiv2022

Scalable Simulation of Quantum Measurement Process with Quantum Computers

Recent development in quantum information sciences and technologies, especially building programmable quantum computers, provide us new opportunities to study fundamental aspects of quantum mechanics. We propose qubit models to emulate the quantum measurement process, in which the quantum information of a qubit is mapped to a collection of qubits acting as the measurement device. One model is motivated by single-photon detection and the other by spin measurement. Both models are scalable to generate Schrödinger cat-like state, and their corresponding quantum circuits are shown explicitly. Large-scale simulations could be realized in near-term quantum computers, while classical computers cannot perform the same task efficiently. Due to the scalability of the models, such simulations can help explore the quantum-to-classical boundary, if exists, in the quantum measurement problem. Besides, our protocol to generate cat states may have important applications in quantum computing and metrology.

quant-ph↗

arXiv2022

Measuring Small Longitudinal Phase Shifts via Weak Measurement Amplification

Weak measurement amplification, which is considered as a very promising scheme in precision measurement, has been applied to various small physical quantities estimation. Since many quantities can be converted to phase signal, it is thus interesting and important to consider measuring ultra-small longitudinal phase shifts by using weak measurement. Here, we propose and experimentally demonstrate a novel weak measurement amplification based ultra-small longitudinal phase estimation, which is suitable for polarization interferometry. We realize one order of magnitude amplification measurement of small phase signal directly introduced by Liquid Crystal Variable Retarder and show its robust to finite visibility of interference. Our results may find important applications in high-precision measurements, such as gravitational waves detection.

quant-ph↗

arXiv2022

Quantum circuit architecture search on a superconducting processor

Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the heuristic ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability, which may lead to the degraded performance when executed on the noisy intermediate-scale quantum (NISQ) machines. To address this issue, here we demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique, i.e., quantum architecture search (QAS), to enhance VQAs on an 8-qubit superconducting quantum processor. In particular, we apply QAS to tailor the hardware-efficient ansatz towards classification tasks. Compared with the heuristic ansatze, the ansatz designed by QAS improves test accuracy from 31% to 98%. We further explain this superior performance by visualizing the loss landscape and analyzing effective parameters of all ansatze. Our work provides concrete guidance for developing variable ansatze to tackle various large-scale quantum learning problems with advantages.

quant-ph↗

arXiv2021

Efficient Classical Computation of Quantum Mean Values for Shallow QAOA Circuits

The Quantum Approximate Optimization Algorithm (QAOA), which is a variational quantum algorithm, aims to give sub-optimal solutions of combinatorial optimization problems. It is widely believed that QAOA has the potential to demonstrate application-level quantum advantages in the noisy intermediate-scale quantum(NISQ) processors with shallow circuit depth. Since the core of QAOA is the computation of expectation values of the problem Hamiltonian, an important practical question is whether we can find an efficient classical algorithm to solve quantum mean value in the case of general shallow quantum circuits. Here, we present a novel graph decomposition based classical algorithm that scales linearly with the number of qubits for the shallow QAOA circuits in most optimization problems except for complete graph case. Numerical tests in Max-cut, graph coloring and Sherrington-Kirkpatrick model problems, compared to the state-of-the-art method, shows orders of magnitude performance improvement. Our results are not only important for the exploration of quantum advantages with QAOA, but also useful for the benchmarking of NISQ processors.

quant-ph↗

arXiv2021

Quantum Enhanced Interferometer for Kilohertz Gravitational Wave Detection

The gravitational wave detector of higher sensitivity and greater bandwidth in kilohertz window is required for future gravitational wave astronomy and cosmology. Here we present a new type broadband high frequency laser interferometer gravitational wave detector utilizing polarization of light as signal carrier. Except for Fabry-Perot cavity arms we introduce dual power recycling to further amplify the gravitational wave signals. A novel method of weak measurement amplification is used to amplify signals for detection and to guarantee the long-term run of detector. Equipped with squeezed light, the proposed detector is shown sensitive enough within the window from 300Hz to several kHz, making it suitable for the study of high frequency gravitational wave sources. With the proposed detector added in the current detection network, we show that the ability of exploring binary neutron stars merger physics be significantly improved. The detector presented here is expected to provide an alternative way of exploring the possible ground-based gravitational wave detector for the need of future research.

astro-ph.IM↗

arXiv2021

Maxwell Demon and Einstein-Podolsky-Rosen Steering

The study of Maxwell demon and quantum entanglement is important because of its foundational significance in physics and its potential applications in quantum information. Previous research on the Maxwell demon has primarily focused on thermodynamics, taking into account quantum correlations. Here we consider from another perspective and ask whether quantum non-locality correlations can be simulated by performing work. The Maxwell demon-assisted Einstein-Podolsky-Rosen (EPR) steering is thus proposed, which implies a new type of loophole. The application of Landauer's erasure principle suggests that the only way to close this loophole during a steering task is by continuously monitoring the heat fluctuation of the local environment by the participant. We construct a quantum circuit model of Maxwell demon-assisted EPR steering, which can be demonstrated by current programmable quantum processors, such as superconducting quantum computers. Based on this quantum circuit model, we obtain a quantitative formula describing the relationship between energy dissipation due to the work of the demon and quantum non-locality correlation. The result is of great physical interest because it provides a new way to explore and understand the relationship between quantum non-locality, information, and thermodynamics.

quant-ph↗

arXiv2021

Einstein-Podolsky-Rosen Steering in Two-sided Sequential Measurements with One Entangled Pair

Non-locality and quantum measurement are two fundamental topics in quantum theory and theirinterplay attracts intensive focus since the discovery of Bell theorem. Non-locality sharing amongmultiple observers is predicted and experimentally observed. However, only one-sided sequentialcase, i.e., one Alice and multiple Bobs is widely discussed and little is known about two-sided case.Here, we theoretically and experimentally explore the non-locality sharing in two-sided sequentialmeasurements case in which one entangled pair is distributed to multiple Alices and Bobs. Weexperimentally observed double EPR steering among four observers in the photonic system for thefirst time. In the case that all observers adopt the same measurement strength, it is observedthat double EPR steering can be demonstrated simultaneously while double Bell-CHSH inequalityviolations are shown to be impossible. The exact formula relating Bell quantity and sequential weakmeasurements for arbitrary many Alices and Bobs is also derived, showing that no more doubleBell-CHSH inequality violations is possible under unbiased input condition. The results not onlydeepen our understanding of relation between sequential measurements and non-locality but alsomay find important applications in quantum information tasks.

quant-ph↗

arXiv2019

Realization of the tradeoff between internal and external entanglement

We experimentally realize the internal and external entanglement tradeoff, which is a new kind of entanglement monogamy relation different from that usually discussed. Using a source of twin photons, we find that the external entanglement in polarization of twin photons, and the path-polarization internal entanglement of one photon, limit each other. In the extreme case, when the internal state is maximally entangled, the external entanglement must be vanishing, that illustrate entanglement monogamy. Our results of the experiment coincide with the theoretical predictions, and therefore provide a direct experimental observation of the internal and external entanglement monogamy relation.

quant-ph↗