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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_494,

title = {Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation},

author = {Oriel Kiss and Utkarsh Azad and Alessandro Roggero and Juan Miguel Arrazola and Borja Requena and David Wakeham},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_542,

title = {Efficiency Analysis of Continuous Variable Quantum Communication Lines in the Presence of Fluctuating Parameters},

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

year  = {2024},

date = {2024-01-01},

abstract = {The emergence of quantum mechanics has led to the development of quantum technologies such as quantum communication. In order to optimize the performance of this technology, understanding quantum channels and assessing their efficacy, typically through concepts like transmission capacity, is essential. This study focuses on the entanglement-assisted classical capacity of certain types of quantum channels, specifically convex combinations of pure loss channels, aiming to identify states that outperform standard thermal states in communication performance. Through iterative approaches, optimal states maximizing quantum mutual information are identified, providing explicit values for channel capacity.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_301,

title = {Efficient and practical Hamiltonian simulation from time-dependent product formulas},

author = {Raul A. Santos and Jan Lukas Bosse and Filippo Maria Gambetta and Ashley Montanaro and Andrew M. Childs and Charles Derby},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_430,

title = {Efficient classical simulation of quantum computation beyond Wigner positivity},

author = {Michael Zurel and Arne Heimendahl},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_372,

title = {Efficient classical surrogate simulation of quantum circuits},

author = {Manuel S. Rudolph and Enrico Fontana and Ross Duncan and Ivan Rungger and Zoe Holmes and Lukasz Cincio and Cristina Cirstoiu},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_344,

title = {Efficient distributed inner product estimation via Pauli sampling},

author = {Marcel Hinsche and Marios Ioannou and Sofiene Jerbi and Lorenzo Leone and Jens Eisert and Jose Carrasco},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_499,

title = {Efficient erasure of quantum information beyond Landauer's limit},

author = {Carlos Octavio Ribeiro Neto and Bertúlio Bernardo},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_475,

title = {Efficient Implementation of Multi-Controlled Quantum Gates},

author = {Ben Zindorf and Sougato Bose},

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

year  = {2024},

date = {2024-01-01},

abstract = {We present an implementation of multi-controlled quantum gates which provides significant reductions of cost compared to state-of-the-art methods. The operator applied on the target qubit is a unitary, special unitary, or the Pauli X operator (Multi-Controlled Toffoli). The required number of ancilla qubits is no larger than one, similarly to known linear cost decompositions. We extend our methods for any number of target qubits, and provide further cost reductions if additional ancilla qubits are available. For each type of multi-controlled gate, we provide implementations for unrestricted (all-to-all) connectivity and for linear-nearest-neighbor. All of the methods use a linear cost of gates from the Clifford+T (fault-tolerant) set. In the context of linear-nearest-neighbor architecture, the cost and depth of our circuits scale linearly irrespective of the position of the qubits on which the gate is applied. Our methods directly improve the compilation process of many quantum algorithms, providing optimized circuits, which will result in a large reduction of errors.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_504,

title = {Efficient state preparation for multivariate Monte Carlo simulation},

author = {Hitomi Mori and Kosuke Mitarai and Keisuke Fujii},

year  = {2024},

date = {2024-01-01},

abstract = {Quantum state preparation is a task to prepare a state with a specific function encoded in the amplitude, which is an essential subroutine in many quantum algorithms. In this paper, we focus on multivariate state preparation, as it is an important extension for many application areas. Specifically in finance, multivariate state preparation is required for multivariate Monte Carlo simulation, which is used for important numerical tasks. Using the existing method, multivariate quantum state preparation requires the number of gates exponential in the number of variables. For this task, we propose a quantum algorithm that only requires the number of gates linear in the number of variables. Our algorithm utilizes multivariable quantum signal processing (M-QSP), a technique to perform the multivariate polynomial transformation of the amplitude. Using easily prepared block-encodings corresponding to each variable, we apply the M-QSP in the subspace to construct the target function. In this way, our algorithm prepares the target state efficiently for functions achievable with M-QSP.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_332,

title = {Efficient, informative and versatile confidence region for quantum state tomography},

author = {Carlos Gois and Matthias Kleinmann},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_413,

title = {Efficiently verifiable quantum advantage on near-term analog quantum simulators},

author = {Zhenning Liu and Dhruv Devulapalli and Dominik Hangleiter and Yi-Kai Liu and Alicia Kollár and Alexey Gorshkov and Andrew Childs},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_357,

title = {Encoding Majorana codes},

author = {Maryam Mudassar and Riley Chien and Daniel Gottesman},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_333,

title = {Entanglement cost of discriminating quantum states under locality constraints},

author = {Chenghong Zhu and Chengkai Zhu and Zhiping Liu and Xin Wang},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_350,

title = {Entanglement detection with trace polynomials},

author = {Albert Rico and Felix Huber},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_327,

title = {Entanglement-symmetries of covariant channels},

author = {Dominic Verdon},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_450,

title = {Entropy Density Benchmarking of Near-Term Quantum Circuits},

author = {Marine Demarty and James Mills and Raul Garcia-Patron},

year  = {2024},

date = {2024-01-01},

abstract = {Understanding the limitations imposed by noise on current and next generation quantum devices is a crucial step towards demonstrations of quantum advantage with practical applications. In this work we investigate the accumulation of entropy as a benchmark to monitor the performance of quantum processing units. A combination of numerical simulations and experiments on programmable superconducting quantum circuits provides further evidence that global depolarising noise is an excellent back-of-the-envelope predictive model. The monitoring of entropy density not only provides a complementary approach to existing circuit-level benchmarking techniques, but more importantly, it provides a much needed bridge between circuit-level and application-level benchmarking protocols. Our work shows that the combination of analytical, numerical and experimental methods, has the potential to build good heuristic models that improve over existing techniques to bound the circuit size above which quantum advantage is lost.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_544,

title = {Equivalence between operator spreading and information propagation},

author = {Cheng Shang and Hayato Kinkawa and Tomotaka Kuwahara},

year  = {2024},

date = {2024-01-01},

abstract = {A critical and unresolved problem in information science is: What are the precise limits of quantum communication? Dr. T. Kuwahara and I are curious whether this challenge can be solved through the powerful techniques of operator spreading. In 1972, the concept of the Lieb-Robinson bound was proposed, defining the maximum propagation of any information inside quantum many-body systems. This principle, intimately linked to the spreading of operators, finds extensive application in areas such as quantum simulation and information scrambling. On the other hand, the Holevo capacity characterizes the maximum amount of classical information that can be transferred through a quantum channel. In this poster, Dr. T. Kuwahara and I first established the general connection between the Holevo capacity and the Lieb-Robinson bound. We first provided the rigorous conditions under which operator spreading is equivalent to information propagation. We then provided two generalized theorems for the limits of quantum communication as long as unitary time evolution is satisfied. Theorem one universally gives strict upper and lower bounds on the amount of classical information over a quantum channel. Theorem two generalized shows rigorous upper and lower bounds on the entanglement capacity, which is the quantum information theoretic counterpart of heat capacity. Moving forward, we intend to extend our findings to open systems and explore the complexity of quantum dissipative dynamics from an information-theoretic lens.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_315,

title = {Erasure Qubits with shorter syndrome cycles and biased noise on dual-rail transmons},

author = {Yotam Vaknin and Alex Retzker},

year  = {2024},

date = {2024-01-01},

abstract = {Erasure qubits are a promising path to achieving error rates below the error-correcting threshold with current superconducting hardware. In this study, we investigate in detail the effect of erasure on dual-rail qubits, a major candidate for erasure qubits based on transmons. We find that reducing the number of erasure detections per round can reduce the physical requirement on the transmons composing the dual-rails. We further show that by changing the type of 2-Qubit gate, we can bias the erasure noise and further improve the erasure threshold using the XZZX code. Since dual-rails can detect decay and leakage without disturbing the logical subspace, we further show how they can mitigate the effect of leakage better than standard transmons, since the effect of false-positive and false-negative detection can be controlled by changing the number of detections per round.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_368,

title = {Error Correction in Dynamical Codes},

author = {Xiaozhen Fu and Daniel Gottesman},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_446,

title = {Error interference in quantum simulation},

author = {Boyang Chen and Jue Xu and Xiao Yuan and Qi Zhao},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_445,

title = {Error Mitigation via N-Representability conditions},

author = {Junxiang Huang and Qiming Ding and Xiao Yuan},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_405,

title = {Error-Robust Quantum Signal Processing using Rydberg Atoms},

author = {Sina Zeytinoglu and Sho Sugiura},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_294,

title = {Estimating the entanglement of random multipartite quantum states},

author = {Khurshed Fitter and Cécilia Lancien and Ion Nechita},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_367,

title = {Eternal Wormhole-Assisted Transfer in Critical Spin Chains},

author = {Emil Khabiboulline and Neeraj Tata and Daniel Jafferis and Mikhail Lukin},

year  = {2024},

date = {2024-01-01},

abstract = {Preparing the ground state of two weakly coupled Sachdev-Ye-Kitaev (SYK) models and perturbing one side, the excitation emerges on the other side, oscillating back and forth, consistent with a particle traversing an eternal wormhole. We show that critical spin chains with no simple gravitational dual have similar features. In particular, they exhibit non-thermalizing revivals with an enhancement in transmission speed, in agreement with 1+1-dimensional conformal field theory. We provide microscopic descriptions in terms of operator spreading resulting in a speed-up of information transfer, contrasting generic many-body behavior from gravitational. The limited amount of required experimental control eases study in analog quantum simulators, such as arrays of Rydberg atoms.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_547,

title = {Exact results on matrix inversion polynomials},

author = {Bjorn Berntson and Zalan Nemeth and Andrew Patterson and Christoph Sünderhauf},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_401,

title = {Expanding the reach of quantum optimization with fermionic embeddings},

author = {Andrew Zhao and Nicholas Rubin},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_336,

title = {Exponential concentration in quantum kernel methods},

author = {Supanut Thanasilp and Samson Wang and Marco Cerezo and Zoe Holmes},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_526,

title = {Facets of correlated non-Markovian quantum channels},

author = {Vivek Balsaheb Sabale and Nihar Ranjan Dash and Atul Kumar and Subhashish Banerjee},

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

year  = {2024},

date = {2024-01-01},

abstract = {We investigate the domain of correlated non-Markovian channels, exploring the potential memory arising 

from the correlated action of channels and the inherent memory due to non-Markovian dynamics. The 

impact of channel correlations of different quantum channels is studied using different non-Markovianity 

indicators and measures. In addition, the dynamical aspects of correlated non-Markovian channels, 

including entanglement dynamics and changes in the volume of accessible states are explored. The 

article analyses both unital and non-unital correlated channels and links the correlation factor and error correction success probability},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_505,

title = {Fault Tolerant Quantum Error Mitigation},

author = {Alvin Gonzales and Anjala M Babu and Ji Liu and Zain Saleem and Mark Byrd},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_385,

title = {Fermionic Hamiltonians without trivial low-energy states},

author = {Yaroslav Herasymenko and Anurag Anshu and Barbara Terhal and Jonas Helsen},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_517,

title = {Frequency estimation with time uncertainty in non-Markovian processes},

author = {Zishen Li and Yuxiang Yang and Xinyue Long and Xiaodong Yang and Dawei Lu},

url = {http://www.notyetavailable.com},

year  = {2024},

date = {2024-01-01},

abstract = {Quantum control in the Markovian parameter estimation problem has been shown to improve precision scaling. However, the non-Markovian counterpart is much more complicated due to the memory effect of the environment. We ask whether an advantage gap exists between free-evolving and controlled non-Markovian processes in the context of quantum parameter estimation. We analyze a certain case where the system is subjected to a strong coupling environment. The desired parameter to be estimated is the system frequency. The whole experiment suffers from an unknown time uncertainty due to a bad clock. The experimenter can choose to estimate the system frequency with the free-evolving process or with the controlled process. We show that the latter has a better precision scaling than the former. This demonstrates that quantum control can improve quantum parameter estimation and increase robustness to certain hardware defects. Our work provides a new perspective on quantum parameter estimation with limited resources and may also shed light on the study of non-Markovian processes.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_532,

title = {Fully quantum arbitrarily varying channel coding for entanglement-assisted communication},

author = {Paula Belzig},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_303,

title = {Fundamental charges for dual-unitary circuits},

author = {Tom Holden-Dye and Lluis Masanes and Arijeet Pal and Christopher J Turner},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_473,

title = {Generating Function for Projected Entangled-Pair States},

author = {Wei-Lin Tu and Laurens Vanderstraeten and Norbert Schuch and Hyun-Yong Lee and Naoki Kawashima and Ji-Yao Chen},

url = {https://journals.aps.org/prxquantum/abstract/10.1103/PRXQuantum.5.010335 https://journals.aps.org/prb/abstract/10.1103/PhysRevB.103.205155},

year  = {2024},

date = {2024-01-01},

abstract = {While the recent development for projected entangled-pair states (PEPS) has demonstrated its capability in studying the ground states of two-dimensional quantum many-body systems, properties of quasiparticle excitations are still cumbersome to compute. The key bottleneck for this computation is the summation of infinitely many tensor diagrams. The way we solve this problem is to represent the tensor diagram summations as a suitably defined generating function [1] for PEPS, as demonstrated in Figure 1. This is possible due to locality of many-body systems and the fact that low-energy excitations only contain one or few quasiparticles. Taking a physically motivated form for excited states, we show that relevant objects in determining excitations can be expressed as derivatives of a single tensor diagram and thus can be efficiently computed [2]. With excited states available, dynamical correlations can also be conveniently computed. We hope that, through the adoption of tensor network generating functions, many physical properties can be more easily obtained with the tensor network algorithm. 

[1] W.-L. Tu, H.-K. Wu, N. Schuch, N. Kawashima, and J.-Y. Chen, Phys. Rev. B 103, 205155 (2021). [2] W.-L. Tu, L. Vanderstraeten, N. Schuch, H.-Y. Lee, N. Kawashima, and J.-Y. Chen, PRX Quantum 5, 010335 (2024).},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_346,

title = {Geodesic Algorithm for Unitary Gate Design with Time-Independent Hamiltonians},

author = {Dylan Lewis and Roeland Wiersema and Juan Carrasquilla and Sougato Bose},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_467,

title = {Geometrical Aspects Of Resources Distribution In Quantum Random Circuits},

author = {Andres Camilo Granda Arango and Federico Holik and Giussepe Sergioli and Roberto Giuntini},

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

year  = {2024},

date = {2024-01-01},

abstract = {Quantum computers have a great potential to provide a computational advantage in solving difficult problems that classical computers cannot effectively solve. The reason why quantum computers seem to be faster than their classical counterparts is not fully understood. Some works have suggested that 

entanglement and coherence could be the reason for the quantum speed-up. But certain results, such as the Gottesmann-Knill theorem, suggest that the answer is more complicated. Recent studies point to contextuality. 

In this work, we address the following question: how much of the different quantum resources can a particular device produce? By answering this question, we can understand its capabilities and better tailor its use to solve specific problems. 

In this context, we study the resources produced by quantum random circuits using different sets of elementary gates. For this goal we use different quantifiers. We start with the degree of violation of the Svetlichny inequalities to quantify non-locality, we also use different entanglement measures such 

as Tangle, Concurrency, Von Neumann Entropy, Negativity, etc. We first perform a theoretical 

study based on numerical simulations using Qiskit and the Amazon Braket SDK, compare our theoretical results with experimental data from real quantum processors, and provide a quantitative evaluation of 

their capabilities. 

Our study contributes to the ongoing debate on the quantum advantage, the certification of quantum devices and shows that entanglement and non-locality are indeed important resources that can be exploited by quantum random circuits. We also show that it is possible to compare them between different devices and that entanglement disappears as the noise in the circuit increases.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_402,

title = {Group-theoretic error mitigation enabled by classical shadows and symmetries},

author = {Andrew Zhao and Akimasa Miyake},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_442,

title = {Hamiltonian engineering of multi-body interactions in periodically driven Rydberg atom arrays},

author = {Nazli Ugur Koyluoglu and Johannes Feldmeier and Nishad Maskara and Mikhail Lukin},

year  = {2024},

date = {2024-01-01},

abstract = {A key challenge of programmable quantum simulation is expanding the class of many-body Hamiltonians that can be realized on current devices. In particular, realizing complex many-body phenomena such as dynamical lattice gauge theories (LGTs) requires implementation of multi-body interactions that are typically not directly available in natural Hamiltonians. We introduce and analyze a novel Hamiltonian engineering technique based on time-dependent control. Our approach leverages controlled perturbations around periodic many-body trajectories as a resource for operator spreading, and uses these time-evolved operators as a basis to realize a broad class of complex multi-body interactions with tunable coefficients. We apply this framework to the neutral atom array platform, to engineer dynamics within the constrained "Rydberg-blockaded" subspace in two settings. First, we show how blockade-consistent exchange interactions on a one-dimensional chain can be engineered, enabling exploration of novel phases with emergent particle number conservation and interesting dynamics of multi-partite entanglement. Second, we demonstrate our ability to implement multi-body ring-exchange interactions in a two-dimensional setting, and present a realistic proposal for investigating unexplored regimes in non-equilibrium dynamics of 2D LGTs.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_397,

title = {Hamiltonians whose low-energy states require Ω(n) T gates},

author = {Nolan Coble and Matthew Coudron and Jon Nelson and Seyed Sajjad Nezhadi},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_447,

title = {Heisenberg-limited quantum algorithm for multiple observables estimation},

author = {Kaito Wada and Naoki Yamamoto and Nobuyuki Yoshioka},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_320,

title = {Heisenberg-Limited Sequential Quantum Metrology without Ancilla},

author = {Qiushi Liu and Yuxiang Yang},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_538,

title = {Hidden Non $n$-locality In Linear Networks},

author = {Kaushiki Mukherjee and Soma Mandal and Tapaswini Patro and Nirman Ganguly},

url = {https://doi.org/10.48550/arXiv.2303.08699},

year  = {2024},

date = {2024-01-01},

abstract = {We study hidden nonlocality in a linear network with independent sources. In the usual paradigm of Bell nonlocality, there are certain states which exhibit nonlocality only after the application of suitable local filtering operations, which, in turn, are some special stochastic local operations assisted with classical communication (SLOCC). In the present work, we introduce the notion of hidden non n-locality. The notion is detailed using a bilocal network. We provide instances of hidden nonbilocality and nontrilocality, where we notice quite intriguingly that nonbilocality is observed even when one of the sources distributes a mixed two-qubit separable state. Furthermore, a characterization of hidden nonbilocality is also provided in terms of the Bloch-Fano decomposition, wherein we conjecture that, to witness hidden nonbilocality, one of the two states (used by the sources) must have nonnull local Bloch vectors. Noise is inevitable in practical scenarios, which makes it imperative to study any possible method to enhance the possibility of detecting nonclassicality in the presence of noise in the network. We find that local filtering enhances the robustness to noise, which we demonstrate using bit-flip and amplitude-damping channels.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_420,

title = {Ideal random quantum circuits pass the LXEB test},

author = {Nicholas Hunter-Jones and Scott Aaronson and Jonas Haferkamp},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_396,

title = {Identification of quantum entanglement with supervised and unsupervised machine-learning models},

author = {Jaroslaw Pawlowski},

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

year  = {2024},

date = {2024-01-01},

abstract = {Quantum entanglement is a fundamental property commonly used in various quantum information protocols and algorithms. Nonetheless, the problem of identifying entanglement has still not reached a general solution for systems larger than 2x3. Modern deep learning (DL) architectures, that use multilayer neural networks (NNs), have enabled unprecedented achievements in various domains like computer vision or natural language processing. Convolutional neural networks (CNNs) with many hidden layers and complex network structures are extremely powerful in feature learning: they easily outperform classical algorithms in image classification, object detection, or face recognition tasks. In quantum physics, one natural application of DL involves the study of quantum many-body systems, where the extreme complexity of many-body states often makes theoretical analysis intractable. Nonetheless, employment of machine learning in physics for entangled state representations is typically focused on more traditional architectures such as Boltzmann machines or fully connected NNs. However, there are recent signals that deep CNNs can better represent highly entangled quantum systems. I will present our recent research on entanglement detection using modern deep neural network architectures (CNNs, Siamese networks, autoencoders), closer to the state-of-the-art approaches in DL, trained in a supervised and unsupervised manner and compare them in terms of their suitability for building robust entanglement detectors.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_399,

title = {Imposing Constraints on Driver Hamiltonians and Mixing Operators: From Theory to Practical Implementation},

author = {Hannes Leipold and Federico Spedalieri and Stuart Hadfield and Eleanor Rieffel},

year  = {2024},

date = {2024-01-01},

abstract = {Constructing Driver Hamiltonians and Mixing Operators such that they satisfy constraints is an important ansatz construction for many quantum algorithms. In this manuscript, we give general algebraic expressions for finding Hamiltonian terms and analogously unitary primitives, that satisfy constraint embeddings and use these to give complexity characterizations of the related problems. While finding operators with classical symmetries is proven to be NP-Complete in the general case, we also give an algorithmic procedure with worse-case polynomial runtime to find any operators with a constant locality bound; a useful result since many symmetries imposed admit local operators to enforce them in practice. We then give algorithmic procedures to turn these algebraic primitives into Hamiltonian drivers and unitary mixers that can be used for Constrained Quantum Annealing (CQA) and Quantum Alternating Operator Ansatz (QAOA) constructions by tackling practical problems related to finding an appropriate set of reduced generators and defining corresponding drivers and mixers accordingly. We then apply these concepts to the construction of ansaetze for 1-in-3 SAT instances. We consider the ordinary x-mixer QAOA, a novel QAOA approach based on the maximally disjoint subset, and a QAOA approach based on the disjoint subset as well as higher order constraint satisfaction terms. We empirically benchmark these approaches on instances sized between 12 and 22, showing the best relative performance for the tailored ansaetze and that exponential curve fits on the results are consistent with a quadratic speedup by utilizing alternative ansaetze to the x-mixer. We provide very general algorithmic prescriptions for finding driver or mixing terms that satisfy embedded constraints that can be utilized to probe quantum speedups for constraints problems with linear, quadratic, or even higher order polynomial constraints.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_519,

title = {Improved classical shadows from local symmetries in the Schur basis},

author = {Daniel Grier and Sihan Liu and Gaurav Mahajan},

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

year  = {2024},

date = {2024-01-01},

abstract = {We study the sample complexity of the classical shadows task: what is the fewest number of 

copies of an unknown state you need to measure to predict expected values with respect to some 

class of observables? Large joint measurements are likely required in order to minimize sample 

complexity, but previous joint measurement protocols only work when the unknown state is pure. 

We present the first joint measurement protocol for classical shadows whose sample complexity 

scales with the rank of the unknown state. In particular we prove O( sqrt(rB) / eps^2 ) samples suffice, 

where r is the rank of the state, B is a bound on the squared Frobenius norm of the observables, 

and eps is the target accuracy. In the low-rank regime, this is a nearly quadratic advantage over 

traditional approaches that use single-copy measurements. 

We present several intermediate results that may be of independent interest: a solution to 

a new formulation of classical shadows that captures functions of non-identical input states; a 

generalization of a “nice” Schur basis used for optimal qubit purification and quantum majority 

vote; and a measurement strategy that allows us to use local symmetries in the Schur basis to avoid intractable Weingarten calculations in the analysis.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_523,

title = {Improved Financial Forecasting via Quantum Machine Learning},

author = {André Juan Ferreira-Martins and Natansh Mathur and Skander Kazdaghli and Sohum Thakkar and Iordanis Kerenidis and Samuraí Brito},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}