Accepted posters

@Poster{P24_522,

title = {A Bravyi-König theorem for Floquet codes},

author = {Jelena Mackeprang and Jonas Helsen},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_382,

title = {A Complete Graphical Language for Linear Optical Circuits with Finite-Photon-Number Sources and Detectors},

author = {Nicolas Heurtel},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_398,

title = {A Cryptographic Perspective on the Verifiability of Quantum Advantage},

author = {Nai-Hui Chia and Honghao Fu and Fang Song and Penghui Yao},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_186,

title = {A Domain of Symmetric Unital Channels},

author = {Daniel Bonior},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_297,

title = {A Faster Algorithm for the Free Energy in One-Dimensional Quantum Systems},

author = {Samuel Scalet},

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

year  = {2024},

date = {2024-01-01},

abstract = {We consider the problem of approximating the free energy density of a translation-invariant, one-dimensional quantum spin system with finite range. While the complexity of this problem is nontrivial due to its close connection to problems with known hardness results, a classical subpolynomial-time algorithm has recently been proposed [Fawzi et al., 2022]. Combining several algorithmic techniques previously used for related problems, we propose an algorithm outperforming this result asymptotically and give rigorous bounds on its runtime. Our main techniques are the use of Araki expansionals, known from results on the nonexistence of phase transitions, and a matrix product operator construction. We also review a related approach using the Quantum Belief Propagation [Kuwahara et al., 2018], which in combination with our findings yields an equivalent result.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_416,

title = {A framework of partial error correction for intermediate-scale quantum computers},

author = {Nikolaos Koukoulekidis and Samson Wang and Tom O'Leary and Daniel Bultrini and Lukasz Cincio and Piotr Czarnik},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_506,

title = {A general purification protocol with imperfect state preparation},

author = {Golshan Lirabi and Faedi Loulidi and David Elkouss},

year  = {2024},

date = {2024-01-01},

abstract = {Purification protocols take several copies of a 

 mixed state and output a smaller number of copies with 

 higher purity. Recently, a protocol based on the Swap test 

 was shown to have optimal resource consumption, with 

 the number of samples scaling proportional to the inverse 

 of the error. In this work, we consider a more realistic 

 scenario in which all the prepared states are noisy, 

 including the auxiliary qubits used by the protocol. Here, 

 we show that this generalization does not compromise 

 convergence, with the protocol still converging for all non 

extreme noise values. Moreover, we estimate the number 

 of iterations and resources needed in the generalized 

 scenario. Such an estimation allows us to address the 

 optimality of the protocol with noisy state preparation and show that the protocol is no longer optimal.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_127,

title = {A graphical language for Gaussian quantum processes},

author = {Robert Booth and Titouan Carette and Cole Comfort},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_260,

title = {A little magic means a lot},

author = {Andi Gu and Lorenzo Leone and Soumik Ghosh and Jens Eisert and Susanne Yelin and Yihui Quek},

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

year  = {2024},

date = {2024-01-01},

abstract = {Notions of nonstabilizerness, or ``magic'', quantify how non-classical quantum states are in a precise sense: states exhibiting low nonstabilizerness preclude quantum advantage. We introduce `pseudomagic' ensembles of quantum states that, despite low nonstabilizerness, are computationally indistinguishable from those with high nonstabilizerness. Previously, such computational indistinguishability has been studied with respect to entanglement, introducing the concept of pseudoentanglement. However, we demonstrate that pseudomagic neither follows from pseudoentanglement nor implies it. In terms of applications, the study of pseudomagic offers fresh insights into the theory of quantum scrambling: it uncovers states that, even though they originate from non-scrambling unitaries, remain indistinguishable from scrambled states to any physical observer. Additional applications include new lower bounds on state synthesis problems, property testing protocols, and implications for quantum cryptography. Our work is driven by the observation that only quantities measurable by a computationally bounded observer – intrinsically limited by finite-time computational constraints – hold physical significance. Ultimately, our findings suggest that nonstabilizerness is a `hide-able' characteristic of quantum states: some states are much more magical than is apparent to a computationally bounded observer.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_322,

title = {A Max-Flow approach to Random Tensor Networks},

author = {Faedi Loulidi and Khurshed Fitter and Ion Nechita},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_291,

title = {A Note on Exponential Quantum One-Wayness},

author = {Giulio Malavolta and Tomoyuki Morimae and Michael Walter and Takashi Yamakawa},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_44,

title = {A Note on Output Length of One-Way State Generators and EFIs},

author = {Minki Hhan and Tomoyuki Morimae and Takashi Yamakawa},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_524,

title = {A Practical Protocol for Quantum Oblivious Transfer from One-Way Functions},

author = {Eleni Diamanti and Alex Bredariol Grilo and Adriano Innocenzi and Pascal Lefebvre and Verena Yacoub and Alvaro Yángüez},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_512,

title = {A pure (2+1)-dimensional SU(2) model for analog simulation in small-scale superconducting quantum devices},

author = {Lucia Valor and Klaus Liegener and Stefan Filipp and Peter Rabl},

year  = {2024},

date = {2024-01-01},

abstract = {Lattice gauge theories constitute an important tool in studying the fundamental interactions of matter within particle physics and have a wide range of applications in condensed matter physics and quantum information theory. While classical numerical methods can be used to simulate many properties of Abelian and non-Abelian gauge theories efficiently, the intrinsic quantum nature of these theories makes other relevant physical phenomena hard to reproduce. Quantum simulators offer a promising approach to address these challenges, with successful simulations of Abelian theories in different quantum platforms demonstrating their potential in the last decades. Despite these advances, quantum simulation of non-Abelian theories remains challenging. Recent research efforts aimed at the analog simulation of these gauge theories have predominantly focused on atomic quantum platforms like ultracold atoms and trapped ions. Here, we propose a minimal model for a (2+1)-dimensional pure SU(2) lattice gauge theory, implementable as an analog simulation on superconducting quantum hardware. We study properties of the system, such as the effect of adding bosonic excitations, and explore its experimental implementation. Our work contributes to the exploration and understanding of non-Abelian gauge theories and offers a new and rich implementation to study lattice gauge theories using superconducting qubits.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_412,

title = {A quantum algorithm for the pathfinding problem via the quantum electrical flow},

author = {Jianqiang Li and Sean Hallgren},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_5,

title = {A Quantum Approximation Scheme for k-Means},

author = {Ragesh Jaiswal},

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

year  = {2024},

date = {2024-01-01},

abstract = {We give a quantum approximation scheme (i.e., (1+ε)-approximation for every ε>0) for the classical k-means clustering problem in the QRAM model with a running time that has only polylogarithmic dependence on the number of data points. This is the first quantum algorithm with a polylogarithmic running time that gives a provable approximation guarantee of (1+ε) for the k-means problem. Also, unlike previous works on unsupervised learning, our quantum algorithm does not require quantum linear algebra subroutines and has a running time independent of parameters (e.g., condition number) that appear in such procedures.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_334,

title = {A quasi-polynomial time classical algorithm for almost any noisy quantum circuit},

author = {Thomas Schuster and Norman Y. Yao},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_212,

title = {A security framework for quantum key distribution implementations},

author = {Guillermo Currás-Lorenzo and Margarida Pereira and Go Kato and Marcos Curty and Kiyoshi Tamaki},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_476,

title = {A Unified Theory of Barren Plateaus for Deep Parametrized Quantum Circuits},

author = {Martin Larocca and Marco Cerezo and Frederic Sauvage and Michael Ragone and Bojko Bakalov and Alexander Kemper and Carlos Ortiz Marrero},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_328,

title = {Accelerated Convergence in Training Quantum Neural Network with Modest Depths},

author = {Kaining Zhang and Junyu Liu and Liu Liu and Liang Jiang and Min-Hsiu Hsieh and Dacheng Tao},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_9,

title = {Accelerating quantum optimal control of multi-qubit systems with symmetry-based Hamiltonian transformations},

author = {Xian Wang and Mahmut Sait Okyay and Bryan M. Wong},

url = {https://doi.org/10.1116/5.0162455},

year  = {2024},

date = {2024-01-01},

abstract = {We present a novel, computationally efficient approach to accelerate quantum optimal control calculations of large multi-qubit systems. By leveraging the system's intrinsic symmetry, the Hilbert space can be decomposed and the Hamiltonians block diagonalized to enable extremely fast quantum optimal control calculations. Our approach reduces the computational runtime of qubit optimal control calculations by orders of magnitude while maintaining the same accuracy as the original method. This symmetry-based method can be generalized to a variety of multi-qubit systems with Trotterization techniques. As prospective applications, we propose the concept of symmetry-protected subspaces, which can be potential platforms for preparing symmetric states, realizing quantum gates simultaneously, quantum error suppression, and quantum simulation.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_80,

title = {Achieving the Heisenberg limit with Dicke States in noisy quantum meterology},

author = {Zain Saleem and Michael A Perlin and Anil Shaji and Stephen Gray},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_469,

title = {Activation of post-quantumness in generalized EPR scenarios},

author = {Beata Zjawin and Matty Hoban and Ana Belén Sainz and Paul Skrzypczyk},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_503,

title = {Advances in quantum algorithms for the shortest s-t path problem.},

author = {Adam Wesolowski and Stephen Piddock},

year  = {2024},

date = {2024-01-01},

abstract = {We study a fundamental problem in graph theory of finding the shortest path between vertices in 

an undirected, weighted graph. We present quantum algorithms in the adjacency array model which for the considered instances show a polynomial separation over the best known classical and quantum algorithms. First of our approaches is based on sampling the quantum flow state in a divide and conquer framework. Our second approach is based on querying the classical shadow of the quantum flow state and following a greedy algorithm. In particular, we show that using O(m) space we can find the shortest path in time that is asymptotically equal to the time required for detecting a path.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_559,

title = {Advantage of Hardy's nonlocal correlation in reverse zero-error channel coding},

author = {Mir Alimuddin and Ananya Chakraborty and Govind Lal Sidhardh and Ram Krishna Patra and Samrat Sen and Sahil Gopalkrishna Naik and Manik Banik},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_441,

title = {Advantage of multi-partite entanglement for quantum cryptography over long and short ranged networks},

author = {Janka Memmen and Jens Eisert and Nathan Walk},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_275,

title = {Advantage of Quantum Machine Learning from General Computational Advantages},

author = {Hayata Yamasaki and Natsuto Isogai and Mio Murao},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_138,

title = {Advantage of Quantum Neural Networks as Quantum Information Decoders},

author = {Oles Shtanko and Weishun Zhong and Ramis Movassagh},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_358,

title = {Æ codes},

author = {Shubham P. Jain and Eric R. Hudson and Wesley C. Campbell and Victor V. Albert},

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

year  = {2024},

date = {2024-01-01},

abstract = {Diatomic molecular codes [1] are designed to encode quantum information in the orientation of a diatomic molecule, allowing error correction from small torques and changes in angular momentum. In this work, we directly study noise native to atomic and molecular platforms – spontaneous emission, stray electromagnetic fields, and Raman scattering – and show that diatomic molecular codes fail against this noise. I will derive simple necessary and sufficient conditions for codes to protect against such noise. We also identify existing and develop new absorption-emission (Æ) codes that are more practical than molecular codes, require lower average momentum, can directly protect against photonic processes up to arbitrary order, and are applicable to a broader set of atomic and molecular systems. [1] Robust encoding of a qubit in a molecule, Albert V., Covey J., Preskill J., PhysRevX.10.031050, arXiv:1911.00099},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_165,

title = {Alchemy of quantum coherence: Arbitrary amplification in catalytic and asymptotic coherence manipulation},

author = {Naoto Shiraishi and Ryuji Takagi},

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

year  = {2024},

date = {2024-01-01},

abstract = {Quantum coherence is one of the fundamental aspects distinguishing classical and quantum theories. Coherence between different energy eigenstates is particularly important, as it serves as a valuable resource under the law of energy conservation. A fundamental question in this setting is how well one can prepare good coherent states from low coherent states and whether a given coherent state is convertible to another one. Here, we show that any low coherent state is convertible to any high coherent state arbitrarily well in two operational settings: asymptotic and catalytic transformations. For a variant of asymptotic coherence manipulation where one aims to prepare desired states in local subsystems, the rate of transformation becomes unbounded regardless of how weak the initial coherence is. In a non-asymptotic transformation with a catalyst, a helper state that locally remains in the original form after the transformation, we show that an arbitrary state can be obtained from any low coherent state. Applying this to the standard asymptotic setting, we find that a catalyst can increase the coherence distillation rate significantly—from zero to infinite rate. We also prove that such anomalous transformation requires small but non-zero coherence in relevant modes, establishing the condition under which a sharp transition of the operational capability occurs. Our results provide a general characterization of the coherence transformability in these operational settings and showcase their peculiar properties compared to other common resource theories such as entanglement and quantum thermodynamics.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_171,

title = {Algebra of Nonlocal Boxes and the Collapse of Communication Complexity},

author = {Pierre Botteron and Anne Broadbent and Reda Chhaibi and Ion Nechita and Clément Pellegrini},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_52,

title = {Algorithmic Cluster Expansions for Quantum Problems},

author = {Ryan Mann and Romy Minko},

url = {https://arxiv.org/abs/2306.08974 https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1716175598-poster-52.pdf},

year  = {2024},

date = {2024-01-01},

abstract = {We establish a general framework for developing approximation algorithms for a class of counting problems. Our framework is based on the cluster expansion of abstract polymer models formalism of Kotecký and Preiss. We apply our framework to obtain efficient algorithms for (1) approximating probability amplitudes of a class of quantum circuits close to the identity, (2) approximating expectation values of a class of quantum circuits with operators close to the identity, (3) approximating partition functions of a class of quantum spin systems at high temperature, and (4) approximating thermal expectation values of a class of quantum spin systems at high temperature with positive-semidefinite operators. Further, we obtain hardness of approximation results for approximating probability amplitudes of quantum circuits and partition functions of quantum spin systems. This establishes a computational complexity transition for these problems and shows that our algorithmic conditions are optimal under complexity-theoretic assumptions. Finally, we show that our algorithmic condition is almost optimal for expectation values and optimal for thermal expectation values in the sense of zero freeness.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_170,

title = {All graph state verification protocols are composably secure},

author = {Léo Colisson and Damian Markham and Raja Yehia},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_500,

title = {All you need is Trotter},

author = {Gumaro Rendon},

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

year  = {2024},

date = {2024-01-01},

abstract = {The work here enables linear cost-scaling with evolution time t while keeping polylog(1/ε) scaling and no extra block-encoding qubits, where ε is the algorithmic error. This is achieved through product formulas, stable interpolation (Chebyshev), and to calculate the needed fractional queries, cardinal sine interpolation is used.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_289,

title = {Alleviating the quantum Big-M problem},

author = {Edoardo Alessandroni and Sergi Ramos-Calderer and Ingo Roth},

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

year  = {2024},

date = {2024-01-01},

abstract = {A major obstacle for quantum optimizers is the reformulation of constraints as a quadratic unconstrained binary optimization (QUBO). Current QUBO translators exaggerate the weight M of the penalty terms. Classically known as the "Big-M" problem, the issue becomes even more daunting for quantum solvers, since it affects the physical energy scale. We take a systematic, encompassing look at the quantum big-M problem, revealing NP-hardness in finding the optimal M and establishing bounds on the Hamiltonian spectral gap Δ, inversely related to the expected run-time of quantum solvers. We propose a practical translation algorithm, based on SDP relaxation, that outperforms previous methods in numerical benchmarks. Our algorithm gives values of Δ orders of magnitude greater, e.g. for portfolio optimization instances. Solving such instances with an adiabatic algorithm on 6-qubits of an IonQ device, we observe significant advantages in time to solution and average solution quality. Our findings are relevant to quantum and quantum-inspired solvers alike.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_509,

title = {An entanglement distillation-based state estimator},

author = {Joshua Carlo Casapao and Ananda Gopal Maity and Naphan Benchasattabuse and Michal Hajdusek and Rodney Van Meter and David Elkouss},

year  = {2024},

date = {2024-01-01},

abstract = {Estimating state parameters given the constraints on experimental effort and resource cost remains a challenge for practical quantum information processing. In this context, we demonstrate that Bell-diagonal parameters of an arbitrary state can be efficiently estimated solely from the measurement statistics of an idealized distillation protocol. Furthermore, we consider estimating those parameters within a more realistic distillation protocol that operates under noise. This novel estimation method is particularly beneficial for scenarios where distillation is an indispensable step.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_356,

title = {An implementable iterative quantum algorithm for approximating geometric entanglement},

author = {Andrii Semenov and Niall Murphy and Simone Patscheider and Elena Blokhina},

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

year  = {2024},

date = {2024-01-01},

abstract = {Entanglement is one of the fundamental properties of a quantum state and is a crucial differentiator between classical and quantum computation. There are many ways to define entanglement and its measure, depending on the problem or application under consideration. Each of these measures may be computed or approximated by multiple methods. However, hardly any of these methods can be run on near-term quantum hardware. This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states using rank-1 tensor approximation. This method is executable on current (hybrid) quantum hardware and does not depend on quantum memory. We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel. This model allows us to post hoc mitigate the effects of noise on the results of the computation.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_29,

title = {Applications of topological fault-tolerant quantum error correction in near-term devices},

author = {Sascha Heußen},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_389,

title = {Approximate t-design depths in generic circuit architectures},

author = {Daniel Belkin and James Allen and Soumik Ghosh and Christopher Kang and Sophia Lin and James Sud and Fred Chong and Bill Fefferman and Bryan Clark},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_210,

title = {Approximation Algorithms for Quantum Max-d-Cut},

author = {Zackary Jorquera and Steven Kordonowy and Stuart Wayland and Alexandra Kolla and Charlie Carlson},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_379,

title = {Arbitrary Polynomial Separations in Trainable Quantum Machine Learning},

author = {Eric Anschuetz and Xun Gao},

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

year  = {2024},

date = {2024-01-01},

abstract = {Recent theoretical results in quantum machine learning have demonstrated a general trade-off between the expressive power of quantum neural networks (QNNs) and their trainability; as a corollary of these results, practical exponential separations in expressive power over classical machine learning models are believed to be infeasible as such QNNs take a time to train that is exponential in the model size. We here circumvent these negative results by constructing a hierarchy of efficiently trainable QNNs that exhibit unconditionally provable, polynomial memory separations of arbitrary constant degree over classical neural networks in performing a classical sequence modeling task. Furthermore, each unit cell of the introduced class of QNNs is computationally efficient, implementable in constant time on a quantum device. The classical networks we prove a separation over include well-known examples such as recurrent neural networks and Transformers. We show that quantum contextuality is the source of the expressivity separation, suggesting that other classical sequence learning problems with long-time correlations may be a regime where practical advantages in quantum machine learning may exist.},

keywords = {Outstanding Poster, Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_179,

title = {Assessing non-Markovian dynamics through moments of the Choi state},

author = {Bivas Mallick and Saheli Mukherjee and Ananda Gopal Maity and Archan S. Majumdar},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_481,

title = {Authenticable (t,m) threshold quantum secret sharing scheme based on generalized unitary operators},

author = {Deepa Rathi and Sanjeev Kumar},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_231,

title = {Bases for optimising stabiliser decompositions of quantum states},

author = {Nadish Silva and Ming Yin and Sergii Strelchuk},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_90,

title = {Bayesian inference of quantum devices},

author = {Michele Dall'Arno},

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

year  = {2024},

date = {2024-01-01},

abstract = {We consider the scenario in which a black box with buttons and light bulbs is given so that, if any button is pressed a certain number of times, the corresponding probability distribution on the light bulbs lighting up can be observed. We model the black box as a prepare-and-measure setup, that is, an unspecified state is prepared upon the pressure of any button, and an unspecified measurement is performed on such a state. 

We consider the problem of the Bayesian inference of, say, the measurement (but, of course, we could consider the dual problem of inferring the states), that is, we aim at finding the measurement that maximizes the Bayesian posterior probability density, given the observations, for any given prior probability density on states and measurements. 

Our main result is to characterize such optimal measurements in the informationally complete (IC) case when uniform probability densities (i.e. maximal ignorance) are assumed on states and measurements. In particular, we prove that any measurement that produces the observations upon the input of a 2-design set of states is optimal, thus settling in closed-form the case of non-overcomplete measurements, for which the only 2-design is the symmetric, informationally complete (SIC) set of states. Being data-driven, the inferential setup we consider offers a solution to the chicken-or-egg problem of usual quantum tomography, that is, the fact that the tomography of a measurement requires the knowledge of the input states, whereas the tomography of the states requires the knowledge of the measurement, in a neverending loop.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_429,

title = {Benchmarking bosonic and fermionic dynamics},

author = {Jadwiga Wilkens and Marios Ioannou and Ellen Derbyshire and Jens Eisert and Dominik Hangleiter and Ingo Roth and Jonas Haferkamp},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_530,

title = {Biased Clifford Classical Shadows Tomography},

author = {Angus Mingare and Timothy Weaving and Peter Coveney},

year  = {2024},

date = {2024-01-01},

abstract = {The variational quantum eigensolver (VQE) is a near-term quantum algorithm designed to estimate the groundstate energy of a molecular system. Unfortunately to achieve accurate results VQE requires a prohibitive number of shots, thus far restricting its utility to very small systems. Classical shadows tomography (CST) is a partial tomography scheme that can predict many properties of a quantum system given relatively few measurements. It has been suggested as a solution to the measurement problem in VQE and comes with the additional benefit of "measure now, ask questions later". That is, because CST doesn't need to know a priori which observables we are wanting to estimate, the same measurement results can be recycled to predict arbitrary expectation values. In this work, we develop a biasing scheme for Clifford-measurement CST that can be used to improve the accuracy of expectation value estimations for observables known a priori (such as the groundstate energy) while not sacrificing the ability to predict arbitrary expectation values, something that is lost in biased Pauli-measurement CST schemes. We demonstrate the method by simultaneously measuring the groundstate energy and arbitrary Pauli strings for a range of molecular systems. This work successfully improves Clifford-measurement CST for use within VQE while staying faithful to the core principle of CST.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_304,

title = {Bosonic randomized benchmarking with passive transformations},

author = {Mirko Arienzo and Martin Kliesch and Markus Heinrich},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_555,

title = {Bound Entanglement in Cyclic Sign Invariant States},

author = {Aabhas Gulati and Ion Nechita and Satvik Singh},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_456,

title = {Bounding the quantum violation of causal inequalities},

author = {Zixuan Liu and Giulio Chiribella},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_35,

title = {BQP, meet NP: Search-to-decision reductions and approximate counting},

author = {Jonas Kamminga and Sevag Gharibian},

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

year  = {2024},

date = {2024-01-01},

abstract = {What is the power of polynomial-time quantum computation with access to an NP oracle? In this work, we focus on two fundamental tasks from the study of Boolean satisfiability (SAT) problems: search-to-decision reductions, and approximate counting. We first show that, in strong contrast to the classical setting where a poly-time Turing machine requires Θ(n) queries to an NP oracle to compute a witness to a given SAT formula, quantumly Θ(logn) queries suffice. We then show this is tight in the black-box model - any quantum algorithm with "NP-like" query access to a formula requires Ω(logn) queries to extract a solution with constant probability. Moving to approximate counting of SAT solutions, by exploiting a quantum link between search-to-decision reductions and approximate counting, we show that existing classical approximate counting algorithms are likely optimal. First, we give a lower bound in the "NP-like" black-box query setting: Approximate counting requires Ω(logn) queries, even on a quantum computer. We then give a "white-box" lower bound (i.e. where the input formula is not hidden in the oracle) - if there exists a randomized poly-time classical or quantum algorithm for approximate counting making o(logn) NP queries, then BPP^NP[o(n)] contains a P^NP-complete problem if the algorithm is classical and FBQP^NP[o(n)] contains an FP^NP-complete problem if the algorithm is quantum.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_342,

title = {Bridging non-Gaussian and magic resources via Gottesman-Kitaev-Preskill encoding},

author = {Oliver Hahn and Giulia Ferrini and Ryuji Takagi},

year  = {2024},

date = {2024-01-01},

abstract = {Although the similarity between non-stabilizer states—also known as magic states—in discrete-variable systems and non-Gaussian states in continuous-variable systems has widely been recognized, the precise connections between these two notions have still been unclear. We establish a fundamental link between these two quantum resources via the Gottesman-Kitaev-Preskill (GKP) encoding. We show that the negativity of the continuous-variable Wigner function for an encoded GKP state coincides with a magic measure we introduce, which matches the negativity of the discrete Wigner function for odd dimensions. We also provide a continuous-variable representation of the stabilizer R'enyi entropy—a recent proposal for a magic measure for multi-qubit states. With this in hand, we give a classical simulation algorithm with runtime scaling with the resource contents, quantified by our magic measures. We also employ our results to prove that implementing a multi-qubit logical non-Clifford operation in the GKP code subspace requires a non-Gaussian operation even at the limit of perfect encoding, despite the fact that the ideal GKP states already come with much non-Gaussianity.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_37,

title = {Can we stochastically distil quantum steering and measurement incompatibility?},

author = {Chung-Yun Hsieh and Huan-Yu Ku and Shin-Liang Chen and Yueh-Nan Chen and Costantino Budroni},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_164,

title = {Causal Classification of Spatiotemporal Quantum Correlations},

author = {Minjeong Song and Varun Narasimhachar and Bartosz Regula and Thomas Elliott and Mile Gu},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_88,

title = {Causal influence versus signalling for interacting quantum channels},

author = {Kathleen Barsse and Paolo Perinotti and Alessandro Tosini and Leonardo Vaglini},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_95,

title = {Certifying entanglement dimensionality by the moment method},

author = {Changhao Yi and Xiaodi Li and Huangjun Zhu},

year  = {2024},

date = {2024-01-01},

abstract = {In this paper, we combine the k-reduction map, the moment method and the classical shadow 

method into a practical entanglement dimensionality certification protocol. The core of our protocol 

utilizes finite order reduction moments of the target state to determine if it remains positive under 

the application of the k-reduction map. First, we study the spectrum of the k-reduced operators. 

Further, similar with the entanglement negativity, we introduce the definition of k-reduction neg- 

ativity, explore its properties to characterize the violation of the criterion. Second, we apply the 

moment methods to the k-reduction map, and construct the reduction moment criteria systemati- 

cally by considering the spectrum information. Our final protocol applies to a much wider range of 

states than the fidelity-based methods. Additionally, our method only requires a unitary-3 design, 

making it more feasible in practice than the correlation matrix method. We further explore the de- 

tectable abilities of different protocols and demonstrate the efficiency of our protocol with analytical and numerical examples},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_515,

title = {Certifying high-dimensional entanglement using measurements in arbitrary bases},

author = {Nicky Kai Hong Li and Marcus Huber and Nicolai Friis},

year  = {2024},

date = {2024-01-01},

abstract = {Certifying entanglement is an important step in the development of many quantum technologies, especially for higher-dimensional systems, where entanglement promises increased capabilities for quantum communication. A key feature distinguishing entanglement from classical correlations is the occurrence of correlations for complementary measurement bases. In particular, mutually unbiased bases (MUBs) are a paradigmatic example that is well-understood and routinely employed for entanglement certification. However, implementing unbiased measurements exactly is challenging and not generically possible for all physical platforms. Here, we extend the entanglement-certification toolbox from correlations in MUBs to arbitrary bases, even without requiring aligned reference frames. This represents a practically significant simplification that paves the way for the efficient characterization of high-dimensional entanglement in a wide range of physical systems.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_97,

title = {Certifying long-range quantum correlations in routed Bell tests},

author = {Edwin Peter Lobo and Jef Pauwels and Stefano Pironio},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_376,

title = {Certifying nonstabilizerness in quantum processors},

author = {Rafael Wagner and Filipa Peres and Emmanuel Cruzeiro and Ernesto Galvão},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_353,

title = {Certifying the metrological usefulness of quantum statistics: a semidefinite programming approach},

author = {Grzegorz Rajchel-Mieldzioć},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_408,

title = {Characterizing optimal measurements for quantum property testing},

author = {Angus Lowe and Benjamin Lovitz},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_200,

title = {Choi-Defined Resource Theories},

author = {Elia Zanoni and Carlo Maria Scandolo},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_53,

title = {Circuit complexity of quantum access models for encoding classical data},

author = {Xiao-Ming Zhang and Xiao Yuan},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_319,

title = {Circuit compression through qubit logic on qudits (QLOQ) with scalable advantage},

author = {Liam Lysaght and Patrick Sinnott and Timothée Goubault and Pierre-Emmanuel Emeriau},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_471,

title = {Circuits as a self-contained graphical language},

author = {William Schober},

year  = {2024},

date = {2024-01-01},

abstract = {Quantum circuit diagrams can be axiomatized as a standalone graphical language. Once imbued with a set of rewrite rules, circuits can be used to compute graphically. This provides a way to transform one circuit into another without converting to a more powerful graphical language like ZX-calculus, circumventing the circuit extraction problem simply by keeping every step of the calculation a circuit. I present a preliminary list of rewrite rules for circuit diagrams and show some example calculations.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_144,

title = {Classical algorithm for simulating experimental Gaussian boson sampling},

author = {Changhun Oh and Minzhao Liu and Yuri Alexeev and Bill Fefferman and Liang Jiang},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_374,

title = {Classical simulation of non-Gaussian bosonic circuits},

author = {Beatriz Dias and Robert Koenig},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_394,

title = {Classicality with no-information without disturbance},

author = {Marco Erba and Paolo Perinotti and Davide Rolino and Alessandro Tosini},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_383,

title = {Classifying fermionic states via many-body correlation measures},

author = {Mykola Semenyakin and Yevheniia Cheipesh and Yaroslav Herasymenko},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_153,

title = {Clifford Group and Unitary Designs under Symmetry},

author = {Yosuke Mitsuhashi and Nobuyuki Yoshioka},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_135,

title = {Clustering theorem in 1D long-range interacting systems at arbitrary temperatures},

author = {Yusuke Kimura and Tomotaka Kuwahara},

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

year  = {2024},

date = {2024-01-01},

abstract = {This paper delves into a fundamental aspect of quantum statistical mechanics – the absence of thermal phase transitions in one-dimensional (1D) systems. Originating from Ising's analysis of the 1D spin chain, this concept has been pivotal in understanding 1D quantum phases, especially those with finite-range interactions as extended by Araki. In this work, we focus on quantum long-range interactions and successfully derive a clustering theorem applicable to a wide range of interaction decays at arbitrary temperatures. This theorem applies to any interaction forms that decay faster than r^-2 and does not rely on translation invariance or infinite system size assumptions. Also, we rigorously established that the temperature dependence of the correlation length is given by e^const.β, which is the same as the classical cases. Our findings indicate the absence of phase transitions in 1D systems with super-polynomially decaying interactions, thereby expanding upon previous theoretical research. To overcome significant technical challenges originating from the divergence of the imaginary-time Lieb-Robinson bound, we utilize the quantum belief propagation to refine the cluster expansion method. This approach allowed us to address divergence issues effectively and contributed to a deeper understanding of low-temperature behaviors in 1D quantum systems.},

keywords = {Outstanding Poster, Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_25,

title = {Comparing resource requirements of noisy quantum simulation algorithms for the Tavis-Cummings model},

author = {Alisa Haukisalmi and Matti Raasakka and Ilkka Tittonen},

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

year  = {2024},

date = {2024-01-01},

abstract = {Fault-tolerant quantum computers could facilitate the simulation of quantum systems unfeasible for classical computation. However, the noisy intermediate-scale quantum (NISQ) devices of the present and near-term are limited, and their utilization requires additional strategies. These include quantum error mitigation (QEM) for alleviating device noise and variational quantum algorithms (VQAs), which combine classical optimization with short-depth parameterized quantum circuits. We compare two such methods: zero-noise extrapolation (ZNE) with noise amplification by circuit folding, and incremental structural learning (ISL), a type of circuit recompiling VQA. These are applied to trotterized time-evolution of the Tavis-Cummings model (TCM) under a noise simulation. Since both methods add circuit evaluation overhead, it is of interest to see how they compare both in the accuracy of the dynamics they produce, and in terms of the quantum resources used. Additionally, noisy recompilation of time-evolution circuits with ISL has not previously been explored to our knowledge. We find that while ISL achieves lower error than ZNE for smaller system sizes, it fails to produce correct dynamics for 4 qubits, where ZNE is superior. Diverging resource requirements for ISL and ZNE are observed, with ISL achieving low circuit depths at the cost of a large number of circuit evaluations.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_217,

title = {Complexity of Fermionic 2-SAT},

author = {Maarten Stroeks and Barbara Terhal},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_198,

title = {Complexity of Gaussian Quantum Optics with a Limited Number of Non-Linearities},

author = {Michael Gide Jabbour and Leonardo Novo},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_478,

title = {Comprehensive Analysis on Image Generation using Quantum Generative Adversarial Network},

author = {Ashish Solanki and Dr. Sandeep Singh Kang},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_220,

title = {Computing exact moments of local random quantum circuits via tensor networks},

author = {Paolo Braccia and Pablo Bermejo and Lukasz Cincio and Marco Cerezo},

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

year  = {2024},

date = {2024-01-01},

abstract = {A fundamental concept in quantum information is the computation of the moments of the distribution of expectation values. These moments describe the distribution obtained by sending a quantum state through a random unitary transformation (a circuit), sampled from some distribution, and then measuring a specific observable. While calculating these moments exactly is typically challenging, if the unitary transformation consists of local random gates, one can estimate these moments using Monte Carlo simulations of a process similar to a Markov chain. However, this method may require an impractically large number of samples or may suffer from the sign problem. In this work, we propose an alternative approach to estimate the moments using tensor networks. In this method, the operators corresponding to the moments of the local gates are represented as small dimensional tensors acting on their local commutant bases. By utilizing representation theoretical tools, we analyze the local tensor dimensions and provide bounds for the bond dimension of the matrix product states that arise from deep circuits. We compare our techniques against Monte Carlo simulations and demonstrate that our approach significantly outperforms them. Additionally, we illustrate how tensor networks can precisely compute the second moment when the unitary transformation is a quantum neural network acting on thousands of qubits and containing thousands of gates. Finally, we numerically study the anticoncentration phenomena in circuits with orthogonal random gates, a task that cannot be effectively studied using Monte Carlo methods due to sign problems.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_472,

title = {Concatenated Steane code with single-flag syndrome checks},

author = {Balint Pato and Theerapat Tansuwannont and Kenneth R. Brown},

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

year  = {2024},

date = {2024-01-01},

abstract = {A fault-tolerant error correction (FTEC) protocol with a high error suppression rate and low overhead is very desirable for the near-term implementation of quantum computers. In this work, we develop a distance-preserving flag FTEC protocol for the [[49,1,9]] concatenated Steane code, which requires only two ancilla qubits per generator and can be implemented on a planar layout. We generalize the weight-parity error correction (WPEC) technique from [1] and find a gate ordering of flag circuits for the concatenated Steane code which makes syndrome extraction with two ancilla qubits per generator possible. The FTEC protocol is constructed using the optimization tools for flag FTEC developed in [2] and is simulated under the circuit-level noise model without idling noise. Our simulations give a pseudothreshold of 1.64×10^−3 for the [[49,1,9]] concatenated Steane code, which is better than a pseudothreshold of 1.43×10^−3 for the [[61,1,9]] 6.6.6 color code simulated under the same settings. This is in contrast to the code capacity model where the [[61,1,9]] code performs better. 

[1] T. Tansuwannont and D. Leung. ""Fault-tolerant quantum error correction using error weight parities."" Physical Review A 104, 042410 (2021). [2] B. Pato, T. Tansuwannont, S. Huang, and K. R. Brown. ""Optimization tools for distance-preserving flag fault-tolerant error correction."" PRX Quantum 5, 020336 (2024).},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_461,

title = {Constrained and Vanishing Expressivity of Quantum Fourier Models},

author = {Hela Mhiri and Leo Monbroussou and Mario Herrero-Gonzales and Slimane Thabet and Jonas Landman and Elham Kashefi},

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

year  = {2024},

date = {2024-01-01},

abstract = {In this work, we highlight an unforeseen behavior of the expressivity of Parameterized Quantum Circuits (PQC) for machine learning. A large class of these models, seen as Fourier Series which frequencies are derived from the encoding gates, were thought to have their Fourier coefficients mostly determined by the trainable gates. Here, we demonstrate a new correlation between the Fourier coefficients of the quantum model and its encoding gates. In addition, we display a phenomenon of vanishing expressivity in certain settings, where some Fourier coefficients vanish exponentially when the number of qubits grows. These two behaviors imply novel forms of constraints which limit the expressivity of PQCs, and therefore imply a new inductive bias for Quantum models. The key concept in this work is the notion of a frequency redundancy in the Fourier series spectrum, which determines its importance. Those theoretical behaviours are observed in numerical simulations.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_419,

title = {Contextuality as a Necessary Resource for Quantum Random Access Code},

author = {Andrew Tanggara and Mile Gu and Farid Shahandeh},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_213,

title = {Continuous-variable quantum passive optical networks},

author = {Ivan Derkach and Adnan A. E. Hajomer and Radim Filip and Ulrik L. Andersen and Vladyslav C. Usenko and Tobias Gehring},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_178,

title = {Continuous-variable Quantum Position Verification secure against entangled attackers},

author = {Rene Allerstorfer and Llorenç Escolà-Farràs and Arpan Akash Ray and Boris Škorić and Florian Speelman},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_422,

title = {Correlated decoding of logical algorithms with transversal gates},

author = {Madelyn Cain and Chen Zhao and Hengyun Zhou and Nadine Meister and J. Pablo Bonilla Ataides and Arthur Jaffe and Dolev Bluvstein and Mikhail Lukin},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_272,

title = {Cost-optimal quantum error mitigation for early fault-tolerant quantum computation using white-noise approximation and symmetric Clifford twirling},

author = {Kento Tsubouchi and Yosuke Mitsuhashi and Nobuyuki Yoshioka},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_48,

title = {Cryptomite: A versatile and user-friendly library of randomness extractors},

author = {Cameron Foreman and Richie Yeung and Alec Edgington and Florian Curchod},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_6,

title = {Cutting circuits with multiple two-qubit unitaries},

author = {Lukas Schmitt and Christophe Piveteau and David Sutter},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_436,

title = {Decision diagrams yield genuinely novel capabilities for classically handling quantum information},

author = {Tim Coopmans and Arend-Jan Quist and Lieuwe Vinkhuijzen and Alfons Laarman},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_561,

title = {Deep Reinforcement Learning for Quantum State Preparation},

author = {Cesar Lema},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_531,

title = {Demonstration of quantum projective simulation on a single-photon-based quantum computer},

author = {Giacomo Franceschetto and Arno Ricou},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_468,

title = {Description of random unitary t-designs using Gaussian ensambles},

author = {Adam Sawicki and Piotr Dulian},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_305,

title = {Designs from Local Random Quantum Circuits with SU(d) Symmetry},

author = {Zimu Li and Han Zheng and Junyu Liu and Liang Jiang and Zi-Wen Liu},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_520,

title = {Detecting quantum phase transitions in a frustrated spin chain via transfer learning of a quantum classifier algorith},

author = {Askery Canabarro and André Juan Ferreira Martins and Rafael Chaves and Rodrigo Pereira and Diogo Soares Pinto and Leandro Silva and Alberto Palhares},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_100,

title = {Deterministic generation of hybrid entangled states using quantum walks},

author = {Vikash Mittal and Jaskaran Singh and Soumyakanti Bose},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_187,

title = {Device-independent certification of quantum gates under the dimension assumption},

author = {Nikolai Miklin and Jan Nöller and Martin Kliesch and Mariami Gachechiladze},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_247,

title = {Digital-analog quantum learning on Rydberg atom arrays},

author = {Jonathan Z. Lu and Lucy Jiao and Kristina Wolinski and Milan Kornjača and Hong-Ye Hu and Sergio Cantu and Fangli Liu and Susanne F. Yelin and Sheng-Tao Wang},

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

year  = {2024},

date = {2024-01-01},

abstract = {We propose hybrid digital-analog learning algorithms on Rydberg atom arrays, combining the potentially practical utility and near-term realizability of quantum learning with the rapidly scaling architectures of neutral atoms. Our construction requires only single-qubit operations in the digital setting and global driving according to the Rydberg Hamiltonian in the analog setting. We perform a comprehensive numerical study of our algorithm on both classical and quantum data, given respectively by handwritten digit classification and unsupervised quantum phase boundary learning. We show in the two representative problems that digital-analog learning is not only feasible in the near term, but also requires shorter circuit depths and is more robust to realistic error models as compared to digital learning schemes. Our results suggest that digital-analog learning opens a promising path towards improved variational quantum learning experiments in the near term.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_552,

title = {Distilling Nonlocality in Quantum Correlations},

author = {Sahil Gopalkrishna Naik and Govind Lal Sidhardh and Samrat Sen and Arup Roy and Ashutosh Rai and Manik Banik},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_87,

title = {Does provable absence of barren plateaus imply classical simulability? Or, why we need to rethink variational quantum computing},

author = {Marco Cerezo and Martin Larocca and Diego García-Martín and Nahuel Diaz and Paolo Braccia and Enrico Fontana and Manuel Rudolph and Pablo Bermejo and Aroosa Ijaz and Supanut Thanasilp and Eric Anschuetz and Zoe Holmes},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_64,

title = {Does qubit connectivity impact quantum circuit complexity?},

author = {Pei Yuan and Jonathan Allcock and Shengyu Zhang},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_92,

title = {Doubling efficiency of Hamiltonian simulation via Generalized Quantum Signal Processing},

author = {Dominic Berry and Danial Motlagh and Giacomo Pantaleoni and Nathan Wiebe},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_565,

title = {Doubly optimal parallel wire cutting without ancilla qubits},

author = {Hiroyuki Harada and Kaito Wada and Naoki Yamamoto},

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

year  = {2024},

date = {2024-01-01},

abstract = {A restriction in the quality and quantity of available qubits presents a substantial obstacle to the application of near-term and early fault-tolerant quantum computers in practical tasks. To confront this challenge, some techniques for effectively augmenting the system size through classical processing have been proposed; one promising approach is quantum circuit cutting. The main idea of quantum circuit cutting is to decompose an original circuit into smaller sub-circuits and combine outputs from these sub-circuits to recover the original output. Although this approach enables us to simulate larger quantum circuits beyond physically available circuits, it needs classical overheads quantified by the two metrics: the sampling overhead in the number of measurements to reconstruct the original output, and the number of channels in the decomposition. Thus, it is crucial to devise a decomposition method that minimizes both of these metrics, thereby reducing the overall execution time. This paper studies the problem of decomposing the $n$-qubit identity channel, i.e., $n$-parallel wire cutting, into a set of local operations and classical communication; then we give an optimal wire-cutting method comprised of channels based on mutually unbiased bases, that achieves minimal overheads in both the sampling overhead and the number of channels, without ancilla qubits. This is in stark contrast to the existing method that achieves the optimal sampling overhead yet with ancilla qubits. Moreover, we derive a tight lower bound of the number of channels in parallel wire cutting without ancilla systems and show that only our method achieves this lower bound among the existing methods. Notably, our method shows an exponential improvement in the number of channels, compared to the aforementioned ancilla-assisted method that achieves optimal sampling overhead.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_78,

title = {Dual frame optimization for informationally complete quantum measurements},

author = {Laurin E. Fischer and Timothée Dao and Ivano Tavernelli and Francesco Tacchino},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}