Accepted posters

@Poster{P24_410,

title = {Transition of Anticoncentration in Gaussian Boson Sampling},

author = {Adam Ehrenberg and Joseph Iosue and Abhinav Deshpande and Dominik Hangleiter and Alexey Gorshkov},

year  = {2024},

date = {2024-01-01},

keywords = {Outstanding Poster, Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_366,

title = {Tropological Bell Nonlocality: Topologically-induced Bell's nonlocality with tropical algebra},

author = {Patrick Emonts and Mengyao Hu and Albert Aloy and Jordi Tura Brugués},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_377,

title = {Uncertainty relations from state polynomial optimization},

author = {Moisés Bermejo and Felix Huber},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_211,

title = {Unclonable Commitments and Proofs},

author = {Vipul Goyal and Giulio Malavolta and Justin Raizes},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_151,

title = {Unclonable Cryptography with Unbounded Collusions & Impossibility of Hyperefficient Shadow Tomography},

author = {Alper Çakan and Vipul Goyal},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_158,

title = {Unclonable Non-Interactive Zero-Knowledge},

author = {Ruta Jawale and Dakshita Khurana},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_246,

title = {Unclonable Secret Sharing},

author = {Prabhanjan Ananth and Vipul Goyal and Jiahui Liu and Qipeng Liu},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_102,

title = {Uncloneable Quantum Advice},

author = {Anne Broadbent and Martti Karvonen and Sébastien Lord},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_54,

title = {Unconditional quantum MAGIC advantage in shallow circuit computation},

author = {Xingjian Zhang and Zhaokai Pan and Guoding Liu},

url = {https://arxiv.org/abs/2402.12246},

year  = {2024},

date = {2024-01-01},

abstract = {Quantum theory promises computational speed-ups than classical means. The celebrated Gottesman-Knill Theorem implies that the full power of quantum computation resides in the specific resource of ``magic'' states — the secret sauce to establish universal quantum computation. However, it is still questionable whether ``magic'' indeed brings the believed quantum advantage, ridding unproven complexity assumptions or black-box oracles. In this work, we demonstrate the first unconditional magic advantage: a separation between the power of generic constant-depth or ``shallow'' quantum circuits and magic-free counterparts. For this purpose, we link the shallow circuit computation with the strongest form of quantum nonlocality — quantum ``pseudo-telepathy,'' where distant non-communicating observers generate perfectly synchronous statistics. We prove quantum magic is indispensable for such correlated statistics in a specific nonlocal game inspired by the linear binary constraint system. Then, we translate generating quantum pseudo-telepathy into a relation problem, where magic is necessary for a shallow circuit to solve it perfectly. As a by-product, we provide an efficient algorithm to solve a general linear binary constraint system over the Pauli group, in contrast to the broad undecidability in constraint systems. We anticipate our results will enlighten the final establishment of the unconditional advantage of universal quantum computation.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_74,

title = {Understanding generalization with quantum geometry},

author = {Tobias Haug and Myungshik Kim},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_18,

title = {Understanding quantum machine learning also requires rethinking generalization},

author = {Elies Gil-Fuster and Jens Eisert and Carlos Bravo-Prieto},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_558,

title = {Understanding the power and simulability of Quantum Convolutional Neural Networks},

author = {Pablo Bermejo and Paolo Braccia and Marco Cerezo and Manuel Rudolph and Zoe Holmes and Lukasz Cincio},

url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1717199309-poster-TQC_2024_extended-abstract_558.pdf},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_283,

title = {Unified frameworks for uniform continuity of entropic quantities},

author = {Andreas Bluhm and Ángela Capel and Paul Gondolf and Tim Möbus and Antonio Pérez Hernández},

year  = {2024},

date = {2024-01-01},

keywords = {Outstanding Poster, Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_497,

title = {Unified Quantum State Tomography and Hamiltonian Learning Using Transformer Models: A Language-Translation-Like Approach for Quantum Systems},

author = {Zheng An and Jiahui Wu and Muchun Yang and D. L. Zhou and Bei Zeng},

url = {https://link.aps.org/doi/10.1103/PhysRevApplied.21.014037},

year  = {2024},

date = {2024-01-01},

abstract = {As quantum technology rapidly advances, the need for efficient scalable methods to characterize quantum systems intensifies. Quantum state tomography and Hamiltonian learning are essential for interpreting and optimizing quantum systems, yet a unified approach remains elusive. Such an integration could enhance our understanding of the complex relationship between quantum states and Hamiltonians, contributing to the development of more efficient methodologies. In this paper, we present a method that integrates quantum state tomography and Hamiltonian learning, drawing inspiration from machine translation in the field of natural language processing (NLP). We demonstrate the effectiveness of our approach across a variety of quantum systems, successfully learning the complex relationships between quantum states and Hamiltonians. Furthermore, the scalability and few-shot learning capabilities of our method could potentially minimize the resources required for characterizing and optimizing quantum systems. Our research provides valuable insights into the relationship between quantum states and Hamiltonians, paving the way for further studies on quantum systems and advancing quantum computation and related technologies.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_355,

title = {Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms},

author = {Alexander Nietner},

url = {http://arxiv.org/abs/2310.17716},

year  = {2024},

date = {2024-01-01},

abstract = {Kearns' statistical query (SQ) oracle (STOC'93) lends a unifying perspective with a rich explanatory power for most classical machine learning algorithms. This ceases to be true in quantum learning, where many settings admit neither an SQ nor a quantum statistical query (QSQ) analog. In this work, we take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle (TOCT'14) to unify statistical and parametrized learning. We present a systematic study of the problem of learning from an evaluation oracle, which provides an estimate of function values, and extend Feldman's framework for SQ learning (COLT'17) to our setting. This leads to unconditional lower bounds and a characterization of learning linear function classes which are directly applicable to the QSQ setting and virtually any algorithm based on loss function optimization. Our first application is to extend prior results on the learnability of quantum states and their output distributions from the SQ to the (multi-copy) QSQ setting, implying exponential separations between learning stabilizer states from (multi-copy) QSQ's versus from quantum samples. Our second application is to analyze and dissect the hardness of quantum machine learning (QML). We gain a broad understanding of the hardness of various QML tasks, which goes beyond the intuition of barren plateaus and enables us to separate the implications of barren plateaus depending on the context in which they appear.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_448,

title = {Unitary-invariant witnesses of quantum imaginarity},

author = {Carlos Fernandes and Rafael Wagner and Leonardo Novo and Ernesto F. Galvão},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_150,

title = {Universal algorithm for transforming Hamiltonian eigenvalues},

author = {Tatsuki Odake and Hlér Kristjánsson and Philip Taranto and Mio Murao},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_466,

title = {Universal entanglement distillation},

author = {Salvatore Tirone and Francesco Mele and Vittorio Giovannetti and Ludovico Lami},

year  = {2024},

date = {2024-01-01},

abstract = {In this work we find a protocol which allows the parties to distill a certain amount of Bell pairs with a fixed asymptotic error strictly smaller than one from any unknown distillable state, using only LOCC operations. Moreover, we link two seemingly unrelated concepts: the existence of a universal distillation algorithm and the strong converse distillable entanglement. To do so we conceive the following protocol: Alice and Bob decide to use a fraction of their n copies of their shared state to obtain a classical estimate, then Alice sends her part of the state to Bob via classical teleportation, after that Bob is able to perform a measure such that the infidelity between the estimate and the actual state scales as O(1/n). After this passage Alice and Bob perform on the remaining copies the optimal LOCC to distill entanglement from the estimate, thanks to the scaling of the infidelity they can achieve the optimal rate on this batch of copies paying the price of an error which depends on the fraction of the copies used to obtain the classical estimate.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_157,

title = {Universal fidelity-dissipation relations in quantum gates},

author = {Tan Van Vu and Tomotaka Kuwahara and Keiji Saito},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_39,

title = {Universal Quantum Computing with Field-Mediated Unruh–DeWitt Qubits},

author = {Eric Aspling and Michael Lawler},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_459,

title = {Universal Quantum Speedups for Mixed Integer Programming},

author = {Shouvanik Chakrabarti and Pierre Minssen and Romina Yalovetzky and Marco Pistoia},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_76,

title = {Universal readout error mitigation scheme characterized on superconducting qubits},

author = {Adrian Skasberg Aasen and Andras Di Giovanni and Hannes Rotzinger and Alexey Ustinov and Martin Gärttner},

url = {https://arxiv.org/abs/2312.04211},

year  = {2024},

date = {2024-01-01},

abstract = {Quantum technologies rely heavily on accurate control and reliable readout of quantum systems. Current experiments are limited by numerous sources of noise that can only be partially captured by simple analytical models and additional characterization of the noise sources is required. We test the ability of readout error mitigation to correct realistic noise found in systems composed of quantum two-level objects (qubits). To probe the limit of such methods, we designed a universal readout error mitigation protocol based on quantum state tomography (QST), which estimates the density matrix of a quantum system, and quantum detector tomography (QDT), which characterizes the measurement procedure. By treating readout error mitigation in the context of state tomography the method becomes largely device-, architecture-, noise source-, and quantum state-independent. We implement this method on a superconducting qubit and benchmark the increase in reconstruction fidelity for QST. We characterize the performance of the method by varying important noise sources, such as suboptimal readout signal amplification, insufficient resonator photon population, off-resonant qubit drive, and effectively shortened T1 and T2 decay times. As a result, we identified noise sources for which readout error mitigation worked well, and observed decreases in readout infidelity by a factor of up to 30.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_556,

title = {Universal, unambiguous preparation of Bell pairs},

author = {Orsolya Kalman and Aurel Gabris and Igor Jex and Tamas Kiss},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_240,

title = {Variational analog quantum simulation},

author = {Yiming Huang and Jiaxing Song and Xiao Yuan},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_114,

title = {Verification of Quantum Computations without Trusted Preparations or Measurements},

author = {Elham Kashefi and Dominik Leichtle and Luka Music and Harold Ollivier},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_438,

title = {Verification of Quantum Networks},

author = {Manasi Shingane and Yusuf Alnawakhtha and Andrew Childs and Carl Miller},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_489,

title = {Verification-inspired quantum benchmarking},

author = {Johannes Frank and Elham Kashefi and Dominik Leichtle and Michael Oliveira},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_129,

title = {Virtual Quantum Markov Chains},

author = {Yu-Ao Chen and Chengkai Zhu and Keming He and Mingrui Jing and Xin Wang},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_537,

title = {Weight Reduced Stabilizer Codes with Lower Overhead},

author = {Eric Sabo and Lane Gunderman and Benjamin Ide and Michael Vasmer and Guillaume Dauphinais},

url = {https://arxiv.org/pdf/2402.05228},

year  = {2024},

date = {2024-01-01},

abstract = {Stabilizer codes are the most widely studied class of quantum error-correcting codes and form the basis of most proposals for a fault-tolerant quantum computer. A stabilizer code is defined by a set of parity-check operators, which are measured in order to infer information about errors that may have occurred. In typical settings, measuring these operators is itself a noisy process and the noise strength scales with the number of qubits involved in a given parity check, or its weight. Hastings proposed a method for reducing the weights of the parity checks of a stabilizer code, though it has previously only been studied in the asymptotic regime. Here, we instead focus on the regime of small-to-medium size codes suitable for quantum computing hardware. We provide both a fully explicit description of Hastings's method and propose a substantially simplified weight reduction method that is applicable to the class of quantum product codes. Our simplified method allows us to reduce the check weights of hypergraph and lifted product codes to at most six, while preserving the number of logical qubits and at least retaining (in fact often increasing) the code distance. The price we pay is an increase in the number of physical qubits by a constant factor, but we find that our method is much more efficient than Hastings's method in this regard. We benchmark the performance of our codes in a photonic quantum computing architecture based on GKP qubits and passive linear optics, finding that our weight reduction method substantially improves code performance.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}