output
20182026
most citedExploring the Advantages of Quantum Generative Adversarial Networks in Generative Chemistry

88 citations

Showing quant-phShow all

24 papers · 1 filter

quant-ph2025★ 1 cited

Artificial intelligence for representing and characterizing quantum systems

Yuxuan Du, Yan Zhu, Yuan-Hang Zhang +8

Efficient characterization of large-scale quantum systems, especially those produced by quantum analog simulators and megaquop quantum computers, poses a central challenge in quant…

quant-ph2025★ 1 cited

TensorHyper-VQC: A Tensor-Train-Guided Hypernetwork for Robust and Scalable Variational Quantum Computing

Jun Qi, Chao-Han Huck Yang, Pin-Yu Chen +1

Variational Quantum Computing (VQC) faces fundamental scalability barriers, primarily due to barren plateaus and sensitivity to quantum noise. To address these challenges, we intro…

quant-ph2025★ 2 cited

Large Parts are Generically Entangled Across All Cuts

Mu-En Liu, Kai-Siang Chen, Chung-Yun Hsieh +2

Generic high-dimensional bipartite pure states are overwhelmingly likely to be highly entangled. Remarkably, this ubiquitous phenomenon can already arise in finite-dimensional syst…

quant-ph2025★ 1 cited

Almost device-independent calibration beyond Born's rule: Bell tests for cross-talk detection

Gelo Noel M. Tabia, Alex Yueh-Ting Shih, Jin-Yuan Zheng +1

In quantum information, device-independent protocols offer a new approach to information processing tasks, making minimal assumptions about the devices used. Typically, since these…

quant-ph2024★ 2 cited

Nonlocality of Quantum States can be Transitive

Kai-Siang Chen, Gelo Noel M. Tabia, Chung-Yun Hsieh +2

As a striking manifestation of quantum entanglement, nonlocality has long played a pivotal role in shaping our understanding of the quantum world. When considering a Bell test invo…

quant-ph2024★ 2 cited

Unconditionally separating noisy from bounded polynomial threshold circuits of constant depth

Min-Hsiu Hsieh, Leandro Mendes, Michael de Oliveira +1

The rapid evolution of quantum devices fuels concerted efforts to experimentally establish quantum advantage over classical computing. Many demonstrations of quantum advantage, how…

quant-ph2024★ 7 cited

Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits

Yuxuan Du, Min-Hsiu Hsieh, Dacheng Tao

The vast and complicated large-qubit state space forbids us to comprehensively capture the dynamics of modern quantum computers via classical simulations or quantum tomography. Rec…

quant-ph2024

Hybrid Quantum-Classical Clustering for Preparing a Prior Distribution of Eigenspectrum

Mengzhen Ren, Yu-Cheng Chen, Ching-Jui Lai +2

Determining the energy gap in a quantum many-body system is critical to understanding its behavior and is important in quantum chemistry and condensed matter physics. The challenge…

quant-ph2024

Quantum Walks on Simplicial Complexes and Harmonic Homology: Application to Topological Data Analysis with Superpolynomial Speedups

Ryu Hayakawa, Kuo-Chin Chen, Min-Hsiu Hsieh

This work investigates whether quantum walks on simplicial complexes exhibit quantum advantages. We introduce a novel quantum walk that encodes the combinatorial Laplacian, a key o…

quant-ph2024★ 7 cited

An invitation to the sample complexity of quantum hypothesis testing

Hao-Chung Cheng, Nilanjana Datta, Nana Liu +3

Quantum hypothesis testing (QHT) has been traditionally studied from the information-theoretic perspective, wherein one is interested in the optimal decay rate of error probabiliti…

quant-ph2023

Quantum Speedups for Multiproposal MCMC

Chin-Yi Lin, Kuo-Chin Chen, Philippe Lemey +3

Multiproposal Markov chain Monte Carlo (MCMC) algorithms choose from multiple proposals to generate their next chain step in order to sample from challenging target distributions m…

