SearcharxivSearch

arXiv subjects

Zizhu Wang

Publications and source records attributed to Zizhu Wang.

At least 19 recordsLinked to original sources

Operational Concealment of Measurement Incompatibility by Quantum Channels: Rank Loss versus Contraction

Quantum measurements can remain incompatible yet become impossible to certify when all probe states first pass through a quantum channel. We formulate this loss of certifiability as operational concealment and identify its exact finite-dimensional threshold. Under tomographically complete input access, a channel conceals some incompatible binary POVM pair if and only if its Heisenberg adjoint has nontrivial kernel. Thus, in this channel restricted single-use setting, rank loss rather than contraction is the universal transition for exact concealment: injective dissipative dynamics may render the effective measurements compatible while leaving exact concealment impossible. We quantify this distinction through a minimum-gain lower bound and show that regular time-local dynamics cannot produce exact concealment at finite time. We then classify all qubit channels whose adjoint fibres admit a positive unital retraction, reducing concealment to ordinary joint measurability of canonical representatives. For orthogonal projected qubit measurements we obtain an exact robustness formula and a strict separation from ordinary incompatibility robustness. Finally, quotient-space duality expresses this robustness as an experimentally accessible additive advantage in positive-payoff channel-output games. We also prove invariance under adjoining a passive finite-dimensional reference system for lifted target measurements, even when arbitrary joint compatible simulators are allowed on the enlarged output space. These results establish rank-sensitive criteria for certifying measurement incompatibility under restricted channel access.

quant-ph

Contextuality as a Diagnostic of Translation-Symmetry Breaking in Translation-Invariant 1D Hamiltonians

Bell- and contextuality-type inequalities have become practical probes of many-body quantum correlations, often involving only few-body correlators and quantities with a direct Hamiltonian interpretation such as an energy density. Here we investigate the mechanism by which translation-invariant Hamiltonians generated from representative families of contextuality witnesses organize their ground-state structure in infinite one-dimensional systems. For the witness families considered, maximal quantum violation is realized by ground-state sectors with commensurate enlarged unit cells: the Hamiltonians are invariant under one-site translations, while the optimal ground states are $p$-periodic with $p>1$. At the corresponding classical-bound points, the ground-state sectors are highly degenerate and support many commensurate periods. Along the interpolation paths analyzed in this work, entering the contextual regime is accompanied by the lifting of this classical period degeneracy in favor of a quantum-selected period. We also identify finite periodic-boundary-condition benchmarks at the selected periods: for each model studied, the finite-ring witness reproduces the same classical bound and quantum value as the corresponding infinite-chain witness, and in several cases the resulting finite inequalities are tight. These reductions turn the infinite-chain contextuality certification into compact energy-estimation benchmarks requiring only local correlator measurements. We establish the mechanism analytically in representative two- and three-body witness models and corroborate it more broadly using translation-invariant semidefinite-program relaxations together with variational matrix-product-state calculations.

quant-ph

Symmetrized Block-Product Periodic Marginals in Infinite Translation-Invariant Quantum Chains

We study local marginals in one-dimensional translation-invariant quantum systems that may hide finite-period structure. Given an $n$-site reduced density matrix, we ask whether it can be obtained by repeating a finite $p$-site block state along the chain and averaging over the $p$ lattice translations. This defines a symmetrized block-product periodic marginal problem, which provides a route both to diagnosing hidden periodic order from local data and to upper bounding ground-state energy densities of infinite translation-invariant local Hamiltonians. We develop two complementary methods. The first is a semidefinite-programming relaxation based on block permutation symmetry and positive partial transpose constraints, which outer-approximates the convex hull of such marginals and yields certified infeasibility tests. The second is a symmetrized matrix product state ansatz, which constructs explicit block-product periodic states and gives variational upper bounds. We benchmark the framework on the Majumdar-Ghosh model, transverse-field Ising, XX, XXZ, and contextuality-related spin models. The results show that the method captures the expected finite-period structure in exactly solvable cases and gives systematically improving variational energies as the period and bond dimension increase. We also formulate a periodic-NPA relaxation for translation-invariant contextuality witnesses and recover the known quantum limits in the tested examples.

quant-ph

Local-Observable-Guided Generative Quantum Circuits for Degenerate Ground Spaces

