23
collaborators
2021–2026
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
1 Talk
| Title | Conference | Type | Co-authors |
|---|---|---|---|
|
Pseudorandom unitaries are neither real nor sparse nor noise-robust ↗
|
TQC 2024 | regular ▸ presenter | Kishor Bharti, Dax Enshan Koh |
Pseudorandom quantum states (PRSs) and pseudorandom unitaries (PRUs) possess the dual nature of being efficiently constructible while appearing completely random to any efficient quantum algorithm. In this study, we establish fundamental bounds on pseudorandomness. We show that PRSs and PRUs exist only when the probability that an error occurs is negligible, ruling out their generation on noisy intermediate-scale and early fault-tolerant quantum computers. Further, we show that PRUs need imaginarity while PRS do not have this restriction. This implies that quantum randomness requires in general a complex-valued formalism of quantum mechanics, while for random quantum states real numbers suffice. Additionally, we derive lower bounds on the coherence of PRSs and PRUs, ruling out the existence of sparse PRUs and PRSs. We also show that the notions of PRS, PRUs and pseudorandom scramblers (PRSSs) are distinct in terms of resource requirements. We introduce the concept of pseudoresources, where states which contain a low amount of a given resource masquerade as high-resource states. We define pseudocoherence, pseudopurity and pseudoimaginarity, and identify three distinct types of pseudoresources in terms of their masquerading capabilities. Our work also establishes rigorous bounds on the efficiency of property testing, demonstrating the exponential complexity in distinguishing real quantum states from imaginary ones, in contrast to the efficient measurability of unitary imaginarity. Lastly, we show that the transformation from a complex to a real model of quantum computation is inefficient, in contrast to the reverse process, which is efficient. Our results establish fundamental limits on property testing and provide valuable insights into quantum pseudorandomness. |
|||
8 Posters
| Title | Conference | Co-authors |
|---|---|---|
| Quantum Error Correction in adversarial regimes | QIP 2026 | ▸Rahul Arvind, Nikhil Bansal, Dax Enshan Koh, Kishor Bharti |
| Efficient witnessing and testing of magic in mixed quantum states | QIP 2026 | Poetri Sonya Tarabunga |
| Exponential Speed-ups for Structured Goemans-Williamson relaxations via Quantum Gibbs States and Pauli Sparsity | QIP 2026 | ▸Daniel Stilck França, Haomu Yuan, Egor Tiunov, Ilia Luchnikov, Leandro Aolita |
| Qudit low-density parity-check codes | QIP 2026 | ▸Daniel J. Spencer, Andrew Tanggara, Derek Khu, Kishor Bharti |
| Understanding generalization with quantum geometry | TQC 2024 | Myungshik Kim |
| Efficient stabilizer entropies for quantum computers | TQC 2024 | Soovin Lee, Myungshik Kim |
| Efficient measures of magic for quantum computers and matrix product states | QIP 2023 | Myungshik Kim, Lorenzo Piroli |
| On-Chip Quantum Autoencoder for Teleportation of High-Dimensional Quantum States | QCRYPT 2021 | Hui Zhang, Lingxiao Wan, Wai-Keong Mok, Hong Cai, Muhammad Faeyz Karim, Kwek Leong Chuan, Ai Qun Liu |
Currently most quantum teleportation experiments are based on qubits. Here, we demonstrate a quantum autoencoder assisted teleportation for high-dimensional quantum states. Our method of training the autoencoder allows us to take a finite sample of those states, learn how to compress them to qubits with nearly unit fidelity. After training, we can teleport any further states from the sender and reconstruct them with high fidelity on the receiver part. We verify the proposed scheme by teleporting a qutrit via a silicon-photonic chip. High fidelity is achieved between the input qutrit and the qutrit recovered from the teleported qubit. |
||
Collaborators
| Co-author | Joint talks |
|---|---|
| Kishor Bharti | 3 |
| Myungshik Kim | 3 |
| Dax Enshan Koh | 2 |
| Ai Qun Liu | 1 |
| Andrew Tanggara | 1 |
| Daniel J. Spencer | 1 |
| Daniel Stilck França | 1 |
| Derek Khu | 1 |
| Egor Tiunov | 1 |
| Haomu Yuan | 1 |
| Hong Cai | 1 |
| Hui Zhang | 1 |
| Ilia Luchnikov | 1 |
| Kwek Leong Chuan | 1 |
| Leandro Aolita | 1 |
| Lingxiao Wan | 1 |
| Lorenzo Piroli | 1 |
| Muhammad Faeyz Karim | 1 |
| Nikhil Bansal | 1 |
| Poetri Sonya Tarabunga | 1 |