YWYuyi Wang

Yuyi Wang

*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


Yuyi Wang has a total of 53 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Constrained Multi-Relational Hyper-Graphons with Maximum Entropy

    by Juan Alvarado, Jan Ramon, Yuyi Wang

    This work has two contributions. The first one is extending the Large Deviation Principle for uniform hyper-graphons from Lubetzky and Zhao \cite{lubetzky2015replica} to the multi-relational setting where each hyper-graphon can have different arities. This extension enables the formulation of the most typical possible world in Relational Probabilistic Logic with symmetric relational symbols in terms of entropy maximization subjected to constraints of quantum sub-hypergraph densities. The second contribution is to prove the most typical constrained multi-relational hyper-graphons (the most typical possible worlds) are computable by proving the solutions of the maximum entropy subjected by quantum sub-hypergraph densities in the space of multi-relational hyper-graphons are step functions except for in a zero measure set of combinations of quantum hyper-graphs densities with multiple relations. This result proves in a very general context the conjecture formulated by Radin et al.\ \cite{radin2014asymptotics} that states the constrained graphons with maximum entropy are step functions.

  • Room-Temperature Implementation of the Quantum Streaming Algorithm in a Single Solid-State Spin Qubit

    by Fei-Fei Yan, Zhen-Peng Xu, Qiang Li, Jun-Feng Wang, Ji-Yang Zhou, Wu-Xi Lin, Jin-Shi Xu, Yuyi Wang, Chuan-Feng Li, Guang-Can Guo

    Great challenges are encountered when solving problems based on continuously generated data streams due to the online data input fashion and limited memory space. Quantum properties are helpful in dealing with stream data. In this work, we design and experimentally implement a quantum streaming algorithm (QSA) with various lengths of input data in a single-defect spin system in silicon carbide at room temperature. We explore the schemes with trusted advice on the output results during the algorithm execution. Quite contrary to the classical case, outdated advice is still useful in the quantum case, as revealed by a proper performance function. Our work demonstrates the advantage of the QSA, which would be useful for investigating complex online problems. The room-temperature solid-state spin platform based on such a technological material opens the door for scalable quantum-information processing.


  • Ultrarobust support vector registration

    by Lei Yin, Chong Yu, Yuyi Wang, Bin Zou, Yuan Yan Tang


  • Open Access

    Space Complexity of Streaming Algorithms on Universal Quantum Computers

    by Yanglin Hu, Darya Melnyk, Yuyi Wang, Roger Wattenhofer

    Universal quantum computers are the only general purpose quantum computers known that can be implemented as of today. These computers consist of a classical memory component which controls the quantum memory. In this paper, the space complexity of some data stream problems, such as PartialMOD and Equality, is investigated on universal quantum computers. The quantum algorithms for these problems are believed to outperform their classical counterparts. Universal quantum computers, however, need classical bits for controlling quantum gates in addition to qubits. Our analysis shows that the number of classical bits used in quantum algorithms is equal to or even larger than that of classical bits used in corresponding classical algorithms. These results suggest that there is no advantage of implementing certain data stream problems on universal quantum computers instead of classical computers when space complexity is considered.

  • Open Access

    Quantum generative adversarial network for generating discrete distribution

    by Haozhen Situ, Zhimin He, Yuyi Wang, Lvzhou Li, Shenggen Zheng

    Quantum machine learning has recently attracted much attention from the community of quantum computing. In this paper, we explore the ability of generative adversarial networks (GANs) based on quantum computing. More specifically, we propose a quantum GAN for generating classical discrete distribution, which has a classical-quantum hybrid architecture and is composed of a parameterized quantum circuit as the generator and a classical neural network as the discriminator. The parameterized quantum circuit only consists of simple one-qubit rotation gates and two-qubit controlled-phase gates that are available in current quantum devices. Our scheme has the following characteristics and potential advantages: (i) It is intrinsically capable of generating discrete data (e.g., text data), while classical GANs are clumsy for this task due to the vanishing gradient problem. (ii) Our scheme avoids the input/output bottlenecks embarrassing most of the existing quantum learning algorithms that either require to encode the classical input data into quantum states, or output a quantum state corresponding to the solution instead of giving the solution itself, which inevitably compromises the speedup of the quantum algorithm. (iii) The probability distribution implicitly given by data samples can be loaded into a quantum state, which may be useful for some further applications.

  • Open Access

    Graph Hawkes Neural Network for Forecasting on Temporal Knowledge Graphs

    by Zhen Han, Yunpu Ma, Yuyi Wang, Stephan Günnemann, Volker Tresp

    The Hawkes process has become a standard method for modeling self-exciting event sequences with different event types. A recent work has generalized the Hawkes process to a neurally self-modulating multivariate point process, which enables the capturing of more complex and realistic impacts of past events on future events. However, this approach is limited by the number of possible event types, making it impossible to model the dynamics of evolving graph sequences, where each possible link between two nodes can be considered as an event type. The number of event types increases even further when links are directional and labeled. To address this issue, we propose the Graph Hawkes Neural Network that can capture the dynamics of evolving graph sequences and can predict the occurrence of a fact in a future time instance. Extensive experiments on large-scale temporal multi-relational databases, such as temporal knowledge graphs, demonstrate the effectiveness of our approach.


  • Open Access

    Target Location Problem for Multi-commodity Flow

    by Xingwu Liu, Zhida Pan, Yuyi Wang

    Motivated by scheduling in Geo-distributed data analysis, we propose a target location problem for multi-commodity flow (LoMuF for short). Given commodities to be sent from their resources, LoMuF aims at locating their targets so that the multi-commodity flow is optimized in some sense. LoMuF is a combination of two fundamental problems, namely, the facility location problem and the network flow problem. We study the hardness and algorithmic issues of the problem in various settings. The findings lie in three aspects. First, a series of NP-hardness and APX-hardness results are obtained, uncovering the inherent difficulty in solving this problem. Second, we propose an approximation algorithm for general undirected networks and an exact algorithm for undirected trees, which naturally induce efficient approximation algorithms on directed networks. Third, we observe separations between directed networks and undirected ones, indicating that imposing direction on edges makes the problem strictly harder. These results show the richness of the problem and pave the way to further studies.

  • Open Access

    Ride the Lightning: The Game Theory of Payment Channels

    by Zeta Avarikioti, Lioba Heimbach, Yuyi Wang, Roger Wattenhofer

    Payment channels were introduced to solve various eminent cryptocurrency scalability issues. Multiple payment channels build a network on top of a blockchain, the so-called layer 2. In this work, we analyze payment networks through the lens of network creation games. We identify betweenness and closeness centrality as central concepts regarding payment networks. We study the topologies that emerge when players act selfishly and determine the parameter space in which they constitute a Nash equilibrium. Moreover, we determine the social optima depending on the correlation of betweenness and closeness centrality. When possible, we bound the price of anarchy. We also briefly discuss the price of stability.