quant-ph2023★ 19 cited

Approximate reconstructability of quantum states and noisy quantum secret sharing schemes

Yingkai Ouyang, Kaumudibikash Goswami, Jacquiline Romero +3

We introduce and analyse approximate quantum secret sharing in a formal cryptographic setting, wherein a dealer encodes and distributes a quantum secret to players such that author…

quant-ph2023★ 1 cited

One-Shot Distributed Source Simulation: As Quantum as it Can Get

Ian George, Min-Hsiu Hsieh, Eric Chitambar

Distributed source simulation is the task where two (or more) parties share some correlated randomness and use local operations and no communication to convert this into some targe…

quant-ph2022★ 5 cited

A new operator extension of strong subadditivity of quantum entropy

Ting-Chun Lin, Isaac H. Kim, Min-Hsiu Hsieh

Let be the von Neumann entropy of a density matrix . Weak monotonicity asserts that for any tripartite density matrix $ρ_{…

quant-ph2022★ 13 cited

Doubling the order of approximation via the randomized product formula

Chien Hung Cho, Dominic W. Berry, Min-Hsiu Hsieh

Randomization has been applied to Hamiltonian simulation in a number of ways to improve the accuracy or efficiency of product formulas. Deterministic product formulas are often con…

quant-ph2022★ 88 cited

Exploring the Advantages of Quantum Generative Adversarial Networks in Generative Chemistry

Po-Yu Kao, Ya-Chu Yang, Wei-Yin Chiang +8

De novo drug design with desired biological activities is crucial for developing novel therapeutics for patients. The drug development process is time and resource-consuming, and i…

quant-ph2022★ 17 cited

Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits

Chin-Yi Cheng, Chien-Yi Yang, Yi-Hsiang Kuo +3

Qubit Mapping is a critical aspect of implementing quantum circuits on real hardware devices. Currently, the existing algorithms for qubit mapping encounter difficulties when deali…

quant-ph2022★ 15 cited

Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels

Hao-Chung Cheng

Achievability in information theory refers to demonstrating a coding strategy that accomplishes a prescribed performance benchmark for the underlying task. In quantum information t…

quant-ph2022★ 9 cited

Resource Marginal Problems

Chung-Yun Hsieh, Gelo Noel M. Tabia, Yu-Chun Yin +1

We introduce the resource marginal problems, which concern the possibility of having a resource-free target subsystem compatible with a given collection of marginal density matrice…

quant-ph2021★ 46 cited

Qubit-efficient encoding scheme for quantum simulations of electronic structure

Yu Shee, Pei-Kai Tsai, Cheng-Lin Hong +2

Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits. Common encoding methods transform a fermionic system of spin-orbitals…

quant-ph2021★ 36 cited

Learning quantum circuits of some gates

Ching-Yi Lai, Hao-Chung Cheng

In this paper, we study the problem of learning an unknown quantum circuit of a certain structure. If the unknown target is an -qubit Clifford circuit, we devise an efficient al…

quant-ph2020★ 11 cited

Discrimination of quantum states under locality constraints in the many-copy setting

Hao-Chung Cheng, Andreas Winter, Nengkun Yu

We study quantum hypothesis testing between orthogonal states under restricted local measurements in the many-copy scenario. For testing arbitrary multipartite entangled pure state…

quant-ph2020★ 7 cited

One-Shot Hybrid State Redistribution

Eyuri Wakakuwa, Yoshifumi Nakata, Min-Hsiu Hsieh

We consider state redistribution of a "hybrid" information source that has both classical and quantum components. The sender transmits classical and quantum information at the same…

quant-ph2018★ 19 cited

Properties of Noncommutative Renyi and Augustin Information

Hao-Chung Cheng, Li Gao, Min-Hsiu Hsieh

Rényi and Augustin information are generalizations of mutual information defined via the Rényi divergence, playing a significant role in evaluating the performance of information p…