arXiv subjects

Xiangdong Zeng

Publications and source records attributed to Xiangdong Zeng.

6 recordsLinked to original sources

arXiv2025

Jodes: Efficient Oblivious Join in the Distributed Setting

Trusted execution environment (TEE) has provided an isolated and secure environment for building cloud-based analytic systems, but it still suffers from access pattern leakages caused by side-channel attacks. To better secure the data, computation inside TEE enclave should be made oblivious, which introduces significant overhead and severely slows down the computation. A natural way to speed up is to build the analytic system with multiple servers in the distributed setting. However, this setting raises a new security concern -- the volumes of the transmissions among these servers can leak sensitive information to a network adversary. Existing works have designed specialized algorithms to address this concern, but their supports for equi-join, one of the most important but non-trivial database operators, are either inefficient, limited, or under a weak security assumption. In this paper, we present Jodes, an efficient oblivious join algorithm in the distributed setting. Jodes prevents the leakage on both the network and enclave sides, supports a general equi-join operation, and provides a high security level protection that only publicizes the input sizes and the output size. Meanwhile, it achieves both communication cost and computation cost asymptotically superior to existing algorithms. To demonstrate the practicality of Jodes, we conduct experiments in the distributed setting comprising 16 servers. Empirical results show that Jodes achieves up to a sixfold performance improvement over state-of-the-art join algorithms.

cs.CR↗

arXiv2024

Establishing a New Benchmark in Quantum Computational Advantage with 105-qubit Zuchongzhi 3.0 Processor

In the relentless pursuit of quantum computational advantage, we present a significant advancement with the development of Zuchongzhi 3.0. This superconducting quantum computer prototype, comprising 105 qubits, achieves high operational fidelities, with single-qubit gates, two-qubit gates, and readout fidelity at 99.90%, 99.62% and 99.18%, respectively. Our experiments with an 83-qubit, 32-cycle random circuit sampling on Zuchongzhi 3.0 highlight its superior performance, achieving one million samples in just a few hundred seconds. This task is estimated to be infeasible on the most powerful classical supercomputers, Frontier, which would require approximately $6.4\times 10^9$ years to replicate the task. This leap in processing power places the classical simulation cost six orders of magnitude beyond Google's SYC-67 and SYC-70 experiments [Nature 634, 328(2024)], firmly establishing a new benchmark in quantum computational advantage. Our work not only advances the frontiers of quantum computing but also lays the groundwork for a new era where quantum processors play an essential role in tackling sophisticated real-world challenges.

quant-ph↗

arXiv2024

CFT$_D$ from TQFT$_{D+1}$ via Holographic Tensor Network, and Precision Discretisation of CFT$_2$

We show that the path-integral of conformal field theories in $D$ dimensions (CFT$_D$) can be constructed by solving for eigenstates of an RG operator following from the Turaev-Viro formulation of a topological field theory in $D+1$ dimensions (TQFT$_{D+1}$), explicitly realising the holographic sandwich relation between a symmetric theory and a TQFT. Generically, exact eigenstates corresponding to symmetric-TQFT$_D$ follow from Frobenius algebra in the TQFT$_{D+1}$. For $D=2$, we constructed eigenstates that produce 2D rational CFT path-integral exactly, which, curiously connects a continuous field theoretic path-integral with the Turaev-Viro state sum. We also devise and illustrate numerical methods for $D=2,3$ to search for CFT$_D$ as phase transition points between symmetric TQFT$_D$. Finally since the RG operator is in fact an exact analytic holographic tensor network, we compute ``bulk-boundary'' correlator and compare with the AdS/CFT dictionary at $D=2$. Promisingly, they are numerically compatible given our accuracy, although further works will be needed to explore the precise connection to the AdS/CFT correspondence.

hep-th↗

arXiv2023

Bulk Operator Reconstruction in Topological Tensor Network and Generalized Free Fields

In this paper, we would like to study operator reconstruction in a class of holographic tensor networks describing renormalization group flows studied in arXiv:2210.12127. We study examples of 2d bulk holographic tensor networks constructed from Dijkgraaf-Witten theories and found that for both $\mathbb{Z}_n$ group and $S_3$ group the number of bulk operators behaving like a generalized free field in the bulk scales as the order of the group. We also generalize our study to 3d bulks and found the same scaling for $\mathbb{Z}_n$ theories. However, there is no generalized free field when the bulk comes from more generic fusion categories such as the Fibonacci model.

hep-th↗

arXiv2023

Virasoro Generators in the Fibonacci Model Tensor Network -- Tackling Finite Size Effects

In this paper, we extend the method implementing Virasoro operators in a tensor network we proposed in arXiv:2205.04500 and test it on the Fibonacci model, which is known to suffer from far more finite size effects. To pick up the "seed" state that would flow to the stress tensor in the thermodynamic limit, we make use of the topological idempotent that projects the transfer matrix to the trivial sector. Combined with an optimization method, the seed state can be identified. We demonstrate that the descendant states in the Fibonacci model can be correctly generated with this approximate stress tensor, giving further evidence that the method applies more generally.

cond-mat.str-el↗

arXiv2022

Virasoro and Kac-Moody algebra in generic tensor network representations of 2d critical lattice partition functions

In this paper, we propose a general implementation of the Virasoro generators and Kac-Moody currents in generic tensor network representations of 2-dimensional critical lattice models. Our proposal works even when a quantum Hamiltonian of the lattice model is not available, which is the case in many numerical computations involving numerical blockings. We tested our proposal on the 2d Ising model, and also the dimer model, which works to high accuracy even with a fairly small system size. Our method makes use of eigenstates of a small cylinder to generate descendant states in a larger cylinder, suggesting some intricate algebraic relations between lattice of different sizes.

cond-mat.str-el↗