Searching for degenerate ground spaces in quantum many-body systems is central to understanding spontaneous symmetry breaking and topological order. Although existing numerical methods can approximate individual ground states with high accuracy, recovering the full degenerate space remains a substantial challenge. Here we tackle this problem using a hybrid generative quantum circuit that combines a classical generative model with an expressive parameterized quantum circuit (PQC). The classical model learns a distribution over PQC parameters, enabling the sampling of an ensemble of ground states, while the PQC ensures compatibility with quantum hardware. To promote both low energy and state diversity, we define an energy-diversity objective composed of an energy-minimization term and cosine-similarity penalties derived from local observable correlators. These local descriptors provide a scalable, measurement-efficient means of distinguishing distinct ground states. We benchmark the framework on the Majumdar-Ghosh model, the Affleck-Kennedy-Lieb-Tasaki model, and the spin-1 XXZ chain, which realize distinct mechanisms of degeneracy. In all cases, the method produces a diverse ensemble whose linear span accurately reproduces the target ground space, in some instances, it identifies an approximately orthogonal basis within the learned ensemble. We further show that the framework remains robust under shot-based estimation and can still recover the degenerate ground space with a reduced measurement budget.

quant-ph

Harnessing Non-convex Quantum Correlations of Independent Qubits

Quantum correlations in Bell and prepare-and-measure experiments are central resources for probing nonclassicality and enabling device-based quantum information protocols. In the absence of shared public randomness (i.e., without run-to-run mixing), even qubit correlation sets are typically non-convex, making standard convex characterizations inadequate. Here we derive qubit-specific constraints from uncertainty relations, yielding a state-independent consistency test for observed statistics in both prepare-and-measure and Bell scenarios. The test captures explicit non-convex boundaries in representative correlation families and enables correlation-based device inference by constraining (and sometimes uniquely determining) unitary-invariant measurement parameters even away from extreme points. Moreover, incorporating the inferred qubit constraints as additional conditions in a moment-matrix relaxation strengthens separability tests and can certify entanglement even for Bell-local correlations within the independent-device model. These tools provide a practical route to characterize and leverage low-dimensional quantum devices, including certification, randomness generation, and entanglement verification.

quant-ph

Variational Optimization for Quantum Problems using Deep Generative Networks

Optimization drives advances in quantum science and machine learning, yet most generative models aim to mimic data rather than to discover optimal answers to challenging problems. Here we present a variational generative optimization network that learns to map simple random inputs into high quality solutions across a variety of quantum tasks. We demonstrate that the network rapidly identifies entangled states exhibiting an optimal advantage in entanglement detection when allowing classical communication, attains the ground state energy of an eighteen spin model without encountering the barren plateau phenomenon that hampers standard hybrid algorithms, and-after a single training run-outputs multiple orthogonal ground states of degenerate quantum models. Because the method is model agnostic, parallelizable and runs on current classical hardware, it can accelerate future variational optimization problems in quantum information, quantum computing and beyond.

quant-ph

Experimental Characterization of Quantumness Using the Uncertainty Principle, Coherence, and Nonlocality

Heisenberg's uncertainty principle, coherence and Bell nonlocality have been individually examined through many experiments. In this Letter, we systematically characterize all of this quantumness in a unified manner. We first construct universal uncertainty relations to reveal intrinsic features of incompatible measurements, which include all the state-independent uncertainties as special cases. We further extend to witness both quantum coherence and Bell nonlocality. We finally perform experiments with unified two-photon states, and validate the uncertainty principle, coherence and Bell nonlocality within the experimental error. Our methods for witnessing quantumness are valuable in characterizing quantum correlations in quantum information processing.

quant-ph

Cost of Locally Approximating High-Dimensional Ground States of Contextual Quantum Models

Contextuality, one of the strongest forms of quantum correlations, delineates the quantum world and the classical one. It has been shown recently that some quantum models, in the form of infinite one-dimensional translation-invariant Hamiltonians with nearest- and next-to-nearest-neighbor interactions, have the lowest ground state energy density allowed in quantum physics. However, these models all have local Hilbert space dimension larger than two, making the study of their ground state behavior difficult on current qubit-based variational quantum simulation platforms. In this work, we focus on the cost of simulating the local approximations of ground states of these models using qubit-based parameterized quantum circuits. The local approximations, which are 3-site reduced density matrices with local Hilbert space dimension three, are purified then encoded into permutation-symmetric qubits. We develop a universal set of permutation-symmetry preserving qubit-based gates, using them as an ansatz to simulate parameterized quantum circuits designed for qutrits. These techniques allow us to assess the accuracy of simulating the purified local ground states with respect to a fixed amount of classical and quantum resources. We found that given the same quantum circuit and the number of iterations, more contextual ground states with lower energy density are easier to simulate.

quant-ph

Practical Advantage of Classical Communication in Entanglement Detection

