Accepted posters

@Poster{P24_154,

title = {Quantum Contextuality and Quantum Nonlocality together},

author = {Tassius Temistocles and Gabriel Ruffolo and Rafael Rabelo and Marcelo Terra Cunha},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_126,

title = {Quantum Coordination Rates in Multi-Partite Networks},

author = {Hosen Nator and Uzi Pereg},

url = {https://arxiv.org/abs/2403.11893#:~:text=The%20optimal%20coordination%20rates%20are,quantum%20state%20among%20multiple%20parties. https://arxiv.org/abs/2404.18297#:~:text=Network%20coordination%20is%20considered%20in,quantum%20correlations%20among%20multiple%20parties.},

year  = {2024},

date = {2024-01-01},

abstract = {The optimal coordination rates are determined in three primary settings of multi-user quantum networks, thus characterizing the minimal resources required in order to simulate a joint quantum state among multiple parties. We study the following models: (1) a cascade network with rate-limited entanglement, (2) a broadcast network, which consists of a single sender and two receivers, (3) a multiple-access network with two senders and a single receiver. We establish the necessary and sufficient conditions on the asymptotically-achievable communication and entanglement rates in each setting. At last, we show the implications of our results on nonlocal games with quantum strategies.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_94,

title = {Quantum Eigensolver for General Matrices},

author = {Xiao-Ming Zhang and Yukun Zhang and Wenhao He and Xiao Yuan},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_173,

title = {Quantum energetic advantages for agents executing complex strategies online},

author = {Jayne Thompson and Paul Riechers and Andrew Garner and Thomas Elliott and Mile Gu},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_371,

title = {Quantum entanglement survival time and positive partial transpose time in the presence of Markovian noise: a statistical analysis},

author = {Nunzia Cerrato and Giacomo De Palma and Vittorio Giovannetti},

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

year  = {2024},

date = {2024-01-01},

abstract = {Adopting a statistical approach we study the degradation of entanglement of a quantum system under the action of an ensemble of randomly distributed Markovian noise. This enables us to address scenarios where only limited information is available on the mechanisms that rule the noisy evolution of the model. As an application, we characterize the statistic of entanglement deterioration for a quantum memory formed by n qudits that undergo randomly distributed local, uniform, Markovian noise evolution.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_34,

title = {Quantum error mitigation for Fourier moments computation},

author = {Oriel Kiss and Michele Grossi and Alessandro Roggero},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_264,

title = {Quantum Fourier Transform from Free-Evolution of an Oscillator},

author = {Yuan Liu and John M. Martyn and Jasmine Sinanan-Singh and Shraddha Singh and Steven M. Girvin and Isaac Chuang},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_279,

title = {Quantum Fourier Transform using Dynamic Circuits},

author = {Elisa Bäumer and Vinay Tripathi and Alireza Seif and Daniel Lidar and Derek Wang},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_42,

title = {Quantum Hypercontractive Inequalities and Their Applications in Common Randomness Generation},

author = {Zongbo Bao and Yangjing Dong and Fengning Ou and Penghui Yao},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_273,

title = {Quantum kernel machine learning with continuous variables},

author = {Laura Henderson and Rishi Goel and Sally Shrapnel},

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

year  = {2024},

date = {2024-01-01},

abstract = {The popular qubit framework has dominated recent work on quantum kernel machine learning, with results characterising expressivity, learnability and generalisation. As yet, there is no comparative framework to understand these concepts for continuous variable (CV) quantum computing platforms. In this paper we represent CV quantum kernels as closed form functions and use this representation to provide several important theoretical insights. We derive a general closed form solution for all CV quantum kernels and show every such kernel can be expressed as the product of Gaussian and algebraic function terms. Furthermore, we present quantification of a quantum-classical separation for all quantum kernels via a hierarchical notion of the ``stellar rank" of the quantum kernel feature map. For a particular subclass of CV kernels, we are able to directly extend this notion to the kernels themselves. In all such cases we can quantify the hardness of classical simulability of the quantum kernel. We then prove kernels defined by feature maps of infinite stellar rank, such as GKP-state encodings, can be approximated arbitrarily well by kernels defined by feature maps of finite stellar rank. Finally, we simulate learning with a single-mode displaced Fock state encoding and show that (i) accuracy on our specific task (an annular data set) increases with stellar rank, (ii) for underfit models, accuracy can be improved by increasing a bandwidth hyperparameter, and (iii) for noisy data that is overfit, decreasing the bandwidth will improve generalisation but does so at the cost of effective stellar rank and thus quantum advantage.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_168,

title = {Quantum key distribution with unbounded pulse correlations},

author = {Margarida Pereira and Guillermo Currás-Lorenzo and Akihiro Mizutani and Davide Rusca and Marcos Curty and Kiyoshi Tamaki},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_295,

title = {Quantum linear algebra is all you need for Transformer architectures},

author = {Naixu Guo and Zhan Yu and Aman Agrawal and Patrick Rebentrost},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_518,

title = {Quantum Machine Learning for Drowsiness Detection with Electroencephalogram Signals},

author = {Askery Canabarro and André Juan Ferreira Martins and Isis Didier and Rafael Chaves and Lavínia Araújo and Caio Maior and Plinio Ramos and Marcio Moura},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_98,

title = {Quantum memoization for a new recursive diagonalization quantum algorithm},

author = {Marek Gluza and Jeongrak Son and Ryuji Takagi and Nelly Ng},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_190,

title = {Quantum One-Wayness of the Single-Round Sponge with Invertible Permutations},

author = {Joseph Carolan and Alexander Poremba},

year  = {2024},

date = {2024-01-01},

keywords = {Outstanding Poster, Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_41,

title = {Quantum phase estimation by comprerssed sensing},

author = {Changhao Yi and Cunlu Zhou and Jun Takahashi},

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

year  = {2024},

date = {2024-01-01},

abstract = {As a signal recovery algorithm, compressed sensing is particularly useful when the data has low-complexity and samples are rare, which matches perfectly with the task of quantum phase estimation (QPE). In this work we present a new Heisenberg-limited QPE algorithm for early fault-tolerant quantum computers based on compressed sensing. More specifically, given many copies of a proper initial state and queries to a specific unitary matrix, our algorithm is able to recover the phase with a total runtime O(ϵ−1poly log(ϵ−1)), where ϵ is the desired accuracy. Moreover, the maximal runtime satisfies Tmaxϵ ≪ π, which is comparable to the state-of-the-art algorithms, and our algorithm is also robust against certain amount of noise from sampling and state preparation},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_140,

title = {Quantum Polynomial Hierarchies: Collapses, Karp-Lipton, and More},

author = {Avantika Agarwal and Sevag Gharibian and Sabee Grewal and Venkata Koppula and Dorian Rudolph and Justin Yirka},

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

year  = {2024},

date = {2024-01-01},

abstract = {The polynomial hierarchy (PH) has played a central role in complexity theory for the last 50 years. Given its significance, it is only natural to explore quantum generalizations, yet such generalizations remain embarrassingly not understood. 

This work studies several quantum generalizations of the quantifier-based definition of PH. The setup for these hierarchies is the same as for PH, except the verifier can perform quantum computations and the provers send different types of proofs (e.g., entangled quantum states, unentangled pure states). So, for example, QCPH is just like PH, except the verifier can perform quantum computation. 

We establish the following results: 

- (A collapse theorem for QCPH.) For any k ≥ 1, if the k-th levels of QCPH are equal, then QCPH collapses to its k-th level. 

- (Quantum-classical Karp-Lipton theorem.) If QCMA ⊆ BQP/mpoly, then QCPH collapses to its second level. That is, QCMA does not have poly-size quantum circuits unless QCPH collapses. 

- (QEPH collapses.) We introduce the entangled quantum polynomial hierarchy QEPH. We prove that QEPH collapses to its second level and equals QRG(1), the class of problems having one-turn quantum-refereed games. 

- (Error reduction for pureQPH and QEPH). We prove one-sided error reduction for pureQPH, which uses a new asymmetric version of the Harrow-Montanaro Product Test. We also show that error reduction is possible for QEPH. 

- (Relationship between hierarchies.) We prove that PH ⊆ QCPH ⊆ QPH ⊆ pureQPH ⊆ EXP^PP, and QEPH ⊆ QPH. Previously, it was not known if even PH ⊆ QPH, and the best upper bound on QPH was the exponential time hierarchy. - (Distribution hierarchies.) We introduce generalizations of PH and QCPH, where the provers send distributions over strings (instead of strings), we denote these by DistributionPH and DistributionQCPH. We prove that DistributionPH = PH and DistributionQCPH = QCPH by generalizing a game-theoretic result of Lipton and Young (1994).},

keywords = {Outstanding Poster, Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_365,

title = {Quantum Pseudorandomness Cannot Be Shrunk In a Black-Box Way},

author = {Samuel Bouaziz-Ermann and Garazi Muguruza},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_177,

title = {Quantum Rainbow Codes},

author = {Tom Scruby and Arthur Pesah and Mark Webster},

year  = {2024},

date = {2024-01-01},

abstract = {We present a novel class of quantum error correcting codes which we call quantum rainbow codes. The codes generalise quantum colour codes and quantum pin codes, and in particular improve on the latter construction by identifying and removing low-weight logical operators. In combination with the 3-dimensional hypergraph product we can use the rainbow codes construction to generate families of codes with non-constant k and d and transversally implementable non-Clifford gates. This is the first known product construction that simultaneously achieves these properties.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_152,

title = {Quantum Ripple-Carry Adders and Comparators},

author = {Maxime Remaud},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_388,

title = {Quantum secure non-malleable randomness encoder and its applications},

author = {Rishabh Batra and Naresh Goud Boddu and Rahul Jain},

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

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_449,

title = {Quantum Sieving for Code-Based Cryptanalysis},

author = {Lynn Engelberts and Johanna Loyer and Simona Etinski},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_427,

title = {Quantum Signal Processing with Errors},

author = {Dong An and Murphy Yuezhen Niu},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_258,

title = {Quantum Simulation of Lindbladian Dynamics via Repeated Interactions},

author = {Matthew Pocrnic and Dvira Segal and Nathan Wiebe},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_498,

title = {Quantum singular value transformation for an arbitrary bounded operator embedded in a unitary operator},

author = {Chusei Kiumi and Akito Suzuki and Yohei Tanaka},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_415,

title = {Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels},

author = {Touheed Anwar Atif and S. Sandeep Pradhan and Andreas Winter},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_507,

title = {Quantum state tomography of pure states with (almost) no regrets},

author = {Josep Lumbreras and Mikhail Terekhov and Marco Tomamichel},

year  = {2024},

date = {2024-01-01},

abstract = {We initiate the study of quantum state tomography with minimal regret. A learner has sequential oracle access to an unknown pure quantum state, and in each round selects a pure probe state. Regret is incurred if the unknown state is measured orthogonal to this probe, and the learner's goal is to minimise the expected cumulative regret over $T$ rounds. The challenge is to find the balance between most informative and measurements incurring minimal regret. We show that the cumulative regret scales as $Theta(polylog T)$ using a new sample-optimal tomography algorithm based on a median of means online least squares estimator.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_40,

title = {Quantum Unpredictability},

author = {Tomoyuki Morimae and Shogo Yamada and Takashi Yamakawa},

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

year  = {2024},

date = {2024-01-01},

abstract = {Unpredictable functions (UPFs) play essential roles in classical cryptography, including message authentication codes (MACs) and digital signatures. In this paper, we introduce a quantum analog of UPFs, which we call unpredictable state generators (UPSGs). UPSGs are implied by pseudorandom function-like states generators (PRFSs), which are a quantum analog of pseudorandom functions (PRFs), and therefore UPSGs could exist even if one-way functions do not exist,similar to other recently introduced primitives like pseudorandom state generators (PRSGs), one-way state generators (OWSGs), and EFIs. In classical cryptography, UPFs are equivalent to PRFs, but in the quantum case, the equivalence is not clear, and UPSGs could be weaker than PRFSs. Despite this, we demonstrate that all known applications of PRFSs are also achievable with UPSGs. They include IND-CPA-secure secret-key encryption and EUFCMA-secure MACs with unclonable tags. Our findings suggest that, for many applications, quantum unpredictability, rather than quantum pseudorandomness, is sufficient.},

keywords = {Outstanding Poster, Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_488,

title = {Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms},

author = {Teague Tomesh and Nicholas Allen and Daniel Dilley and Zain Saleem},

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

year  = {2024},

date = {2024-01-01},

abstract = {The computational capabilities of near-term quantum computers are limited by the noisy execution of gate operations and a limited number of physical qubits. Hybrid variational algorithms are well-suited to near-term quantum devices because they allow for a wide range of tradeoffs between the amount of quantum and classical resources used to solve a problem. This paper investigates tradeoffs available at both the algorithmic and hardware levels by studying a specific case – applying the Quantum Approximate Optimization Algorithm (QAOA) to instances of the Maximum Independent Set (MIS) problem. We consider three variants of the QAOA which offer different tradeoffs at the algorithmic level in terms of their required number of classical parameters, quantum gates, and iterations of classical optimization needed. Since MIS is a constrained combinatorial optimization problem, the QAOA must respect the problem constraints. This can be accomplished by using many multi-controlled gate operations which must be decomposed into gates executable by the target hardware. We study the tradeoffs available at this hardware level, combining the gate fidelities and decomposition efficiencies of different native gate sets into a single metric called the gate decomposition cost.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_421,

title = {Query Complexity in Limited Quantum Oracle Models},

author = {Mehil Agarwal and Shravas Rao and Fang Song},

year  = {2024},

date = {2024-01-01},

abstract = {We show that fractional block sensitivity characterizes the query complexity of total functions in two restricted quantum query models motivated by near-term quantum computers which are likely noisy and costly. One concerns a faulty oracle that applies identity with probability p; the other concerns a quantum-classical hybrid model where the number of quantum queries may be limited. Our lower bounds show that in many cases quantum speedup becomes unattainable in these restricted models, and as a special case recovers the existing results [RS08, Ros22] on unstructured search (i.e., computing OR function). On the other hand, we show that speedup is still possible by describing a faster quantum algorithm for AND-OR in the faulty oracle model. 

[RS08] Oded Regev and Liron Schiff. Impossibility of a quantum speed-up with a faulty or- 

acle. In Thirty-fifth International Colloquium on Automata, Languages, and Programming – 

ICALP 2008, pages 773–781. Springer, 2008. 

[Ros22] Ansis Rosmanis. Hybrid quantum-classical search algorithms. arXiv preprint arXiv:2202.11443, 2022. https://arxiv.org/abs/2202.11443},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_487,

title = {Qutrit-QAOA Approach for Graph 9-Coloring Optimization},

author = {Daniele Trisciani and Marco Cattaneo and Zoltan Zimboras},

year  = {2024},

date = {2024-01-01},

abstract = {Although theoretical and experimental research on quantum computers focuses mainly on qubit systems, research on higher-dimensional systems (qudits) on near-term quantum devices seems promising. Some problems are coded more efficiently in qudits systems. An example is the Graph n-Colouring problem, an NP-hard problem with practical applications, the goal is to use n colours to colour the nodes of a graph such that the nodes sharing an edge have different colours. It can be solved using the qubit-based QAOA (Quantum Approximate Optimization Algorithm). If the number of colours is not a power of 2, some states must be penalized introducing a penalty Hamiltonian and so increasing the depth circuit. In this work we explore the possibility of solving the Graph 9-Coloring problem running a noiseless simulation of a qutrit-based QAOA. The resources and the quality of the solutions are compared with the qubit-based QAOA ones. Preliminary results show that the qutrit-based QAOA circuit uses less resources, such as circuit depth and number of gates, than the qubit-based counterpart.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_511,

title = {Random Compilers for Hamiltonian Simulation via Markov Chain},

author = {Benoît Dubus and Jérémie Roland},

year  = {2024},

date = {2024-01-01},

abstract = {Many applications in quantum computing, quantum physics and quantum chemistry need to evaluate the evolution of a quantum system under a weighted sum of several Hamiltonians. Such evolution can be simulated on quantum computer by breaking down the unitary into a succession of unitary gates, typically evaluating each Hamiltonian during a small-time step according to a particular compilation scheme. In this context we can distinguish deterministic schemes and those relying on random processes that we will call random compilers. 

The best-known random compilers (such as the randomized nth order Trotter and qDrift [1, 2]) rely on an analysis based on the Trotter Formula and Suzuki-like integrators [3]. Theses mathematical tools are quite heavy and therefore hard to use practically. We develop a new mathematical approach to the same problem. The process is mainly viewed as a succession of gates representing the evolution of the system for small-time steps (either of fixed or random duration). We consider alternatively a continuous-time model, with a classical system controlling the quantum system. If the classical system is in a state i, then the corresponding Hamiltonian is applied onto the quantum system. Each transition from a state i onto a state j is governed by a Poisson process with a specific rate, and therefore the classical control is defined as a Markov chain. This helps us derive new differential equations on the evolution of the density matrix representing the average state over all realization of the whole system (the tensor product of the quantum and classical part) as a Lindbladian equation. 

These equations are simple and allow us to establish complexity (expressed in the number of gates) that are comparable to the state of the art [1, 2], while making less and arguably cleaner calculation. We derive a minimal number of gate for a sum of a given number of Hamiltonians of bounded magnitude during a certain time with a bounded error. 

This technique also has the advantage to explicitly include the classical control of the model, which could lead to further applications by considering more complicated schemes, for instance, considering that the transition rates can be time-depending and on the current state. 

Potential applications include the simulation and study of adiabatic quantum optimization (AQO) algorithms [4] and (randomized versions of) QAOA Algorithm [5]). This technique can be further extended to other schemes via the introduction of discrete CPPT transformation of the quantum state at each transition, or post-selection, and therefore it could lead to efficiently produce complexity results for more complex schemes. 

[1] Y. Ouyang, D. R. White, and E. T. Campbell, Compilation by stochastic hamiltonian sparsification, Quantum 4, 235 (2020). 

[2] E. Campbell, Random compiler for fast Hamiltonian simulation, Physical Review Letters 123, 10.1103/PhysRevLett.123.070503 (2019). 

[3] I. P. Omelyan, I. M. Mryglod, and R. Folk, Optimized Forest–Ruth- and Suzuki-like algorithms for integration of motion in many-body systems, Computer Physics Communications 146, 188 (2002). 

[4] E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Quantum Computation by Adiabatic Evolution (2000). [5] E. Farhi, J. Goldstone, and S. Gutmann, A Quantum Approximate Optimization Algorithm (2014).},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_391,

title = {Random Covariant Quantum Channels},

author = {Ion Nechita and Sang-Jun Park},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_501,

title = {Random Covariant Quantum Channels},

author = {Ion Nechita and Sang-Jun Park},

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

year  = {2024},

date = {2024-01-01},

abstract = {The group symmetries inherent in quantum channels often make them tractable and applicable to various problems in quantum information theory. In this work, we introduce natural probability distributions for covariant quantum channels. Specifically, this is achieved through the application of “twirling operations” on random quantum channels derived from the Stinespring representation that use Haar-distributed random isometries. We explore various types of group symmetries, including hyperoctahedral covariance and diagonal orthogonal covariance (DOC), and analyze their properties related to quantum entanglement based on the model parameters. In particular, we discuss the threshold phenomenon for positive partial transpose and entanglement breaking properties, comparing thresholds among different classes of random covariant channels. Finally, we contribute to the PPT-squared conjecture by showing that the composition between two random DOC channels is generically entanglement breaking.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_300,

title = {Random Natural Gradient},

author = {Ioannis Kolotouros and Petros Wallden},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_534,

title = {Randomized Benchmarking of Local Zeroth-Order Optimizers for Variational Quantum Systems},

author = {Lucas Tecot and Cho-Jui Hsieh},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_72,

title = {Randomized semi-quantum matrix processing},

author = {Allan Tosta and Thais Lima Silva and Giancarlo Camilo and Leandro Aolita},

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

year  = {2024},

date = {2024-01-01},

abstract = {Quantum computers have the potential to speed-up important matrix-arithmetic tasks. A prominent framework for that is the quantum singular-value transformation (QSVT) formalism, which uses Chebyshev approximations and coherent access to the input matrix via a unitary block encoding to design a target matrix function. Nonetheless, physical implementations for useful end-user applications require large-scale fault-tolerant quantum computers. Here, we present a hybrid quantum-classical framework for Monte-Carlo simulation of generic matrix functions more amenable to early fault-tolerant quantum hardware. Serving from the ideas of QSVT, we randomize over the Chebyshev polynomials while keeping the matrix oracle quantum. The method is assisted by a variant of the Hadamard test that removes the need for post-selection. As a result, it features a similar statistical overhead to the fully quantum case of standard QSVT and does not incur any circuit depth degradation. On the contrary, the average circuit depth is shown to get smaller, yielding equivalent reductions of noise sensitivity, as we explicitly show for depolarizing noise and coherent errors. We apply our technique to four specific use cases: partition-function estimation via quantum Markov-chain Monte Carlo and via imaginary-time evolution; end-to-end linear system solvers; and ground-state energy estimation. For these cases, we prove advantages on average depths, including quadratic speed-ups on costly parameters and even the removal of the approximation-error dependence. All in all, our framework provides a pathway towards early fault-tolerant quantum linear algebra applications.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_550,

title = {Recurrence in discrete-time stochastic quantum walks},

author = {İskender Yalçınkaya and Martin Stefanak and Václav Potoček and Aurél Gábris and Sonja Barkhofen and Christine Silberhorn and Igor Jex},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_566,

title = {Reducing Circuit Executions with Gradient-Sampling},

author = {Sayantan Pramanik and Chaitanya Murti and Chiranjib Bhattacharyya and M Girish Chandra},

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

year  = {2024},

date = {2024-01-01},

abstract = {A major drawback of the Parameter-Shift Rule coupled with Stochastic Gradient Descent (SGD) is its linear scaling in terms of the number of optimisable parameters K. In this abstract, we propose a new optimisation algorithm that requires at most two evaluations of the variational circuit per iteration, and a K-fold reduction in the number of circuit executions to converge, compared to SGD and Random Coordinate Descent (RCD). We also demonstrate the effectiveness of the proposed algorithm against SGD, RCD, and Simultaneous Perturbation Stochastic Approximation through binary classification experiments using circuit-centric classifiers with 300 parameters. Results show that our algorithm converges with over 300 times fewer circuit executions than SGD and RCD.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_83,

title = {Relaxations and Exact Solutions to Quantum Max Cut via the Algebraic Structure of Swap Operators},

author = {Adam Bene Watts and Anirban Chowdhury and Igor Klep and J. William Helton and Aidan Epperly},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_543,

title = {Resonant Tunneling Effects in Quantum Communication},

author = {Giuseppe Catalano and Farzad Kianvash and Vittorio Giovannetti},

year  = {2024},

date = {2024-01-01},

abstract = {Quantum communication leverages quantum principles to securely transmit information through specialized protocols designed to mitigate noise effects described by quantum channels. Resonant tunneling, a quantum phenomenon where particles traverse potential barriers with enhanced efficiency under specific conditions, provides insights into causal order dynamics. Recent research explores the concept of indefinite causal order (ICO) enabling communication tasks beyond standard quantum theory frameworks. Investigating resonant tunneling's connection to ICO is crucial for advancing quantum mechanics understanding and practical applications in communication and computation. This study explores spin-orbital coupling within potential barriers to analyze quantum communication scenarios, incorporating loss effects and assessing communication performance. Through channel concatenation and wave packet analysis, insights are gained into communication quality under noise effects, paving the way for advancements in quantum technologies.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_148,

title = {Retrieving non-linear features from noisy quantum states},

author = {Benchi Zhao and Mingrui Jing and Lei Zhang and Xuanqiang Zhao and Kun Wang and Yu-Ao Chen and Xin Wang},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_287,

title = {Reversible Entanglement Beyond Quantum Operations},

author = {Xin Wang and Yu-Ao Chen and Lei Zhang and Chenghong Zhu},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_463,

title = {Robust and composable device-independent quantum protocols for oblivious transfer and bit commitment},

author = {Rishabh Batra and Sayantan Chakraborty and Rahul Jain and Upendra Kapshikar},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_277,

title = {Robust and Efficient Quantum Property Learning with Shallow Shadows},

author = {Hong-Ye Hu and Andi Gu and Swarnadeep Majumder and Hang Ren and Yipei Zhang and Derek Wang and Yi-Zhuang You and Zlatko Minev and Susanne Yelin and Alireza Seif},

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

year  = {2024},

date = {2024-01-01},

abstract = {Extracting information efficiently from quantum systems is a major component of quantum information processing tasks. Randomized measurements, or classical shadows, enable predicting many properties of arbitrary quantum states using few measurements. While random single qubit measurements are experimentally friendly and suitable for learning low-weight Pauli observables, they perform poorly for nonlocal observables. Prepending a shallow random quantum circuit before measurements maintains this experimental friendliness, but also has favorable sample complexities for observables beyond low-weight Paulis, including high-weight Paulis and global low-rank properties such as fidelity. However, in realistic scenarios, quantum noise accumulated with each additional layer of the shallow circuit biases the results. To address these challenges, we propose the robust shallow shadows protocol. Our protocol uses Bayesian inference to learn the experimentally relevant noise model and mitigate it in postprocessing. This mitigation introduces a bias-variance trade-off: correcting for noise-induced bias comes at the cost of a larger estimator variance. Despite this increased variance, as we demonstrate on a superconducting quantum processor, our protocol correctly recovers state properties such as expectation values, fidelity, and entanglement entropy, while maintaining a lower sample complexity compared to the random single qubit measurement scheme. We also theoretically analyze the effects of noise on sample complexity and show how the optimal choice of the shallow shadow depth varies with noise strength. This combined theoretical and experimental analysis positions the robust shallow shadow protocol as a scalable, robust, and sample-efficient protocol for characterizing quantum states on current quantum computing platforms.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_221,

title = {Sampling (noisy) quantum circuits through randomized rounding},

author = {Victor Martinez and Omar Fawzi and Daniel Stilck-França},

year  = {2024},

date = {2024-01-01},

abstract = {Sampling from the output of quantum circuits is known to be a hard task for a classical computer in general. This hardness even holds for shallow circuits, for which computing local expectation values can be done efficiently by a light cone argument. For many optimization problems, local expectation values are sufficient to determine the expectation cost function. However, obtaining an actual solution to the problem (e.g., a coloring) is the main goal of combinatorial optimization. The objective of this work is to introduce an end-to-end framework to approximate the output of quantum algorithms for combinatorial optimization problems using available quantum (noisy) and classical resources. Our work proposes a novel approach for sampling from quantum circuits made for combinatorial optimization and provides a pathway for using expectation values to obtain samples from quantum circuits through randomized rounding. Our method is simple and performs well under noisy conditions, as we are able to sample from the noisy quantum circuit at fixed depth for certain optimization problems. We also do not require the depth or noise to be greater than a specific threshold, making it a versatile and robust approach for various scenarios. We also provide an efficient classical algorithm to compute expectation values of local observables under non-unital noise, extending previous works to more general noise models. Combined with our sampling algorithm this offers us a powerful end-to-end method for sampling from noisy quantum circuits.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_564,

title = {Search for the order of Pauli operators that reduces the Trotter error},

author = {Boris Arseniev},

year  = {2024},

date = {2024-01-01},

abstract = {One of the simplest and most universal methods for implementing the evolution of the Hamiltonian on a quantum computer is the decomposition of the Hamiltonian into Pauli strings (tensor product of Pauli matrices) followed by the application of the Trotter formula. The scaling of error that occurs with this approach has been well studied. It is known that it depends on the commutators between the operators present in the decomposition of the Hamiltonian. It should be noted that this formula provides scaling, but it remains unclear exactly what order of operators minimizes the error. In practical implementations where there are restrictions on circuit length, it is important to minimize the Trotter power required to achieve the required accuracy. In this study, two approaches to determining the optimal order of operators were considered. The first approach is a heuristic method that does not require calculating the exponent, and the second method is based on the use of the annealing method. Both showed a decrease in the Trotter error, while the heuristic method showed particularly high efficiency with a small number of Pauli operators in the decomposition. By using the methods presented here, one can determine an order of operators that helps reduce the error that occurs when using Trotter’s formula.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_162,

title = {Security of hybrid BB84 with heterodyne detection},

author = {Jasminder Sidhu and Rocco Maggi and Saverio Pascazio and Cosmo Lupo},

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

year  = {2024},

date = {2024-01-01},

abstract = {Quantum key distribution (QKD) promises everlasting security based on the laws of physics. Most common protocols are grouped into two distinct categories based on the degrees of freedom used to carry information, which can be either discrete or continuous, each presenting unique advantages in either performance, feasibility for near-term implementation, and compatibility with existing telecommunications architectures. Recently, hybrid QKD protocols have been introduced to leverage advantages from both categories. In this work we provide a rigorous security proof for a protocol introduced by Qi in 2021, where information is encoded in discrete variables as in the widespread Bennett Brassard 1984 (BB84) protocol but decoded continuously via heterodyne detection. Security proofs for hybrid protocols inherit the same challenges associated with continuous-variable protocols due to unbounded dimensions. Here we successfully address these challenges by exploiting symmetry. Our approach enables truncation of the Hilbert space with precise control of the approximation errors and lead to a tight, semi-analytical expression for the asymptotic key rate under collective attacks. As concrete examples, we apply our theory to compute the key rates under passive attacks, linear loss, and Gaussian noise.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_14,

title = {Self-testing with dishonest parties and device-independent entanglement certification in quantum communication networks},

author = {Glaucia Murta and Flavio Baccari},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_313,

title = {Separation between Entanglement Criteria and Entanglement Detection Protocols},

author = {Zhenhuan Liu and Fuchuan Wei},

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

year  = {2024},

date = {2024-01-01},

abstract = {Entanglement detection is one of the most fundamental tasks in quantum information science, and as quantum devices advance, researchers work to develop effective and efficient detection methods. 

Over time, researchers have recognized the inherent limitations in entanglement detection. 

Notably, a trade-off between detection power and the number of observables has been established for entanglement criteria. 

Yet, our understanding of the complexities of practical entanglement detection protocols (EDPs) and their relationship with entanglement criteria (EC) remains limited. 

In this study, we bridge this knowledge gap by providing a precise definition and introducing postulates for EDP. 

Building on this definition, we demonstrate an exponential separation between the sample complexity of EDP and the number of observables for EC through a typical bipartite entanglement detection task. 

Furthermore, we discover that the optimal EDP with the lowest sample complexity does not necessarily correspond to the optimal EC with the fewest observables. 

Our findings can be extended to multipartite scenarios and can be used to prove the exponential speedups achieved through quantum memory. By highlighting the significance and independence of EDP design, our work holds substantial practical implications for entanglement detection experiments.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_77,

title = {Shaded lightcones for classically accelerated quantum error mitigation},

author = {Andrew Eddins and Minh Tran and Patrick Rall},

url = {http://patrickrall.com/#not_available_online},

year  = {2024},

date = {2024-01-01},

abstract = {Abstract Noisy quantum computers introduce bias to the measured expectation values. Quantum error mitigation recovers the correct values by generally trading off the bias for an increase in the statistical variance of the measurement. Among error mitigation approaches, Probabilistic Error Cancellation (PEC) stands out as a method capable of eliminating all potential bias due to gate errors, in exchange for an exponentially large variance of the estimator. This variance can be significantly reduced by not mitigating errors lying outside the causal lightcone of the desired observable. The causal lightcone, however, can grossly overestimate the support of a spreading operator. Here, we improve the lightcone approach by assigning upper bounds that limit how much each error channel in the circuit can bias the expectation value. This set of bounds, which we refer to as a "shaded lightcone," enables a targeted application of PEC, improving the tradespace of bias and variance. We present an efficient algorithm that leverages the locality of errors to compute the bounds, providing a practical benefit even with modest classical resources. As an example, demonstrate the algorithm to the error mitigation of a 127-qubit Trotter circuit, reducing the sampling overhead by several orders of magnitude compared to PEC based on the causal lightcone.},

keywords = {Outstanding Poster, Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_271,

title = {Shadow simulation of quantum processes},

author = {Xuanqiang Zhao and Xin Wang and Giulio Chiribella},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_201,

title = {Signatures From Pseudorandom States via bot-PRFs},

author = {Mohammed Barhoush and Amit Behera and Lior Ozer and Louis Salvail and Or Sattath},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_462,

title = {Simulating Noisy Variational Quantum Algorithms: A Polynomial Approach},

author = {Yuguo Shao and Fuchuan Wei and Song Cheng and Zhengwei Liu},

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

year  = {2024},

date = {2024-01-01},

abstract = {Large-scale variational quantum algorithms are widely recognized as a potential pathway to achieve practical quantum advantages. However, the presence of quantum noise might suppress and undermine these advantages, which blurs the boundaries of classical simulability. To gain further clarity on this matter, we present a novel polynomial-scale method based on the path integral of observable's back-propagation on Pauli paths (OBPPP). This method efficiently approximates quantum mean values in variational quantum algorithms with bounded truncation error in the presence of independent single-qubit depolarizing noise. Theoretically, we rigorously prove: 1) For a fixed noise rate λ, OBPPP's time and space complexity exhibit a polynomial relationship with the number of qubits $n$, the circuit depth $L$, the inverse truncation error $frac1ε$, and the root square inverse success probability $frac1sqrtdelta$. 2) For variable λ, the computational complexity becomes $mathrmPolyłeft(n,Lright)$ when λ exceeds $frac1łogL$ and it becomes exponential with $L$ when λ falls below $frac1L$. Numerically, we conduct classical simulations of IBM's zero-noise extrapolated experimental results on the 127-qubit Eagle processor [Nature textbf618, 500 (2023)]. Our method attains higher accuracy and faster runtime compared to the quantum device. Moreover, this approach enables us to deduce noisy outcomes from noiseless results, allowing us to accurately reproduce IBM's unmitigated results that directly correspond to raw experimental observations.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_266,

title = {Simulating non-physical actions via exponentiation of Hermitian-preserving maps},

author = {Fuchuan Wei and Zhenhuan Liu and Guoding Liu and Zizhao Han and Dong-Ling Deng and Zhengwei Liu},

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

year  = {2024},

date = {2024-01-01},

abstract = {Legitimate quantum operations must adhere to principles of quantum mechanics, particularly the requirements of complete positivity and trace preservation. Yet, non-physical maps, especially Hermitian-preserving maps, play a crucial role in quantum information science. Here, we introduce the Hermitian-preserving map exponentiation algorithm, which can effectively simulate the action of an arbitrary Hermitian-preserving map by exponentiating its output, $mŅ(rho)$, into a quantum process, $e^-imŅ(rho)t$. We analyze the sample complexity of this algorithm and prove its optimality in certain cases. Utilizing positive but not completely positive maps, this algorithm provides exponential speedups in entanglement detection and quantification compared to protocols based on single-copy operations. In addition, it facilitates the recovery of noiseless quantum states from multiple copies of noisy ones by simulating the inverse map of the corresponding noise channel, providing a new approach to handling quantum noises. This algorithm acts as a building block of large-scale quantum algorithms and presents a pathway for exploring potential quantum speedups across a wide range of information-processing tasks.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_458,

title = {Single Boson Boson Sampling Characterises Quantum Logspace},

author = {Quinten Tupker},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_13,

title = {Space-bounded quantum state testing via space-efficient quantum singular value transformation},

author = {François Le Gall and Yupan Liu and Qisheng Wang},

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

year  = {2024},

date = {2024-01-01},

abstract = {This paper presents a new complete characterization of space-bounded quantum computation, focusing on problems with one-sided error (unitary coRQL) and two-sided error (BQL) from a quantum state testing perspective. These promise problems tell whether efficiently preparable states in logarithmic qubits are far from each other concerning trace distance, quantum entropy difference, and Hilbert-Schmidt distance. Unlike the time-bounded state testing problems, we show that all space-bounded state testing problems correspond to the same class. Additionally, our algorithms on the trace distance inspire an algorithmic Holevo-Helstrom measurement, implying QSZK is in QIP(2) with a quantum linear-space honest prover. Our primary technique is a space-efficient variant of the quantum singular value transformation (QSVT), which gives a unified approach to designing space-bounded quantum algorithms.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_166,

title = {SPOQC: a Spin-Optical Quantum Computing Architecture},

author = {Grégoire Gliniasty and Paul Hilaire and Pierre-Emmanuel Emeriau and Stephen Wein and Alexia Salavrakos and Shane Mansfield},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_323,

title = {Stability of classical shadows under gate-dependent noise},

author = {Raphael Brieger and Markus Heinrich and Ingo Roth and Martin Kliesch},

year  = {2024},

date = {2024-01-01},

keywords = {Outstanding Poster, Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_112,

title = {Stabilization of symmetry-protected long-range entanglement in stochastic quantum circuits},

author = {Iosifina Angelidi and Marcin Szyniszewski and Arijeet Pal},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_38,

title = {Stabilizer Codes with Exotic Local-dimensions},

author = {Lane Gunderman},

url = {https://quantum-journal.org/papers/q-2024-02-12-1249/},

year  = {2024},

date = {2024-01-01},

abstract = {Traditional stabilizer codes operate over prime power local-dimensions. In this work we extend the stabilizer formalism using the local-dimension-invariant setting to import stabilizer codes from these standard local-dimensions to other cases. In particular, we show that any traditional stabilizer code can be used for analog continuous-variable codes, and consider restrictions in phase space and discretized phase space. This puts this framework on an equivalent footing as traditional stabilizer codes. Following this, using extensions of prior ideas, we show that a stabilizer code originally designed with a finite field local-dimension can be transformed into a code with the same n, k, and d parameters for any integral domain. This is of theoretical interest and can be of use for systems whose local-dimension is better described by mathematical rings, which permits the use of traditional stabilizer codes for protecting their information as well.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_195,

title = {Stabilizer Tensor Networks: universal quantum simulator on a basis of stabilizer states},

author = {Sergi Masot Llima and Artur Garcia Saez},

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

year  = {2024},

date = {2024-01-01},

abstract = {Efficient simulation of quantum computers relies on understanding and exploiting the properties of quantum states. This is the case for methods such as tensor networks, based on entanglement, and the tableau formalism, which represents stabilizer states. In this work, we integrate these two approaches to present a generalization of the tableau formalism used for Clifford circuit simulation. We explicitly prove how to update our formalism with Clifford gates, non-Clifford gates, and measurements, enabling universal circuit simulation. We also discuss how the framework allows for efficient simulation of more states, raising some interesting questions on the representation power of tensor networks and the quantum properties of resources such as entanglement and magic, and support our claims with simulations.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_225,

title = {Statistical Complexity of Quantum Learning},

author = {Leonardo Banchi and Jason Pereira and Sharu Jose and Osvaldo Simeone},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_302,

title = {Statistical Estimation in the Spiked Tensor Model via the Quantum Approximate Optimization Algorithm},

author = {Leo Zhou and Joao Basso and Song Mei},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_553,

title = {Statistical phase estimation and error mitigation on a superconducting quantum processor},

author = {Nick Blunt and Laura Caune and Róbert Izsák and Earl Campbell and Nicole Holzmann},

url = {https://journals.aps.org/prxquantum/abstract/10.1103/PRXQuantum.4.040341},

year  = {2024},

date = {2024-01-01},

abstract = {Quantum phase estimation (QPE) is a key quantum algorithm, which has been widely studied as a method to perform chemistry and solid-state calculations on future fault-tolerant quantum computers. Recently, several authors have proposed statistical alternatives to QPE that have benefits on early fault-tolerant devices, including shorter circuits and better suitability for error-mitigation techniques. Here, we will describe an implementation of statistical phase estimation on Rigetti’s superconducting processors. Specifically, we use a modification of the Lin and Tong [PRX Quantum 3, 010318 (2022)] algorithm with the improved Fourier approximation of Wan et al. [Phys. Rev. Lett. 129, 030503 (2022)]. We then incorporate error mitigation strategies including zero-noise extrapolation. We discuss a new method to estimate energies from statistical phase estimation data, which is found to improve the accuracy in the final energy estimates by 1–2 orders of magnitude, compared to previous approaches based on eigenvalue thresholding. We apply these methods to chemistry problems for active spaces up to four electrons in four orbitals, and correctly estimate energies within chemical precision. We also find that statistical phase estimation has a natural resilience to noise, particularly after mitigating coherent errors, and can achieve far higher accuracy than suggested by previous analysis. We will discuss the implication of these results for applications of statistical QPE in the early fault-tolerant era.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_384,

title = {Stochastic Quantum Sampling for Non-Logconcave Distributions and Estimating Partition Functions},

author = {Guneykan Ozgul and Xiantao Li and Mehrdad Mahdavi and Chunhao Wang},

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

year  = {2024},

date = {2024-01-01},

abstract = {We present quantum algorithms for sampling from non-logconcave probability distributions in the form of π(x)∝exp(−βf(x)). Here, f can be written as a finite sum f(x):=1N∑Nk=1fk(x). Our approach is based on quantum simulated annealing on slowly varying Markov chains derived from unadjusted Langevin algorithms, removing the necessity for function evaluations which can be computationally expensive for large data sets in mixture modeling and multi-stable systems. We also incorporate a stochastic gradient oracle that implements the quantum walk operators inexactly by only using mini-batch gradients. As a result, our stochastic gradient based algorithm only accesses small subsets of data points in implementing the quantum walk. One challenge of quantizing the resulting Markov chains is that they do not satisfy the detailed balance condition in general. Consequently, the mixing time of the algorithm cannot be expressed in terms of the spectral gap of the transition density, making the quantum algorithms nontrivial to analyze. To overcome these challenges, we first build a hypothetical Markov chain that is reversible, and also converges to the target distribution. Then, we quantified the distance between our algorithm's output and the target distribution by using this hypothetical chain as a bridge to establish the total complexity. Our quantum algorithms exhibit polynomial speedups in terms of both dimension and precision dependencies when compared to the best-known classical algorithms.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_17,

title = {Sub-universal variational circuits for combinatorial optimization problems},

author = {Gal Weitz and Lirandë Pira and Chris Ferrie and Joshua Combes},

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

year  = {2024},

date = {2024-01-01},

abstract = {Quantum variational circuits have gained significant attention due to their applications in the quantum approximate optimization algorithm and quantum machine learning research. This work introduces a novel class of classical probabilistic circuits designed for generating approximate solutions to combinatorial optimization problems constructed using two-bit stochastic matrices. Through a numerical study, we investigate the performance of our proposed variational circuits in solving the Max-Cut problem on various graphs of increasing sizes. Our classical algorithm demonstrates improved performance for several graph types to the quantum approximate optimization algorithm. Our findings suggest that evaluating the performance of quantum variational circuits against variational circuits with sub-universal gate sets is a valuable benchmark for identifying areas where quantum variational circuits can excel.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_395,

title = {Succinct Fermion Data Structures},

author = {Joseph Carolan and Luke Schaeffer},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_107,

title = {Superposed Quantum Error Mitigation},

author = {Jorge Miguel-Ramiro and Zheng Shi and Luca Dellantonio and Albie Chan and Christine A. Muschik and Wolfgang Dür},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_296,

title = {Surface Code Communication with Quantum Multiplexing},

author = {Shin Nishio and Thomas Scruby and Nicolò Lo Piparo and William Munro and Kae Nemoto},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_541,

title = {Symmetric and asymmetric strategies for Bell-inequality violation},

author = {Hsin-Yu Hsu and Gelo Noel Tabia and Bo-An Tasi and Kai-Siang Chen and Yeong-Cherng Liang},

year  = {2024},

date = {2024-01-01},

abstract = {Symmetry plays an important role in physics. To this end, one may wonder when the maximal quantum violation of a Bell inequality is necessarily achieved by a symmetrical strategy. In general, for a Bell inequality lacking such a symmetry, there may be a gap between the maximal Bell inequality violation achievable with and without assuming such a symmetry for the underlying strategy. Even for a Bell inequality that has a certain symmetry, there is no guarantee that its maximal quantum violation can be achieved by employing a symmetrical strategy that is also minimal in dimension. Here, we consider some simple Bell inequalities and find that their maximal quantum violation is indeed attainable using a symmetrical strategy with minimal Hilbert space dimension},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_43,

title = {Symmetry-invariant quantum machine learning force fields},

author = {Isabel Nha Minh Le and Oriel Kiss and Julian Schuhmacher and Ivano Tavernelli and Francesco Tacchino},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_452,

title = {Symmetry-restricted quantum circuits are still well-behaved},

author = {Maximilian Balthasar Mansky and Miguel Armayor Martinez and Alejandro Bravo Serna and Santiago Londoño Castillo and Gautham Sathish and Zhihao Wang and Claudia Linnhof-Popien},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_118,

title = {Tangling schedules eases hardware connectivity requirements for quantum error correction},

author = {Gyorgy Geher and Ophelia Crawford and Earl Campbell},

url = {https://journals.aps.org/prxquantum/abstract/10.1103/PRXQuantum.5.010348},

year  = {2024},

date = {2024-01-01},

abstract = {Error corrected quantum computers have the potential to change the way we solve computational problems. Quantum error correction involves repeated rounds of carefully scheduled gates to measure the stabilizers of a code. A set of scheduling rules is typically imposed on the order of gates to ensure that the circuit can be rearranged into an equivalent circuit that can be easily seen to measure the stabilizers. In this work, we ask what would happen if we break these rules and instead use circuit schedules that we describe as tangled. We find that tangling schedules generates long-range entanglement not accessible using nearest-neighbor two-qubit gates. Our tangled-schedule method provides a new tool for building quantum error-correction circuits and we explore applications to design new architectures for fault-tolerant quantum computers. Notably, we show that, for the widely used Pauli-based model of computation (achieved by lattice surgery), this access to longer-range entanglement can reduce the device connectivity requirements, without compromising on circuit depth.},

keywords = {Outstanding Poster, Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_428,

title = {Tapered Quantum Phase Estimation},

author = {Dhrumil Patel and Shi Jie Samuel Tan and Yigit Subasi and Andrew Sornborger},

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

year  = {2024},

date = {2024-01-01},

abstract = {Quantum phase estimation is one of the fundamental primitives that underpins many quantum algorithms, including quantum amplitude estimation, the HHL algorithm for solving linear systems of equations, and quantum principal component analysis. Due to its significance as a subroutine, in this work, we study the coherent version of the phase estimation problem, where given an arbitrary input state and black-box access to unitaries U and controlled-U, the goal is to estimate the phases of U in superposition. Unlike most existing phase estimation algorithms, which employ intermediary measurements steps that inevitably destroy coherence, only a couple of algorithms, including the well-known standard quantum phase estimation algorithm, consider this coherent setting. In this work, we propose an improved version of this standard algorithm that utilizes tapering/window functions. Our algorithm, which we call tapered quantum phase estimation algorithm, achieves the optimal query complexity (total number of calls to U and controlled-U) without requiring the use of a computationally expensive quantum sorting network for median computation, which the standard algorithm uses to boost the success probability arbitrarily close to one. We also show that the tapering functions that we use are optimal by formulating optimization problems with different optimization criteria. Beyond the asymptotic regime, we also provide non-asymptotic query complexity of our algorithm, as it is crucial for practical implementation. Finally, we also propose an efficient algorithm that prepares the quantum state corresponding to the optimal tapering function.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_262,

title = {Test of the physical significance of Bell nonlocality},

author = {Carlos Vieira and Ravishankar Ramanathan and Adán Cabello},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_335,

title = {Testing and tomography of free-fermionic quantum states},

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

year  = {2024},

date = {2024-01-01},

abstract = {Testing whether a quantum state is far from a classically efficiently tractable set of states is a fundamental 

task in quantum information. A physically relevant instance of such a set of states is given by free-fermionic 

states, also known as fermionic Gaussian states or states prepared by matchgate circuits. In this study, we 

analyze property testing of free-fermionic states, specifically the task of determining, through measurements, 

whether an unknown state is close to or far from the set of free-fermionic states. We first show that any 

algorithm capable of testing possibly mixed free-fermionic states would inevitably be inefficient. However, 

we then turn to presenting an efficient algorithm to test low-rank free-fermionic states. We prove improved 

bounds on the sample complexity for tomography of pure free-fermionic states, and we also generalize the 

algorithm to the mixed-scenario and discuss its noise-robustness. The workhorse of our results is provided 

by new insights into fermionic Gaussian states: Specifically, we show bounds on the minimum trace distance 

between a state and the set of free-fermionic states, which also serve as efficiently computable measures of 

‘non-Gaussianity’ for the state. Furthermore, we derive useful bounds on the trace distance between two possibly mixed free-fermionic states in terms of the norm difference of their correlation matrices},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_432,

title = {The Complexity of Determining Whether Finite Sized Systems Thermalize},

author = {Dhruv Devulapalli and Timothy Connor Mooney and James Watson},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_267,

title = {The Complexity of the Local Hamiltonian Problem on Restricted Geometries},

author = {Gabriel Waite},

year  = {2024},

date = {2024-01-01},

abstract = {The local Hamiltonian problem is a promise problem relating to the low–energy values of a Hamiltonian. It is well known that the local Hamiltonian problem is QMA–complete, even on a square lattice. This work shows the problem's complexity remains robust across a range of geometric configurations. We also show the Fermi–Hubbard model is QMA–complete on a triangular lattice and in StoqMA on a bipartite lattice. Applying these new results we are able to advance the study of the guided local Hamiltonian problem. Specifically, we strengthen certain findings to the triangular lattice. By combining concepts from multiple studies, we also establish that the Fermi–Hubbard model is BQP–hard for the guided local Hamiltonian problem.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_147,

title = {The discrete adiabatic quantum linear system solver has lower constant factors than the randomized adiabatic solver},

author = {Pedro Costa and Dong An and Ryan Babbush and Dominic Berry},

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

year  = {2024},

date = {2024-01-01},

abstract = {he solution of linear systems of equations is the basis of many other quantum algorithms, and recent results provided an algorithm with optimal scaling in both the condition number κ and the allowable error ϵ [PRX Quantum 3, 0403003 (2022)]. That work was based on the discrete adiabatic theorem, and worked out an explicit constant factor for an upper bound on the complexity. Here we show via numerical testing on random matrices that the constant factor is in practice about 1,500 times smaller than the upper bound found numerically in the previous results. That means that this approach is far more efficient than might naively be expected from the upper bound. In particular, it is over an order of magnitude more efficient than using a randomised approach from [arXiv:2305.11352] that claimed to be more efficient.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_265,

title = {The Dynamical Resource Theory of Informational Non-Equilibrium Preservability},

author = {Benjamin Stratton and Chung-Yun Hsieh and Paul Skrzypczyk},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_89,

title = {The genuinely multipartite nonlocality of graph states is model-dependent},

author = {Xavier Coiteux-Roy and Owidiusz Makuta and Fionnuala Curran and Remigiusz Augusiak and Marc-Olivier Renou},

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

year  = {2024},

date = {2024-01-01},

abstract = {Bell's theorem proves that some quantum state correlations can only be explained by bipartite non-classical resources. The notion of genuinely multipartite nonlocality (GMNL) was later introduced to conceptualize the fact that nonclassical resources involving more than two parties in a nontrivial way may be needed to account for some quantum correlations. In this letter, we first recall the contradictions inherent to the historical definition of GMNL. Second, we turn to one of its redefinitions, called Local-Operations-and-Shared-Randomness GMNL (LOSR-GMNL), proving that all caterpillar graph states (including cluster states) have this second property. Finally, we conceptualize a third, alternative definition, which we call Local-Operations-and-Neighbour-Communication GMNL (LONC-GMNL), that is adapted to situations in which short-range communication between some parties might occur. We show that cluster states do not have this third property, while GHZ states do. Beyond its technical content, our letter illustrates that rigorous conceptual work is needed before applying the concepts of genuinely multipartite nonlocality, genuine multipartite entanglement or entanglement depth to benchmark the nonclassicality of some experimentally-produced quantum system. We note that most experimental works still use witnesses based on the historical definitions of these notions, which fail to reject models based on bipartite resources.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_202,

title = {The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels},

author = {Alessandro Falco and Giacomo De Palma},

year  = {2024},

date = {2024-01-01},

abstract = {We prove the multimode conditional quantum Entropy Power Inequality for bosonic quantum systems. This inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes among all the input states of the modes with given conditional entropies. Bosonic quantum systems constitute the mathematical model for the electromagnetic radia- tion in the quantum regime, which provides the most promising platform for quantum communication and quantum key distribution. We apply our multimode conditional Entropy Power Inequality to determine new lower bounds to the squashed entanglement of a large family of bosonic quantum Gaussian states. The squashed entanglement is one of the main entanglement measures in quantum communication theory, providing the best known upper bound to the distillable key. Exploiting this result, we determine a new lower bound to the squashed entanglement of the multimode bosonic Gaussian channels that are extreme, i.e., that cannot be decomposed as a non-trivial convex combination of quantum channels. The squashed entanglement of a quantum channel provides an upper bound to its secret-key capacity, i.e., the capacity to generate a secret key shared between the sender and the receiver.},

keywords = {Outstanding Poster, Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_345,

title = {The power and limitations of learning quantum dynamics incoherently},

author = {Sofiene Jerbi and Joe Gibbs and Manuel Rudolph and Matthias Caro and Patrick Coles and Hsin-Yuan Huang and Zoe Holmes},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_490,

title = {The power of shallow-depth Toffoli and qudit quantum circuits},

author = {Alex Bredariol Grilo and Elham Kashefi and Damian Markham and Michael Oliveira},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_93,

title = {The status of the quantum PCP conjecture (games version)},

author = {Anand Natarajan and Chinmay Nirkhe},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_16,

title = {The Unruh-DeWitt model and its joint interacting Hilbert space},

author = {Erickson Tjoa and Finnian Gray},

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

year  = {2024},

date = {2024-01-01},

abstract = {In this work we make the connection between the Unruh-DeWitt particle detector model applied to quantum field theory in curved spacetimes and the rigorous construction of the spin-boson model. With some modifications, we show that existing results about the existence of a spin-boson ground state can be adapted to the Unruh-DeWitt model. In the physically relevant setting involving massless fields in $(3+1)$-dimensional spacetimes, we argue that common choices of the spacetime smearing functions regulate the ultraviolet behaviour of the model but can still exhibit infrared divergences. We discuss the conditions under which this problem does not arise and the relevance of the operator-algebraic approach for better understanding of particle detector models and their applications.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_117,

title = {Thermal Area Law in Long-Range Interacting Systems},

author = {Donghoon Kim and Tomotaka Kuwahara and Keiji Saito},

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

year  = {2024},

date = {2024-01-01},

abstract = {The area law of the bipartite information measure is crucial in understanding quantum many-body physics and quantum information science. In thermal equilibrium, the area law for the mutual information universally holds at arbitrary temperatures as long as the systems have short-range interactions, and it is called the thermal area law. Contrary to this, for long-range interacting systems with power-law interactions, $r^-alpha$ (where $r$ is the distance), determining when the thermal area law applies is less clear. In this work, we clarify the optimal condition $alpha> alpha_c$ such that the thermal area law universally holds. Typically, examining the strength of the interaction across the boundary of two subsystems helps to identify these conditions. However, our findings suggest that the thermal area law is more robust than previously thought. We show the optimal threshold for the thermal area law by $alpha_c= (D+1)/2$ ($D$: the spatial dimension of the lattice), assuming a power-law decay of the clustering for the bipartite correlations. Intriguingly, this threshold also includes thermodynamically unstable scenarios where $alpha < D$. Moreover, we prove a power-law clustering theorem for $alpha > D$ to achieve an unconditional proof of the thermal area law above a certain temperature. We have validated this threshold through numerical simulations in both integrable and non-integrable systems. Our numerical studies on logarithmic negativity confirm that the same condition $alpha > (D+1)/2$ applies to the thermal area law for quantum entanglement.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_31,

title = {Tight and Efficient Gradient Bounds for Parameterized Quantum Circuits},

author = {Alistair Letcher and Stefan Woerner and Christa Zoufal},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_63,

title = {Tight conic approximation of testing regions for quantum statistical models and measurements},

author = {Michele Dall'Arno and Francesco Buscemi},

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

year  = {2024},

date = {2024-01-01},

abstract = {Quantum statistical models (i.e., families of normalized density matrices) and quantum measurements (i.e., positive operator-valued measures) can be regarded as linear maps: the former, mapping the space of effects to the space of probability distributions; the latter, mapping the space of states to the space of probability distributions. The images of such linear maps are called the testing regions of the corresponding model or measurement. Testing regions are notoriously impractical to treat analytically in the quantum case. Our first result is to provide an implicit outer approximation of the testing region of any given quantum statistical model or measurement in any finite dimension: namely, a region in probability space that contains the desired image, but is defined implicitly, using a formula that depends only on the given model or measurement. The outer approximation that we construct is minimal among all such outer approximations, and close, in the sense that it becomes the maximal inner approximation up to a constant scaling factor. Finally, we apply our approximation formulas to characterize, in a semi-device independent way, the ability to transform one quantum statistical model or measurement into another.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_227,

title = {Tightening continuity bounds on entropies and bounds on quantum capacities},

author = {Michael Gide Jabbour and Nilanjana Datta},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_113,

title = {Time discretization of near-adiabatic quantum dynamics with a large time step size},

author = {Dong An and Pedro C. S. Costa and Dominic W. Berry},

year  = {2024},

date = {2024-01-01},

abstract = {Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltonian simulation subroutine, which may introduce extra computational overhead or complicated quantum control logic. Here we establish general methodology of analyzing various numerical methods for discretizing near-adiabatic quantum dynamics. According to our analysis, the time step sizes in time discretization can be much larger than expected, and the overall complexity is greatly reduced. Remarkably, regardless of the general convergence order of the numerical method, we can choose a uniform time step size independent of tolerated error and evolution time for sufficiently accurate simulation. Furthermore, with the boundary cancellation condition where the continuous diabatic errors are exponentially suppressed, even first-order Trotter with uniform time step size can achieve exponential convergence. We apply our analysis to the example of adiabatic unstructured search and show several preferable features of the Trotterrized adiabatic approach: it can match the Grover lower bound, it does not require a priori knowledge on the number of marked states, and its performance can be asymptotically comparable with that of the quantum approximate optimization algorithm.},

keywords = {Outstanding Poster, Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_360,

title = {Topologically Robust Quantum Network Nonlocality},

author = {Tamás Kriváchy and Sadra Boreiri and Antoine Girardin and Pavel Sekatski and Nicolas Brunner},

year  = {2024},

date = {2024-01-01},

abstract = {In recent years, the study of Bell-type nonlocality on networks has led to an array of intriguing foundational results, most strongly illustrated by nonlocality without the need for inputs, i.e. each party in the network can conduct the same measurement in each round. Nonetheless the field still faces difficulties in finding a justified application. One of the key barriers for this is the assumption of independent sources in network nonlocality, which is difficult to enforce. In our work we examine a possible operational interpretation for such independent sources. In particular, in networks without inputs, parties connected with a common classical source can be interpreted as malicious parties working together. We explore the first steps in this framework and show that there exist nonlocal distributions which are robust against the topology of the network, i.e. in the spirit of decentralized protocols, the overall distributions are nonlocal even if one is unsure which parties are collaborating. In fact, even in large networks nonlocality is topologically robust when assuming information only about a constant-sized region of the network's connectivity, namely only the connectivity of 2 or 3 parties. We further examine the relation to randomness generation and highlight some remaining challenges in topological considerations in network nonlocality.},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_142,

title = {Towards large-scale quantum optimization solvers with few qubits},

author = {Marco Sciorilli and Lucas Borges and Taylor L. Patti and Giancarlo Camilo and Diego Garcia-Martin and Leandro Aolita and Anima Anandkumar},

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

year  = {2024},

date = {2024-01-01},

abstract = {We introduce a variational quantum solver for combinatorial optimizations over m=O(n^k) binary variables using only n qubits, with tunable k>1. The number of parameters and circuit depth display mild linear and sublinear scalings in m, respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. This leads to unprecedented quantum-solver performances. For m=7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m=2000, an experiment with n=17 trapped-ion qubits featured MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. To our knowledge, this is the highest quality attained experimentally on such sizes. Our findings offer a novel heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near term quantum devices.},

keywords = {Poster session Monday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_451,

title = {Towards Non-Abelian QSP: Control of Hybrid Continuous- and Discrete-Variable Architectures},

author = {Shraddha Singh and Baptiste Royer and Steven M Girvin},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_349,

title = {Towards practical quantum position verification},

author = {George Cowperthwaite and Adrian Kent and Damián Pitalúa-García},

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

year  = {2024},

date = {2024-01-01},

abstract = {We discuss protocols for quantum position verification schemes based on the standard quantum cryptographic assumption that a tagging device can keep classical data secure [1]. Our schemes use a classical key replenished by quantum key distribution. The position verification requires no quantum communication or quantum information processing. The security of classical data makes the schemes secure against non-local spoofing attacks that apply to schemes that do not use secure tags. The schemes are practical with current technology and allow for errors and losses. We describe how a proof-of-principle demonstration might be carried out. [1] A. Kent, Quantum tagging for tags containing secret classical data, Physical Review A 84(2), 022335 (2011).},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_392,

title = {Towards Unclonable Cryptography in the Plain Model},

author = {Céline Chevalier and Paul Hermouet and Quoc-Huy Vu},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_330,

title = {Trainability barriers and opportunities in quantum generative modeling},

author = {Sacha Lerch and Manuel Rudolph and Supanut Thanasilp and Zoe Holmes and Oriel Kiss and Michele Grossi and Sofia Vallecorsa},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_496,

title = {Training Quantum Boltzmann Machines to learn physical Gibbs states},

author = {Enrico Rinaldi and Yuta Kikuchi and Matthias Rosenkranz and Ryuji Sakata},

year  = {2024},

date = {2024-01-01},

abstract = {Gibbs states play central roles in understanding the equilibrium properties of quantum many-body systems, and also find 

applications in optimization and machine learning, where they are known as quantum Boltzmann machines (QBMs). The fact that the model Hamiltonian may contain non-commuting terms can make QBM more expressive than the classical Boltzmann machine, and in stark contrast to many other quantum machine learning models, training the QBM with an appropriate choice of objective function does not suffer from the vanishing gradient problem. In this work we numerically investigate the performance of QBMs for different target Gibbs states, model Hamiltonians, training parameters, and training strategies, used as a quantum generative model. We have developed a software package [1] that performs the QBM training with various combinations of target, model, and parameters using exact diagonalization on classical computers. 

[1] E. Rinaldi, Y. Kikuchi, M. Rosenkranz, and R. Sakata, 

https://github.com/cqcl/qbm benchmark dataset (2024), qbm benchmark dataset},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}

@Poster{P24_535,

title = {Transformation contextuality witness in heat flow inversion},

author = {Naim Elias Comar and Luis Felipe Santos and Danilo Cius and Rafael Wagner and Barbara Amaral},

year  = {2024},

date = {2024-01-01},

keywords = {Poster session Thursday},

pubstate = {published},

tppubtype = {Poster}

}