Accepted posters

@Poster{P24_406,

title = {Local measurement strategies for multipartite entanglement quantification},

author = {Luke Coffman and Akshay Seshadri and Graeme Smith and Jacob Beckey},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_133,

title = {Long-distance entanglement sharing using hybrid states of discrete and continuous variables},

author = {Soumyakanti Bose and Jaskaran Singh and Adan Cabello and Hyunseok Jeong},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_378,

title = {Loop Null Homology is Complete for slightly more than NQL},

author = {Quinten Tupker},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_175,

title = {Lossy-and-Constrained Extended Non-Local Games with Applications to Cryptography: BC, QKD and QPV},

author = {Llorenç Escolà-Farràs and Florian Speelman},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_91,

title = {Lower bounds for quantum-inspired classical algorithms via communication complexity},

author = {Nikhil Mande and Changpeng Shao},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_51,

title = {Lower Bounds for Unitary Property Testing with Proofs and Advice},

author = {Jordi Weggemans},

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

year  = {2024},

date = {2024-01-01},

abstract = {In unitary property testing a quantum algorithm, also known as a tester, is given query access to a black-box unitary and has to decide whether it satisfies some property. We propose a new technique for proving lower bounds on the quantum query complexity of unitary property testing and related problems, which utilises the connection between unitary property testing and unitary channel discrimination. The main advantage of this technique is that all obtained lower bounds hold for any C-tester with C contained in QMA(2)/qpoly, showing that even having access to textitboth (unentangled) quantum proofs and advice does not help for many unitary problems. We apply our technique to prove lower bounds for problems like quantum phase estimation, the entanglement entropy problem, quantum Gibbs sampling and more, removing all logarithmic factors in the lower bounds obtained by the sample-to-query lifting theorem of Wang and Zhang (2023). As a direct corollary, we show that there exist quantum oracles relative to which QMA(2) and QMA/qpoly do not contain SBQP and SBQP. The former shows that, at least in a black-box way, having unentangled quantum proofs does not help in solving problems that require high precision.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_141,

title = {Lower bounds on entanglement and quantum gates in non-local quantum computation},

author = {Alex May and Vahid Asadi and Eric Culf and Richard Cleve},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_424,

title = {Lower T-count with faster algorithms},

author = {Vivien Vandaele},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_256,

title = {Magic of quantum hypergraph states},

author = {Junjie Chen and Yuxuan Yan and You Zhou},

url = {https://quantum-journal.org/papers/q-2024-05-21-1351/},

year  = {2024},

date = {2024-01-01},

abstract = {Magic, or nonstabilizerness, characterizes the deviation of a quantum state from the set of stabilizer states, playing a fundamental role in quantum state complexity and universal fault-tolerant quantum computing. However, analytical and numerical characterizations of magic are very challenging, especially for multi-qubit systems, even with a moderate qubit number. Here, we systemically and analytically investigate the magic resource of archetypal multipartite quantum states—quantum hypergraph states, which can be generated by multi-qubit controlled-phase gates encoded by hypergraphs. We first derive the magic formula in terms of the stabilizer R$mathrmacutee$nyi-α entropies for general quantum hypergraph states. If the average degree of the corresponding hypergraph is constant, we show that magic cannot reach the maximal value, i.e., the number of qubits $n$. Then, we investigate the statistical behaviors of random hypergraph states' magic and prove a concentration result, indicating that random hypergraph states typically reach the maximum magic. This also suggests an efficient way to generate maximal magic states with random diagonal circuits. Finally, we study hypergraph states with permutation symmetry, such as $3$-complete hypergraph states, where any three vertices are connected by a hyperedge. Counterintuitively, such states can only possess constant or even exponentially small magic for $alphageq 2$. Our study advances the understanding of multipartite quantum magic and could lead to applications in quantum computing and quantum many-body physics.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_261,

title = {Magic-induced computational separation in entanglement theory},

author = {Andi Gu and Salvatore Oliviero and Lorenzo Leone},

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

year  = {2024},

date = {2024-01-01},

abstract = {Entanglement serves as a foundational pillar in quantum information theory, delineating the boundary between what is classical and what is quantum. The common assumption is that higher entanglement corresponds to a greater degree of 'quantumness'. However, this folk belief is challenged by the fact that classically simulable operations, such as Clifford circuits, can create highly entangled states. The simulability of these states raises a question: what are the differences between 'low-magic' entanglement, and 'high-magic' entanglement? We answer this question in this work with a rigorous investigation into the role of magic in entanglement theory. We take an operational approach to understanding this relationship by studying tasks such as entanglement estimation, distillation and dilution. This approach reveals that magic has surprisingly strong implications for entanglement. Specifically, we find a sharp operational separation that splits Hilbert space into two distinct phases: the entanglement-dominated (ED) phase and magic-dominated (MD) phase. Roughly speaking, ED states have entanglement that significantly surpasses their magic, while MD states have magic that dominates their entanglement. The competition between the two resources in these two phases induces a computational phase separation between them: there are sample- and time-efficient quantum algorithms for almost any entanglement task on ED states, while these tasks are provably computationally intractable in the MD phase. To demonstrate the power of our results beyond entanglement theory, we highlight the relevance of our findings in many-body physics and topological error correction. Additionally, we offer simple theoretical explanations for phenomenological observations made in previous numerical studies using ED-MD phases.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_149,

title = {Majorization in large samples},

author = {Erkka Haapasalo and Muhammad Usman Farooq and Tobias Fritz and Marco Tomamichel and Frits Verhagen},

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

year  = {2024},

date = {2024-01-01},

abstract = {In order to assess the information content of a statistical experiment (a collection of classical or quantum states), we need to compare it to other experiments. This comparability is called majorization and, in the classical case, we arrive at matrix majorization and, in the quantum case, at quantum majorization between tuples of quantum states. We study comparison of statistical experiments aided by having many copies of the experiments (large-sample case) or having an extra experiment aiding the majorization (catalytic case). We give explicit sufficient and almost necessary conditions for matrix majorization in large samples using multi-party extensions of the Renyi divergences. We also see that varying support restrictions yield varying sets of these multi-party divergences relevant for majorization in large samples. As a direct quantum application, we are finally able to give a secure proof for the sufficient and necessary conditions for asymptotic thermal majorization between quantum states of a thermodynamic system. Full quantum majorization between quantum statistical experiments is still a daunting problem, but we find sufficient and almost necessary conditions for measurement majorization. This means that we can give conditions characterizing when a given pair of quantum states yield given classical outcomes in some POVM measurement in large enough samples. More general quantum majorization results require the study of multi-party quantum divergences. Thus, defining such divergences and investigating their properties remains as a very important agenda.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_414,

title = {Matchgate hierarchy: A Clifford-like hierarchy for matchgate circuits},

author = {Angelos Bampounis and Rui Soares Barbosa and Nadish Silva},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_292,

title = {Maximal intrinsic randomness of a quantum state},

author = {Shuyang Meng and Fionnuala Curran and Gabriel Senno and Victoria J. Wright and Máté Farkas and Valerio Scarani and Antonio Acín},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_341,

title = {Measurement-based Quantum Computation from Clifford Quantum Cellular Automata},

author = {Hendrik Poulsen Nautrup and Hans J. Briegel},

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

year  = {2024},

date = {2024-01-01},

abstract = {In this talk we explore measurement-based quantum computation (MBQC) for quantum machine learning. To this end, we show that unitary MBQC on a regular lattice with measurements in the XY-basis is equivalent to a circuit model quantum computation based on Clifford quantum cellulare automata. While this model of quantum computation is ideally suited as a Hardware-efficient Ansatz for certain quantum computation architectures such as neutral atoms, there remains sufficient flexibility to use it as a problem specific Ansatz for variational quantum circuits. We further explore non-unitary MBQC as a variational Ansatz for generative modelling which makes explicit use of the non-unitary nature of measurements. We find that this quantum channel ansatz for generative modelling outperforms the corresponding unitary ansatz both numerically and algebraically.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_255,

title = {Memory Effects in Quantum State Verification},

author = {Siyuan Chen and Wei Xie and Kun Wang},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_159,

title = {Memory Minimal Predictive Models for Quantum Processes},

author = {Graeme Berk and Jayne Thompson and Mile Gu},

year  = {2024},

date = {2024-01-01},

abstract = {What is the minimum quantity of information a model requires to predict a process faithfully? Minimal models saturating the memory constraints imposed by physics represent the 'Occam’s Razor’ for observed behavior, quantifying the minimal causal mechanisms needed for their explanation. We extend these concepts to the quantum regime. Leveraging a novel quantum model reduction principle which we call linear dependence of future morphs, we derive the q-transducer, which we prove to be the memory minimal quantum model of a quantum process. We show that an experimenter interacting with a quantum process can asymptotically obtain maximal predictive ability by learning the current state of the q-transducer. We devise a model reduction algorithm to find q-transducers, and argue for the potential of efficient implementation.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_311,

title = {Minimal Clifford Shadow Estimation by Mutually Unbiased Bases},

author = {Qingyue Zhang and Qing Liu and You Zhou},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_536,

title = {Minimal-noise estimation of noncommuting rotations of a spin},

author = {Jakub Czartowski and Karol Życzkowski and Daniel Braun},

url = {https://quantum-journal.org/papers/q-2024-05-08-1341/},

year  = {2024},

date = {2024-01-01},

abstract = {We introduce a novel approach inspired by SU(1,1) interferometry to measure spin rotation using two-spin squeezed states, employing a squeeze-rotate-unsqueeze protocol. We demonstrate the achievability of the Heisenberg limit for estimating rotation angles, particularly with maximal and half-maximal squeezing. Notably, we showcase enhanced sensitivity for all equatorial rotation axes compared to classical methods, owing to a specific squeezing direction and strength. This advantage is evidenced by the quadratic scaling of the single-parameter quantum Fisher information for corresponding rotation angles, highlighting the potential for improved precision in estimation of non-commuting rotations. Our findings provide a novel method for measuring magnetic fields in any direction within the x-y-plane using a single optimized initial state.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_172,

title = {Mitigating photon loss in linear optical quantum circuits' Merged with 'An error-mitigated photonic quantum circuit Born machine'},

author = {James Mills and Alexia Salavrakos and Rawad Mezher},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_197,

title = {Modeling error correction with Lindblad dynamics and approximate channels},

author = {Zohar Schwartzman-Nowik and Liran Shirizly and Haggai Landa},

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

year  = {2024},

date = {2024-01-01},

abstract = {We analyze the performance of a quantum error correction code subject to physically motivated noise modeled by a Lindblad master equation. Working within the code-capacity framework, we consider a noise model including dissipative and coherent single-qubit terms and two-qubit crosstalk, studying how well different approximations of the noise capture the performance of the five-qubit code. We find that a composite-channel approximation where every noise term is considered separately, can capture the behavior in many physical cases up to relatively long timescales. Single-qubit approximations do not manage to properly capture the error correction dynamics with two-qubit noise, even for short times. A Pauli approximation going beyond a single-qubit channel, works well in many cases at short timescales relative to the noise strength, after which it eventually fails. We calculate the code pseudo-threshold emerging within this approach, and demonstrate how knowledge of the qubit parameters and connectivity can be used to design better decoders. These results shed light on the performance of error correction codes in the presence of realistic noise and can advance the ongoing efforts toward useful quantum error correction.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_75,

title = {Molecular docking via quantum approximate optimization algorithm},

author = {Qi-Ming Ding and Yi-Ming Huang and Xiao Yuan},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_128,

title = {Multidimensional Electrical Networks and their Application to Exponential Speedups for Graph Problems},

author = {Sebastian Zur and Jianqiang Li},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_551,

title = {Multiparty Local Bit Hiding: Non-Causal Advantage and Super-Activation of Causal Indefiniteness},

author = {Sahil Gopalkrishna Naik and Samrat Sen and Ramkrishna Patra and Mir Alimuddin and Manik Banik and Ananya Chakraborty and Pratik Ghoshal},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_533,

title = {N-qubit GHZ state distillation via alternating local operations},

author = {Aron Rozgonyi and Gábor Széchenyi and Tamás Kiss and Orsolya Kalman},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_502,

title = {Near-term n to k distillation protocols using graph codes},

author = {Kenneth Goodenough and Sebastian Bone and Vaishnavi Addala and Stefan Krastanov and Sarah Jansen and Dion Gijswijt and David Elkouss},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_180,

title = {Neural Network-Based Randomness Assessment for Quantum Random Number Generators},

author = {Hamid Tebyanian},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_286,

title = {New Partial Trace Inequalities and Distillability of Werner States},

author = {Pablo Costa Rico},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_254,

title = {No-Go Theorems on Fidelity-Preserving Entanglement Purification},

author = {Allen Zang and Xinan Chen and Eric Chitambar and Martin Suchara and Tian Zhong},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_125,

title = {Noise is resource-contextual in quantum communication.},

author = {Aditya Nema and Ananda Gopal Maity and David Elkouss and Sergii Strelchuk},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_276,

title = {Noise-adapted recovery circuits for quantum error correction},

author = {Debjyoti Biswas and Prabha Mandayam},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_337,

title = {Noise-mitigated randomized measurements},

author = {Emilio Onorati and Jonas Kitzinger and Jonas Helsen and Marios Ioannou and Albert H. Werner and Ingo Roth and Jens Eisert},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_361,

title = {Noise-resilient quantum circuits for qubits admitting a noise bias},

author = {Marco Fellous Asiani and Moein Naseri and Chandan Datta and Alexander Streltsov and Michał Oszmaniec},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_352,

title = {Noise-robust proofs of quantum network nonlocality},

author = {Sadra Boreiri and Bora Ulu and Pavel Sekatski and Nicolas Brunner},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_248,

title = {Non-asymptotic Approximation Error Bounds of Parametrized Quantum Circuits},

author = {Zhan Yu and Qiuhao Chen and Yuling Jiao and Yinan Li and Xiliang Lu and Xin Wang and Zhijian Yang},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_116,

title = {Non-Clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum LDPC codes via higher symmetries},

author = {Guanyu Zhu and Shehryar Sikander and Elia Portnoy and Andrew Cross and Benjamin Brown},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_205,

title = {Non-Interactive Classical Verification of Quantum Depth: A Fine-Grained Characterization},

author = {Nai-Hui Chia and Shih-Han Hung},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_85,

title = {Nonlocality under computational assumptions},

author = {Khashayar Barooti and Alexandru Gheorghiu and Grzegorz Głuch and Marc-Olivier Renou},

year  = {2024},

date = {2024-01-01},

keywords = {Outstanding Poster, Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_306,

title = {Not all Probability Density Functions are Tomograms},

author = {Liubov Markovich and Justus Urbanetz and Vladimir Man'Ko},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_528,

title = {Numerical studies on quantum state verification with single-qubit measurements},

author = {Seiseki Akibue and Yuki Takeuchi and Akihito Mizutani},

year  = {2024},

date = {2024-01-01},

abstract = {We propose a quantum state verification protocol using single-qubit Pauli measurements. As a main result, we numerically demonstrate that our protocol can verify several classes of $N(łeq 5)$-qubit pure states, including randomly sampled pure states with $cN$ number of samples with a constant $c$. In contrast, the best-known verification protocol using single-qubit Pauli measurements that can verify an arbitrary entangled state, called the direct fidelity estimation, requires $O(2^N)$ number of samples. Our results not only support a very recent result proven by Huang et al. but also suggest that their verification protocol could be improved in terms of sample complexity.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_347,

title = {On fault-tolerant constant depth computations: generalisations and applications},

author = {Grégoire Gliniasty and Rawad Mezher and Damian Markham},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_105,

title = {On quantum backpropagation, information reuse, and cheating measurement collapse},

author = {Amira Abbas and Robbie King and Hsin-Yuan Huang and William Huggins and Ramis Movassagh and Dar Gilboa and Jarrod McClean},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_27,

title = {On Quantum Simulation-Soundness},

author = {Behzad Abdolmaleki and Céline Chevalier and Ehsan Ebrahimi and Giulio Malavolta and Quoc-Huy Vu},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_259,

title = {On the composable security of weak coin flipping},

author = {Jiawei Wu and Yanglin Hu and Akshay Bansal and Marco Tomamichel},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_363,

title = {On the computational complexity of equilibrating quantum systems},

author = {Lennart Bittel and Sevag Gharibian and Martin Kliesch},

year  = {2024},

date = {2024-01-01},

abstract = {Understanding equilibration behavior of closed systems is an important but difficult problem. 

Intuitively, after some equilibration time, many-body systems typically transition to a steady state, in which expectation values become stationary. 

Sometimes, after long evolution times, however, a system can exit an equilibrium state again. 

Thus, it is natural to ask (i) for how long is an expectation value of a time-evolved observable <O(t)> equilibrated and (ii) what are the extremal values of <O(t)>. For simple observables and states under k-local Hamiltonian dynamics we show that the associated computational problems are (i) coNEXP-complete and (ii) NEXP-complete to answer for time scales given in scientific notation. 

Thus, no classical polynomial-time algorithm exist for these problems (unconditionally). Hence, understanding equilibration behavior of closed systems can be computationally intractable. 

We then show a similar result for estimating the ansatz error for a VQA setup, in which one can potentially reuse gate generators an arbitary number of times. 

Hence, we provide arguably rare examples of physically motivated NEXP-complete problems. Finally, we also derive upper bounds for the question of equilibration over all time. Here we show that the computational problem is contained in a subclass of EXPSPACE i.e. solvable in exponential space, but potentially double-exponential time.},

keywords = {Outstanding Poster, Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_188,

title = {On the Impossibility of General Parallel Fast-forwarding of Hamiltonian Simulation},

author = {Nai-Hui Chia and Kai-Min Chung and Yao-Ching Hsieh and Han-Hsuan Lin and Yao-Ting Lin and Yu-Ching Shen},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_324,

title = {On the locality of fermion to qubit mappings},

author = {Tommaso Guaita},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_454,

title = {On the power of geometrically-local classical and quantum circuits},

author = {Kishor Bharti and Rahul Jain},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_375,

title = {On the set of reduced states of translation invariant, infinite quantum systems},

author = {Vjosa Blakaj and Michael Wolf},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_318,

title = {On the simulation of quantum multimeters},

author = {Andreas Bluhm and Leevi Leppäjärvi and Ion Nechita},

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

year  = {2024},

date = {2024-01-01},

abstract = {In the quest for robust and universal quantum devices, the notion of simulation plays a crucial role, both from a theoretical and from an applied perspective. In this work, we go beyond the simulation of quantum channels and quantum measurements, studying what it means to simulate a collection of measurements, which we call a multimeter. To this end, we first explicitly characterize the completely positive transformation between multimeters. However, not all of these transformations between multimeters correspond to valid simulations, as evidenced by the existence of maps that always prepare the same multimeter regardless of the input, which we call trash-and-prepare. We give a new definition of multimeter simulations as transformations that are triviality-preserving, i.e., when given a multimeter consisting of trivial measurements they can only produce another trivial multimeter. In the absence of a quantum ancilla, we then characterize the transformations that are triviality-preserving and the transformations that are trash-and-prepare. Finally, we use these characterizations to compare our new definition of multimeter simulation to three existing ones: classical simulations, compression of multimeters, and compatibility-preserving simulations.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_440,

title = {One-Shot Non-Catalytic Distributed Purity Distillation},

author = {Sayantan Chakraborty and Rahul Jain and Pranab Sen},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_236,

title = {Operational Nonclassicality in Quantum Communication Networks},

author = {Brian Doolittle and Felix Leditzky and Eric Chitambar},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_46,

title = {Optical fibres with memory effects and their quantum communication capacities},

author = {Francesco Anna Mele and Giacomo De Palma and Marco Fanizza and Vittorio Giovannetti and Ludovico Lami},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_465,

title = {Optimal and robust experiment design for quantum state tomography of star-topology register},

author = {Zhaokai Li},

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

year  = {2024},

date = {2024-01-01},

abstract = {While quantum state tomography plays a vital role in the verification and benchmarking of quantum systems, it is an intractable task if the controllability of the quantum registers are constrained. In this paper, we propose a novel scheme for optimal and robust quantum state tomography for systems with constrained controllability. Based on the specific symmetry, we decompose the Hilbert space to alleviate the complexity of tomography and design a compact strategy with the minimum number of measurements. To switch between these measurement settings, we adopted parameterized quantum circuits consisting of local operations and free evolution, which are easy to implement in most practical systems. Then the parameters of these circuits were optimized to improve the robustness against random errors of measurements. Furthermore, we apply this method to a 10-spin star-topology register and demonstrate its ability to characterize large-scale systems. Our results can help future investigations of quantum systems with constrained ability of quantum control and measurement},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_339,

title = {Optimal Measurement Structures for Contextuality Applications},

author = {Yuan Liu and Ravishankar Ramanathan and Karol Horodecki and Monika Rosicka and Paweł Horodecki},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_111,

title = {Optimal protocols for universal adjointation of isometry operations},

author = {Satoshi Yoshida and Akihito Soeda and Mio Murao},

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

year  = {2024},

date = {2024-01-01},

abstract = {Identification of possible transformations of quantum objects including quantum states and quantum operations is indispensable in developing quantum algorithms. Universal transformations, defined as input-independent transformations, appear in various quantum applications. Such is the case for universal transformations of unitary operations. However, extending these transformations to non-unitary operations is nontrivial and largely unresolved. Addressing this, we introduce isometry adjointation protocols that convert an input isometry operation into its adjoint operation, which include both unitary operation and quantum state transformations. The paper details the construction of parallel and sequential isometry adjointation protocols, derived from unitary inversion protocols using quantum combs, and achieving optimal approximation error. This error is shown to be independent of the output dimension of the isometry operation. In particular, we explicitly obtain an asymptotically optimal parallel protocol achieving an approximation error ε = Θ(d^2/n), where d is the input dimension of the isometry operation and n is the number of calls of the isometry operation. The research also extends to isometry inversion and universal error detection, employing semidefinite programming to assess optimal performances. The findings suggest that the optimal performance of general protocols in isometry adjointation and universal error detection is not dependent on the output dimension, and that indefinite causal order protocols offer advantages over sequential ones in isometry inversion and universal error detection.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_485,

title = {Optimized QUBO formulation methods for quantum computing},

author = {Dario De Santis and Salvatore Tirone and Stefano Marmi and Vittorio Giovannetti},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_104,

title = {Optimizing quantum resources for enhanced measurement precision in noisy environments},

author = {Le Bin Ho},

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

year  = {2024},

date = {2024-01-01},

abstract = {Quantum resources like entanglement, coherence, and quantum correlations, are advanced techniques to enhance metrology precision. Here we introduce a variational approach to optimize the quantum resources and apply it to quantum metrology.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_189,

title = {Optimizing resource efficiencies for scalable full-stack quantum computers},

author = {Marco Fellous Asiani and Jing Hao Chai and Yvain Thonnart and Hui Khoon Ng and Robert Whitney and Alexia Auffeves},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_65,

title = {Order p quantum Wasserstein distances from couplings},

author = {Emily Beatty and Daniel Stilck França},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_2,

title = {Overcoming scalability bottlenecks for detecting quantum entanglement},

author = {Daniel Miller and Lukas Postler and Antonio Anna Mele and Kyano Levi and Christian Marciniak and Ivan Pogorelov and Milena Guevara-Bertsch and Alex Steiner and Robert Freund and Rainer Blatt and Philipp Schindler and Jose Carrasco and Martin Ringbauer and Thomas Monz and Jens Eisert},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_108,

title = {Overlap Gap Property limits limit swapping in QAOA},

author = {Mark Goh},

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

year  = {2024},

date = {2024-01-01},

abstract = {The Quantum Approximate Optimization Algorithm (QAOA) is a quantum algorithm designed for Combinatorial Optimization Problem (COP). We show that if a COP with an underlying Erdös–Rényi hypergraph exhibits the Overlap Gap Property (OGP), then a random regular hypergraph exhibits it as well. Given that Max-q-XORSAT on an Erdös–Rényi hypergraph is known to exhibit the OGP, and since the performance of QAOA for the pure q-spin model matches asymptotically for Max-q-XORSAT on large-girth regular hypergraph, we show that the average-case value obtained by QAOA for the pure q-spin model for even q≥4 is bounded away from optimality even when the algorithm runs indefinitely. This suggests that a necessary condition for the validity of limit swapping in QAOA is the absence of OGP in a given combinatorial optimization problem. Furthermore, the results suggests that even when sub-optimised, the performance of QAOA on spin glass is equal in performance to classical algorithms in solving the mean field spin glass problem providing further evidence that the conjecture of getting the exact solution under limit swapping for the Sherrington–Kirkpatrick model to be true.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_329,

title = {PAC-Learning of Free-Fermionic States is NP-Hard},

author = {Lennart Bittel and Antonio Anna Mele and Jens Eisert and Lorenzo Leone},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_11,

title = {Parameter Shift Rule with the Optimal Phase Selection},

author = {Liubov Markovich and Savvas Malikis and Stefano Polla and Jordi Tura Brugues},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_101,

title = {Parity Quantum Computing as YZ-Plane Measurement-Based Quantum Computing},

author = {Isaac Smith and Hendrik Poulsen Nautrup and Hans J. Briegel},

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

year  = {2024},

date = {2024-01-01},

abstract = {We show that universal parity quantum computing employing a recently introduced constant depth decoding procedure is equivalent to measurement-based quantum computation (MBQC) on a bipartite graph using only YZ-plane measurements. We further show that any unitary MBQC using only YZ-plane measurements must occur on a bipartite graph.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_238,

title = {Partitioned Quantum Subspace Expansion},

author = {Tom O'Leary and Lewis Anderson and Dieter Jaksch and Martin Kiffner},

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

year  = {2024},

date = {2024-01-01},

abstract = {We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis. The iterative construction connects a sequence of subspaces via their lowest energy states. Diagonalising a Hamiltonian in a given Krylov subspace requires the same quantum resources in both the single step and sequential cases. We propose a variance-based criterion for determining a good iterative sequence and provide numerical evidence that these good sequences display improved numerical stability over a single step in the presence of finite sampling noise. Implementing the generalisation requires additional classical processing with a polynomial overhead in the subspace dimension. By exchanging quantum circuit depth for additional measurements the quantum subspace expansion algorithm appears to be an approach suited to near term or early error-corrected quantum hardware. Our work suggests that the numerical instability limiting the accuracy of this approach can be substantially alleviated beyond the current state of the art.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_57,

title = {PDQMA = DQMA = NEXP: QMA With Hidden Variables and Non-collapsing Measurements},

author = {Scott Aaronson and Sabee Grewal and Vishnu Iyer and Simon Marshall and Ronak Ramachandran},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_525,

title = {Phase estimation in driven discrete-time quantum walks},

author = {Shivani Singh and Craig Hamilton and Igor Jex},

url = {https://doi.org/10.1103/PhysRevA.108.042607},

year  = {2024},

date = {2024-01-01},

abstract = {Quantum walks have been shown to be important for quantum metrological tasks, in particular for the estimation of the evolution parameters of the walk. In this work, we address the enhancement of this parameter estimation using the driven discrete-time quantum walk (DDTQW), which is a variant of the discrete-time quantum walk with multiple walkers. DDTQW has two regimes based on the interference between the walker number, i.e., phase matched and phase mismatched. We derive an expression for the quantum Fisher information (QFI) in the phase-matched regime of DDTQW driven using the squeezing operator, demonstrating an exponential increase in QFI. In the phase-mismatched regime, QFI varies as 𝑡^2, consistent with previous studies. Our analysis shows that parameter estimation can be improved by driving the walk using squeezing operators.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_308,

title = {Port-Based State Preparation and Applications},

author = {Garazi Muguruza and Florian Speelman},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_510,

title = {Post-Quantum Security and Privacy via Cloud: A Practical Quantum Digital Token Protocol},

author = {Yichi Zhang and Siyuan Jin and Yuhan Huang and Bei Zeng and Qiming Shao},

year  = {2024},

date = {2024-01-01},

abstract = {Digital tokens are pivotal in the burgeoning tokenized economy. This paper looks at the post-quantum security and privacy of digital tokens, with particular emphasis on how quantum tokens can be implemented. Quantum token leverages quantum states for information storage. Traditional proposals often unrealistically assume personal quantum computing access for each user. To overcome this, we introduce a novel cloud-based quantum token protocol, employing a two-layer quantum homomorphic encryption method. This enables classical entities to securely outsource quantum computations to third-party quantum cloud services via classical communication channels. Our approach significantly reduces the quantum resource demands on users and facilitates seamless integration with current classical systems. We present a simulation of our experiment and a quantitative analysis of the cloud's quantum resource needs. Our work offers a strategic blueprint for organizations to adopt a quantum version of digital tokens within their classical frameworks with enhanced security and functionality.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_56,

title = {Postselected quantum Shannon theory},

author = {Kaiyuan Ji and Bartosz Regula and Ludovico Lami and Mark Wilde},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_453,

title = {Power of quantum measurement in simulating unphysical operations},

author = {Xuanqiang Zhao and Lei Zhang and Benchi Zhao and Xin Wang},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_433,

title = {Power of sequential protocols in hidden quantum channel discrimination},

author = {Arkopal Dutt and Sho Sugiura and William Munro and Sina Zeytinoglu and Isaac Chuang},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_199,

title = {Powerful Primitives in the Bounded Quantum Storage Model},

author = {Mohammed Barhoush and Louis Salvail},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_215,

title = {Practical limitations of quantum data propagation on noisy quantum processors},

author = {Gaurav Saxena and Ahmed Shalabi and Thi Ha Kyaw},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_216,

title = {Predicting adaptively chosen observables in quantum systems},

author = {Jerry Huang and Laura Lewis and Hsin-Yuan Huang and John Preskill},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_404,

title = {Predicting Arbitrary State Properties from Single Hamiltonian Quench Dynamics},

author = {Zhenhuan Liu and Hong-Ye Hu},

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

year  = {2024},

date = {2024-01-01},

abstract = {Analog quantum simulation is an important routine for quantum computing and plays a crucial role in studying quantum many-body physics. 

Typically, the quantum evolution of an analog simulator is largely determined by its physical characteristics, lacking the precise control or versatility of quantum gates. This limitation poses challenges in measuring specific observables on analog quantum simulators, which is the final step of all quantum information processing tasks. 

To address this issue, we introduce the Hamiltonian shadow protocol. This method uses a single quench Hamiltonian for estimating arbitrary state properties, eliminating the need for ancillary systems. 

We provide physical intuitions and theoretical guarantees for our protocol. Additionally, we derive the sample complexity of this protocol and show that it performs comparably to the classical shadow protocol. The Hamiltonian shadow protocol does not require sophisticated control and can be applied to a wide range of analog quantum simulators. We demonstrate its utility through numerical demonstrations with Rydberg atom arrays under realistic parameter settings. The new protocol significantly broadens the application of randomized measurements for analog quantum simulators without precise control and ancillary systems.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_331,

title = {Predicting Ground State Properties: Constant Sample Complexity and Deep Learning Algorithms},

author = {Marc Wanner and Laura Lewis and Chiranjib Bhattacharyya and Devdatt Dubhashi and Alexandru Gheorghiu},

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

year  = {2024},

date = {2024-01-01},

abstract = {A fundamental problem in quantum many-body physics is that of finding ground states of local Hamiltonians. A number of recent works gave provably efficient machine learning (ML) algorithms for learning ground states. Specifically, [1], introduced an approach for learning properties of the ground state of an n-qubit gapped local Hamiltonian H from data points sampled from Hamiltonians in the same phase of matter polynomial in n. This was subsequently improved by [2], to logarithmic number of samples with respect to system size when the geometry of the n-qubit system is known. In this work, we introduce two approaches that achieve a constant sample complexity, independent of system size, for learning ground state properties. Our first algorithm consists of a simple modification of the ML model used by Lewis et al. and applies to a property of interest known beforehand. Our second algorithm, which applies even if a description of the property is not known, is a deep neural network model. While empirical results showing the performance of neural networks have been demonstrated, to our knowledge, this is the first rigorous sample complexity bound on a neural network model for predicting ground state properties. We also perform numerical experiments that confirm the improved scaling of our approach compared to earlier results. 

References: Hsin-Yuan Huang, Richard Kueng, Giacomo Torlai, Victor V Albert, and John Preskill. Provably efficient machine learning for quantum many-body problems. Science, 377(6613):eabk3333, 2022. [2] Laura Lewis, Hsin-Yuan Huang, Viet T Tran, Sebastian Lehner, Richard Kueng, and John Preskill. Improved machine learning algorithm for predicting ground state properties. Nature Communications, 15(1):895, 2024.},

keywords = {Outstanding Poster, Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_3,

title = {Preparing thermal states on noiseless and noisy programmable quantum processors},

author = {Ramis Movassagh and Oles Shtanko},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_244,

title = {Principal eigenstate classical shadows},

author = {Daniel Grier and Hakop Pashayan and Luke Schaeffer},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_278,

title = {Probabilistic channel simulation using coherence},

author = {Benchi Zhao and Kosuke Ito and Keisuke Fujii},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_548,

title = {Probabilistic versions of Quantum Private Queries},

author = {Silvia Onofri and Vittorio Giovannetti},

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

year  = {2024},

date = {2024-01-01},

abstract = {The no-go theorem regarding unconditionally secure Quantum Bit Commitment protocols is a relevant result in quantum cryptography. Such result has been used to prove the impossibility of unconditional security for other protocols, such as Quantum Oblivious Transfer or One-Sided Two Party Computation. In this paper, we formally define two non-deterministic versions of Quantum Private Queries, a protocol addressing the Symmetric-Private Information Retrieval problem. We show that the strongest variant of such scheme is formally equivalent to Quantum Bit Commitment, Quantum Oblivious Transfer and One-Sided Two Party Computation protocols. This equivalence serves as conclusive evidence of the impracticality of achieving unconditionally secure Strong Probabilistic Quantum Private Queries.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_223,

title = {Probing spectral features of quantum many-body systems with quantum simulators},

author = {Jinzhao Sun and Lucia Vilchez-Estevez and Vlatko Vedral and Andrew Boothroyd and Myungshik Kim},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_209,

title = {Problem Specific Classical Optimization of Hamiltonian Simulation},

author = {Refik Mansuroglu and Felix Fischer and Michael Hartmann},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_457,

title = {Problem-informed Graphical Quantum Generative Learning},

author = {Bence Bakó and Dániel Nagy and Zoltán Zimborás},

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

year  = {2024},

date = {2024-01-01},

abstract = {Leveraging the intrinsic probabilistic nature of quantum systems, generative quantum machine learning (QML) offers the potential to outperform classical learning models. Current generative QML algorithms mostly rely on general-purpose models that, while being very expressive, face several training challenges. A potential way to address these setbacks involves constructing problem-informed models capable of more efficient training on structured problems. In particular, probabilistic graphical models provide a flexible framework for representing structure in generative learning problems and can thus be exploited to incorporate inductive bias in QML algorithms. In this work, we propose a problem-informed quantum circuit Born machine Ansatz for learning the joint probability distribution of random variables, with independence relations efficiently represented by a Markov network (MN). We further demonstrate the applicability of the MN framework in constructing generative learning benchmarks and compare our model's performance to previous designs, showing it outperforms problem-agnostic circuits. Based on a preliminary analysis of trainability, we narrow down the class of MNs to those exhibiting favorable trainability properties. Finally, we discuss the potential of our model to offer quantum advantage in the context of generative learning.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_183,

title = {Protecting Quantum Information via Destructive Interference of Correlated Noise},

author = {Alon Salhov and Qingyun Cao and Jianming Cai and Alex Retzker and Fedor Jelezko and Genko Genov},

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

year  = {2024},

date = {2024-01-01},

abstract = {Decoherence remains a major challenge for quantum technologies. Several important strategies, such as decoherence-free spaces, clock transitions, dynamical decoupling, and composite pulses, reduce the effect of noise, lowering decoherence and control error rates. Each strategy takes advantage of a certain “resource” to protect quantum 

information. 

In this work, we propose and experimentally demonstrate a protection strategy that leverages a new kind of resource – the cross-correlation of two noise sources, e.g. control fields. Such cross-correlations exist when the control fields are generated from the same source or pass through the same transmission line. As an example, we modify the continuous concatenated dynamical decoupling control scheme. As we show, introducing a frequency shift to one of the control fields, which is proportional to the degree of cross-correlation, results in destructive interference of the cross- correlated noise. Our scheme results in a tenfold increase in the coherence time of a single NV center in diamond, and outperforms the widely used XY8 sequence. Furthermore, we demonstrate the magnetometry of GHz signals with record sensitivity and robust qubit 

operations. In light of recent characterizations of noise cross-correlations in quantum systems, our contribution opens a new avenue in the field of noise protection for quantum technologies.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_285,

title = {Provable learning of quantum states with graphical models},

author = {Liming Zhao and Naixu Guo and Mingxing Luo and Patrick Rebentrost},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_482,

title = {Pseudorandom and Pseudoentangled States from Subset States},

author = {Fernando Jeronimo and Nir Magrafta and Pei Wu},

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

year  = {2024},

date = {2024-01-01},

abstract = {Pseudorandom states (PRS) are an important primitive in quantum cryptography. In this paper, we show that emphsubset states can be used to construct PRSs. A subset state with respect to $S$, a subset of the computational basis, is 

[ 

 frac1sqrt|S|sum_iın S |irangle. 

] As a technical centerpiece, we show that for any fixed subset size $|S|=s$ such that $s = 2^n/ømega(poly(n))$ and $s=ømega(poly(n))$, where $n$ is the number of qubits, a random subset state is information-theoretically indistinguishable from a Haar random state even provided with polynomially many copies. 

This range of parameter is tight. Our work resolves a conjecture by Ji, Liu and Song. 

Since subset states of small size have small entanglement across all cuts, this construction also illustrates a pseudoentanglement phenomenon. 

Zhengfeng Ji, Yi-Kai Liu, and Fang Song. Pseudorandom quantum states. In Proceedings of the 38th Annual International Cryptology Conference (CRYPTO), pages 126–152. Springer, 2018.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_191,

title = {Public-key Quantum Money from Quantum Physical Unclonable Functions},

author = {Soham Ghosh and Vladlen Galetsky and Pol Julia Farre and Christian Deppe and Roberto Ferrara and Holger Boche},

year  = {2024},

date = {2024-01-01},

abstract = {Wiesner introduced the concept of using quantum states as currency, leveraging the laws of physics to prevent 

counterfeiting. However, Wiesner’s pioneering scheme not only lacks security but it is also private-key in nature, 

i.e. , it requires the bank as an intermediary to authenticate transactions. Aaronson and Christiano first proposed 

a formal mathematical structure of public-key quantum money and proved that there exists a unitary blackbox 

oracle relative to which a public-key quantum money scheme exists. However, they failed to provide an explicit 

construction for such an oracle and prove its security under standard cryptographic assumptions. Among notable 

works that followed after, Zhandry proposed ""Quantum Lightning"" based schemes but they were neither an explict 

construction nor were they secure, as their security is known to be broken now. To date, there is no known explicit 

public-key quantum money scheme with provable security under standard cryptographic assumptions. Recently, a 

new cryptographic primitive called Quantum Physical Unclonable Fucntion (QPUF) was defined under standard 

cryptographic assumptions. Motivated by this, we show how unitary QPUFs can be used to obtain an explicit 

public-key quantum money scheme and prove its security under standard cryptographic assumptions. Finally, we 

contend that although we present our models under the ideal assumption of having QPUFs as a perfect source of 

randomness, our models offer a systematic road-map to obtain more realistic schemes which we leave for future work.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_321,

title = {Qualitative equivalence between incompatibility and Bell nonlocality},

author = {Shiv Akshar Yadavalli and Nikola Andrejić and Ravi Kunjwal},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_479,

title = {Quantifying Subspace Entanglement with Geometric Measures},

author = {Xuanran Zhu and Chao Zhang and Bei Zeng},

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

year  = {2024},

date = {2024-01-01},

abstract = {Determining whether a quantum subspace is entangled and quantifying its entanglement level remains a fundamental challenge in quantum information science. This paper introduces a geometric measure of $r$-bounded rank, $E_r(S)$, for a given subspace $S$. This measure, derived from the established geometric measure of entanglement, is tailored to assess the entanglement within $S$. It not only provides a benchmark for quantifying the entanglement level but also sheds light on the subspace's ability to preserve such entanglement. Utilizing non-convex optimization techniques from the domain of machine learning, we effectively calculate $E_r(S)$ textcolorredin the manifold optimization framework. Showcasing strong performance in comparison to existing hierarchical and PPT relaxation techniques, our approach is notable for its accuracy, computational efficiency, and wide-ranging applicability. This versatile and effective tool paves the way for numerous new applications in quantum information science. It is particularly useful in validating textcolorredhigh-dimensional entangled subspaces in bipartite systems, determining the border rank of multipartite states, and identifying genuinely or completely entangled subspaces. Our approach offers a fresh perspective for quantifying entanglement, while also shedding light on the intricate structure of quantum entanglement.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_293,

title = {Quantitative Quantum Zeno and Strong Damping Limits in Strong Topology},

author = {Robert Salzmann},

year  = {2024},

date = {2024-01-01},

abstract = {Frequent applications of a mixing quantum operation to a quantum system slow down its time evolution and eventually drive it into the invariant subspace of the named quantum operation. We prove this phenomenon, the quantum Zeno effect, and its continuous variant, strong damping, in a unified way for infinite-dimensional open quantum systems, while merely demanding that the respective mixing convergence holds pointwise for all states. Both results are quantitative in the following sense: Given a speed of convergence for the mixing limits, then we obtain bounds on the speed of convergence for the respective quantum Zeno and strong damping limits. We apply our results to prove quantum Zeno and strong damping limits for the photon loss channel with a bound on the convergence speed.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_96,

title = {Quantum Algorithm for Searching the Longest Segment and the Largest Empty Rectangle},

author = {Kamil Khadiev and Vladislav Remidovskiy and Timur Bikmullin and Aliya Khadieva},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_387,

title = {Quantum algorithms for many-body spectroscopy using dynamics and classical shadows},

author = {Nishad Maskara and Stefan Ostermann and James Shee and Marcin Kalinowski and Abigail McClain Gomez and Rodrigo Araiza Bravo and Varun Menon and Christian Kokail and Hsin-Yuan Huang and Derek Wang and Anna Krylov and Norman Yao and Martin Head-Gordon and Mikhail Lukin and Susanne Yelin},

year  = {2024},

date = {2024-01-01},

keywords = {Outstanding Poster, Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_508,

title = {Quantum Algorithms For String Problems},

author = {Joshua Cudby and Sergii Strelchuk},

year  = {2024},

date = {2024-01-01},

abstract = {The problem of aligning two or more strings is fundamentally important for bioinformatic applications. Pairwise 

alignments can reveal information about evolutionary or structural features of DNA sequences; moreover, some “biologically similar” protein sequences may 

exhibit only weak sequence similarity, which can be overlooked by pairwise alignments, motivating the need for 

multiple sequence alignment and comparison. We discuss Quantum Algorithms for the pairwise and multiple sequence alignment problems.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_7,

title = {Quantum Algorithms for the Pathwise Lasso},

author = {João F. Doriguello and Debbie Huey Chih Lim and Chi Seng Pun and Patrick Rebentrost and Tushar Vaidya},

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

year  = {2024},

date = {2024-01-01},

abstract = {We present a novel quantum high-dimensional linear regression algorithm with an L1-penalty based on the classical LARS (Least Angle Regression) pathwise algorithm. Similarly to available classical numerical algorithms for Lasso, our quantum algorithm provides the full regularisation path as the penalty term varies, but quadratically faster per iteration under specific conditions. A quadratic speedup on the number of features/predictors d is possible by using the simple quantum minimum-finding subroutine from Dürr and Høyer [1] in order to obtain the joining time at each iteration. We then improve upon this simple quantum algorithm and obtain a quadratic speedup both in the number of features d and the number of observations n by using the recent approximate quantum minimum-finding subroutine from Chen and de Wolf [2]. In order to do so, we construct, as one of our main contributions, a quantum unitary based on quantum amplitude estimation to approximately compute the joining times to be searched over by the approximate quantum minimum-finding subroutine. Since the joining times are no longer exactly computed, it is no longer clear that the resulting approximate quantum algorithm obtains a good solution. As our second main contribution, we prove, via an approximate version of the KKT conditions and a duality gap, that the LARS algorithm (and therefore our quantum algorithm) is robust to errors. This means that it still outputs a path that minimises the Lasso cost function up to a small error if the joining times are only approximately computed. Finally, in the model where the observations are generated by an underlying linear model with an unknown coefficient vector, we prove bounds on the difference between the unknown coefficient vector and the approximate Lasso solution, which generalises known results about convergence rates in classical statistical learning theory analysis. 

[1] Christoph Dürr and Peter Høyer. A quantum algorithm for finding the minimum. arXiv preprint quant-ph/9607014, 1996. 5, 11, 19, 35 [2] Yanlin Chen and Ronald de Wolf. Quantum algorithms and lower bounds for lin- ear regression with norm constraints. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), volume 261 of Leibniz International Pro- ceedings in Informatics (LIPIcs), pages 38:1–38:21, Dagstuhl, Germany, 2023. Schloss Dagstuhl – Leibniz-Zentrum fu ̈r Informatik. 5, 7, 11, 12, 21, 25, 35},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_70,

title = {Quantum and Classical Communication Complexity of Permutation-Invariant Functions},

author = {Ziyi Guan and Yunqi Huang and Penghui Yao and Zekun Ye},

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

year  = {2024},

date = {2024-01-01},

abstract = {This paper gives a nearly tight characterization of the quantum communication complexity of the permutation-invariant Boolean functions. With such a characterization, we show that the quantum and randomized communication complexity of the permutation-invariant Boolean functions are quadratically equivalent (up to a logarithmic factor). Our results extend a recent line of research regarding query complexity to communication complexity, showing symmetry prevents exponential quantum speedups. Furthermore, we show the Log-rank Conjecture holds for any non-trivial total permutation-invariant Boolean function. Moreover, we establish a relationship between the quantum/classical communication complexity and the approximate rank of permutation-invariant Boolean functions. This implies the correctness of the Log-approximate-rank Conjecture for permutation-invariant Boolean functions in both randomized and quantum settings (up to a logarithmic factor).},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_546,

title = {Quantum bounds for compiled XOR games and d-outcome CHSH games},

author = {Matilde Baroni and Quoc-Huy Vu and Boris Bourdoncle and Eleni Diamanti and Damian Markham and Ivan Šupić},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_563,

title = {Quantum Circuit Complexity of Genomic Data Encoding},

author = {Orson Ye and Sergii Strelchuk},

year  = {2024},

date = {2024-01-01},

abstract = {Data encoding is a key step in almost all applications of quantum computation, but one that is not very well understood in general. While naive methods, such as basis encoding, will almost always work, they are extremely inefficient in terms qubit use, rendering them infeasible for near-term applications. We focus on data encoding for genomics, a deeply data-driven field with computationally intensive algorithms throughout, from the initial DNA sequencing to pangenome assembly and more. We review some standard approaches to data encoding in the context of genomics data from both the preparation complexity and usefulness perspectives. We also present some new data encoding methods designed specifically for genomics that have a low-depth preparation circuits while still maintaining the essential features the algorithms require.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_527,

title = {Quantum Codes from Small High Dimensional Expanders},

author = {Adam Marks},

year  = {2024},

date = {2024-01-01},

abstract = {We construct the smallest possible examples of CSS codes from high dimensional expanders and measure their length, rate and distance using a combination of theoretical and computational methods. We offer software to calculate Cartwright-Steger generators, Cayley complexes, mod two homology, systoles and cosystoles.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_340,

title = {Quantum computing algorithm for an inverse problem on graphs},

author = {Joonas Ilmavirta and Matti Lassas and Jinpeng Lu and Lauri Oksanen and Lauri Ylinen},

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

year  = {2024},

date = {2024-01-01},

abstract = {We consider an inverse problem for a finite graph (X,E) where we are given a subset of vertices B and the distances d(b1,b2) of all vertices b1, b2 in B. The distance of two vertices x1, x2 of X is defined as the minimal number of edges needed to connect them. The inverse problem is a discrete version of the boundary rigidity problem in Riemannian geometry or the inverse travel time problem in geophysics. We will show that this problem has unique solution under certain conditions and develop quantum computing methods to solve it. We present a quantum algorithm which produces a graph (X,E), or one of those, which has a given number of vertices and the required distances between vertices in B. We also consider applications in theory of computation, and show that a slight modification of the above inverse problem is NP-complete.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}