Entanglement is the cornerstone of quantum communication, yet conventional detection relies solely on local measurements. In this work, we present a unified theoretical and experimental framework demonstrating that one-way local operations and classical communication (1-LOCC) can significantly outperform purely local measurements in detecting high-dimensional quantum entanglement. By casting the entanglement detection problem as a semidefinite program (SDP), we derive protocols that minimize false negatives at fixed false-positive rates. A variational generative machine-learning algorithm efficiently searches over high-dimensional parameter spaces, identifying states and measurement strategies that exhibit a clear 1-LOCC advantage. Experimentally, we realize a genuine event-ready protocol on a three-dimensional photonic entanglement source, employing fiber delays as short-lived quantum memories. We implement rapid, FPGA-based sampling of the optimized probabilistic instructions, allowing Bob's measurement settings to adapt to Alice's outcomes in real time. Our results validate the predicted 1-LOCC advantage in a realistic noisy setting and reduce the experimental trials needed to certify entanglement. These findings mark a step toward scalable, adaptive entanglement detection methods crucial for quantum networks and computing, paving the way for more efficient generation and verification of high-dimensional entangled states.

quant-ph

Causality and Duality in Multipartite Generalized Probabilistic Theories

Causality is one of the most fundamental notions in physics. Generalized probabilistic theories (GPTs) and the process matrix framework incorporate it in different forms. However, a direct connection between these frameworks remains unexplored. By demonstrating the duality between no-signaling principle and classical processes in tripartite classical systems, and extending some results to multipartite systems, we first establish a strong link between these two frameworks, which are two sides of the same coin. This provides an axiomatic approach to describe the measurement space within both box world and local theories. Furthermore, we describe a logically consistent 4-partite classical process acting as an extension of the quantum switch. By incorporating more than two control states, it allows both parallel and serial application of operations. We also provide a device-independent certification of its quantum variant in the form of an inequality.

quant-ph

MindSpore Quantum: A User-Friendly, High-Performance, and AI-Compatible Quantum Computing Framework

We introduce MindSpore Quantum, a pioneering hybrid quantum-classical framework with a primary focus on the design and implementation of noisy intermediate-scale quantum (NISQ) algorithms. Leveraging the robust support of MindSpore, an advanced open-source deep learning training/inference framework, MindSpore Quantum exhibits exceptional efficiency in the design and training of variational quantum algorithms on both CPU and GPU platforms, delivering remarkable performance. Furthermore, this framework places a strong emphasis on enhancing the operational efficiency of quantum algorithms when executed on real quantum hardware. This encompasses the development of algorithms for quantum circuit compilation and qubit mapping, crucial components for achieving optimal performance on quantum processors. In addition to the core framework, we introduce QuPack, a meticulously crafted quantum computing acceleration engine. QuPack significantly accelerates the simulation speed of MindSpore Quantum, particularly in variational quantum eigensolver (VQE), quantum approximate optimization algorithm (QAOA), and tensor network simulations, providing astonishing speed. This combination of cutting-edge technologies empowers researchers and practitioners to explore the frontiers of quantum computing with unprecedented efficiency and performance.

quant-ph

A sequentially generated variational quantum circuit with polynomial complexity

Variational quantum algorithms have been a promising candidate to utilize near-term quantum devices to solve real-world problems. The powerfulness of variational quantum algorithms is ultimately determined by the expressiveness of the underlying quantum circuit ansatz for a given problem. In this work, we propose a sequentially generated circuit ansatz, which naturally adapts to 1D, 2D, 3D quantum many-body problems. Specifically, in 1D our ansatz can efficiently generate any matrix product states with a fixed bond dimension, while in 2D our ansatz generates the string-bond states. As applications, we demonstrate that our ansatz can be used to accurately reconstruct unknown pure and mixed quantum states which can be represented as matrix product states, and that our ansatz is more efficient compared to several alternatives in finding the ground states of some prototypical quantum many-body systems as well as quantum chemistry systems, in terms of the number of quantum gate operations.

quant-ph

Contextuality in infinite one-dimensional translation-invariant local Hamiltonians: strengths and limits

In recent years there has been a growing interest in treating many-body systems as Bell scenarios, where lattice sites play the role of distant parties and only near-neighbor statistics are accessible. We investigate contextuality arising from three Bell scenarios in infinite, translation-invariant 1D models: nearest-neighbor with two dichotomic observables per site; nearest- and next-to-nearest neighbor with two dichotomic observables per site and nearest-neighbor with three dichotomic observables per site. For the first scenario, we give strong evidence that it cannot exhibit contextuality, not even in non-signaling physical theories beyond quantum mechanics. For the second one, we identify several low-dimensional models that reach the ultimate quantum limits, paving the way for self-testing ground states of quantum many-body systems. For the last scenario, which generalizes the Heisenberg model, we give strong evidence that, in order to exhibit contextuality, the dimension of the local quantum system must be at least 3.

