88 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- National Taiwan UniversityTW11 papers
- National Center for Theoretical SciencesTW10 papers
- National Center for Theoretical Sciences, Physics Division8 papers
- National Cheng Kung UniversityTW5 papers
- National Yang Ming Chiao Tung UniversityTW4 papers
- Perimeter InstituteCA4 papers
- University of California San DiegoUS4 papers
- Centre for Quantum TechnologiesSG3 papers
- National University of SingaporeSG3 papers
- University of BristolGB3 papers
- Foxconn (United States)US2 papers
- Georgia Institute of TechnologyUS2 papers
29 papers
Equivalence Checking of Quantum Circuits via Path-Sum and Weighted Model Counting
Wei-Jia Huang, Christophe Chareton, Yu-Fang Chen +4
Equivalence checking of quantum circuits is a central verification task in quantum computing, ensuring the correctness of circuit optimizations, hardware mappings, and compilation…
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…
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…
On Araki-Type Trace Inequalities
Po-Chieh Liu, Hao-Chung Cheng
In this paper, we prove a trace inequality for any positive and monotone increasing function , $s\in[0,…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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 $ρ_{…
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…
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…
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…
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…
Accelerating Polarization via Alphabet Extension
Iwan Duursma, Ryan Gabrys, Venkatesan Guruswami +2
Polarization is an unprecedented coding technique in that it not only achieves channel capacity, but also does so at a faster speed of convergence than any other coding technique.…
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…
On the Capacity of Zero-Drift First Arrival Position Channels in Diffusive Molecular Communication
Yen-Chi Lee, Min-Hsiu Hsieh
Recent advancements in understanding the impulse response of the first arrival position (FAP) channel in molecular communication (MC) have illuminated its Shannon capacity. While L…
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…