quant-ph

Testing real quantum theory in an optical quantum network

Quantum theory is commonly formulated in complex Hilbert spaces. However, the question of whether complex numbers need to be given a fundamental role in the theory has been debated since its pioneering days. Recently it has been shown that tests in the spirit of a Bell inequality can reveal quantum predictions in entanglement swapping scenarios that cannot be modelled by the natural real-number analog of standard quantum theory. Here, we tailor such tests for implementation in state-of-the-art photonic systems. We experimentally demonstrate quantum correlations in a network of three parties and two independent EPR sources that violate the constraints of real quantum theory by over $4.5$ standard deviations, hence disproving real quantum theory as a universal physical theory.

quant-ph

Optimized detection of high-dimensional entanglement

Entanglement detection is one of the most conventional tasks in quantum information processing. While most experimental demonstrations of high-dimensional entanglement rely on fidelity-based witnesses, these are powerless to detect entanglement within a large class of entangled quantum states, the so-called unfaithful states. In this paper, we introduce a highly flexible automated method to construct optimal tests for entanglement detection given a bipartite target state of arbitrary dimension, faithful or unfaithful, and a set of local measurement operators. By restricting the number or complexity of the considered measurement settings, our method outputs the most convenient protocol which can be implemented using a wide range of experimental techniques such as photons, superconducting qudits, cold atoms or trapped ions. With an experimental quantum optics setup that can prepare and measure arbitrary high-dimensional mixed states, we implement some $3$-setting protocols generated by our method. These protocols allow us to experimentally certify 2- and 3-unfaithful entanglement in 4-dimensional photonic states, some of which contain well above 50% of noise.

quant-ph

Verification of a resetting protocol for an uncontrolled superconducting qubit

Quantum resetting protocols allow a quantum system to be sent to a state in the past by making it interact with quantum probes when neither the free evolution of the system nor the interaction is controlled. We experimentally verify the simplest non-trivial case of a quantum resetting protocol, known as the $\mathcal{W}_4$ protocol, with five superconducting qubits, testing it with different types of free evolutions and target-probe interactions. After projection, we obtained a reset state fidelity as high as $0.951$, and the process fidelity was found to be $0.792$. We also implemented 100 randomly-chosen interactions and demonstrated an average success probability of $0.323$ for $|1\rangle$ and $0.292$ for $|-\rangle$, experimentally confirmed the nonzero probability of success for unknown interactions; the numerical simulated values are about $0.3$. Our experiment shows that the simplest quantum resetting protocol can be implemented with current technologies, making such protocols a valuable tool in the eternal fight against unwanted evolution in quantum systems.

quant-ph

Photonic realization of quantum resetting

Contrary to the usual assumption of at least partial control of quantum dynamics, a surprising recent result proved that an arbitrary quantum state can be probabilistically reset to a state in the past by having it interact with probing systems in a consistent, but $uncontrolled$ way. We present a photonic implementation to achieve this resetting process, experimentally verifying that a state can be probabilistically reset to its past with a fidelity of $0.870\pm0.012$. We further demonstrate the preservation of an entangled state, which still violates a Bell inequality, after half of the entangled pair was reset. The ability to reset uncontrolled quantum states has implications in the foundations of quantum physics and applications in areas of quantum technology.

quant-ph

Two Dimensional Translation-Invariant Probability Distributions: Approximations, Characterizations and No-Go Theorems

We study the properties of the set of marginal distributions of infinite translation-invariant systems in the 2D square lattice. In cases where the local variables can only take a small number $d$ of possible values, we completely solve the marginal or membership problem for nearest-neighbors distributions ($d=2,3$) and nearest and next-to-nearest neighbors distributions ($d=2$). Remarkably, all these sets form convex polytopes in probability space. This allows us to devise an algorithm to compute the minimum energy per site of any TI Hamiltonian in these scenarios exactly. We also devise a simple algorithm to approximate the minimum energy per site up to arbitrary accuracy for the cases not covered above. For variables of a higher (but finite) dimensionality, we prove two no-go results. To begin, the exact computation of the energy per site of arbitrary TI Hamiltonians with only nearest-neighbor interactions is an undecidable problem. In addition, in scenarios with $d\geq 2947$, the boundary of the set of nearest-neighbor marginal distributions contains both flat and smoothly curved surfaces and the set itself is not semi-algebraic. This implies, in particular, that it cannot be characterized via semidefinite programming, even if we allow the input of the program to include polynomials of nearest-neighbor probabilities.

math-ph