The poster session will be on Tuesday afternoon (see schedule). The posters will stay up all week in the Department of Mathematics.
The online poster presentations will take place through dedicated Audio/Video channels on the TQC Discord server. You can present your poster during the poster session or at any other time during the conference; all instructions can be found on the Discord server.
Note that not all accepted posters will be presented at the conference due to author availability constraints. If you cannot present your poster, you don’t need to email us.
Sergey Bravyi, Anirban Chowdhury, David Gosset, Vojtech Havlicek, Guanyu Zhu
Quantum complexity of the Kronecker coefficients Poster
2023.
@Poster{P5435,
title = {Quantum complexity of the Kronecker coefficients},
author = {Sergey Bravyi and Anirban Chowdhury and David Gosset and Vojtech Havlicek and Guanyu Zhu},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Ryotaro Suzuki, Jonas Haferkamp, Jens Eisert, Philippe Faist
Quantum complexity phase transition in monitored random circuits Poster
2023.
@Poster{P5937,
title = {Quantum complexity phase transition in monitored random circuits},
author = {Ryotaro Suzuki and Jonas Haferkamp and Jens Eisert and Philippe Faist},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Ruge Lin, Weiqiang Wen
Quantum computation capability verification protocol for noisy intermediate-scale quantum devices with the dihedral coset problem Poster
2023.
@Poster{P1120,
title = {Quantum computation capability verification protocol for noisy intermediate-scale quantum devices with the dihedral coset problem},
author = {Ruge Lin and Weiqiang Wen},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Sagar Silva Pratapsi, Lorenzo Buffoni, Stefano Gherardini
Quantum Computing Fidelity and Energetics in Driven Quantum Systems Poster
2023.
@Poster{P6503,
title = {Quantum Computing Fidelity and Energetics in Driven Quantum Systems},
author = {Sagar Silva Pratapsi and Lorenzo Buffoni and Stefano Gherardini},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Yukun Zhang, Yifei Huang, Jinzhao Sun, Dingshun Lv, Xiao Yuan
Quantum Computing Quantum Monte Carlo Poster
2023.
@Poster{P9322,
title = {Quantum Computing Quantum Monte Carlo},
author = {Yukun Zhang and Yifei Huang and Jinzhao Sun and Dingshun Lv and Xiao Yuan},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Shrigyan Brahmachari, Josep Lumbreras, Marco Tomamichel
Quantum contextual bandits and recommender systems for quantum data Poster
2023.
Abstract | Links:
@Poster{P4568,
title = {Quantum contextual bandits and recommender systems for quantum data},
author = {Shrigyan Brahmachari and Josep Lumbreras and Marco Tomamichel},
url = {https://arxiv.org/abs/2301.13524},
year = {2023},
date = {2023-01-01},
abstract = {We study a recommender system for quantum data using the linear contextual bandit framework. In each round, a learner receives an observable (the context) and has to recommend from a finite set of unknown quantum states (the actions) which one to measure. The learner has the goal of maximizing the reward in each round, that is the outcome of the measurement on the unknown state. Using this model we formulate the low energy quantum state recommendation problem where the context is a Hamiltonian and the goal is to recommend the state with the lowest energy. For this task, we study two families of contexts: the Ising model and a generalized cluster model. We observe that if we interpret the actions as different phases of the models then the recommendation is done by classifying the correct phase of the given Hamiltonian and the strategy can be interpreted as an online quantum phase classifier.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Kai-Siang Chen, Gelo Noel M Tabia, Chellasamy Jebarathinam, Shiladitya Mal, Jun-Yi Wu, Yeong-Cherng Liang
Quantum correlations on the no-signaling boundary: self-testing and more Poster
2023.
@Poster{P9103,
title = {Quantum correlations on the no-signaling boundary: self-testing and more},
author = {Kai-Siang Chen and Gelo Noel M Tabia and Chellasamy Jebarathinam and Shiladitya Mal and Jun-Yi Wu and Yeong-Cherng Liang},
url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688306781-poster-Poster_TQC23_Shiladitya.pdf},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Christopher Chubb, Kamil Korzekwa, Marco Tomamichel, Joseph M. Renes, Patryk Lipka-Bartosik
Quantum dichotomies and coherent thermodynamics beyond first-order asymptotics Poster
2023.
@Poster{P3942,
title = {Quantum dichotomies and coherent thermodynamics beyond first-order asymptotics},
author = {Christopher Chubb and Kamil Korzekwa and Marco Tomamichel and Joseph M. Renes and Patryk Lipka-Bartosik},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Benjamin Schiffer, Jordi Tura Brugués
Quantum eigenstate broadcasting assisted by a coherent link Poster
2023.
@Poster{P8455,
title = {Quantum eigenstate broadcasting assisted by a coherent link},
author = {Benjamin Schiffer and Jordi Tura Brugués},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Nunzia Cerrato, Giacomo De Palma, Vittorio Giovannetti
Quantum Entanglement Survival Time in the Presence of Markovian Noise: a Statistical Analysis Poster
2023.
@Poster{P7970,
title = {Quantum Entanglement Survival Time in the Presence of Markovian Noise: a Statistical Analysis},
author = {Nunzia Cerrato and Giacomo De Palma and Vittorio Giovannetti},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Diogo Cruz, Francisco Monteiro, Bruno Coutinho
Quantum Error Correction via Noise Guessing Decoding Poster
2023.
Abstract | Links:
@Poster{P5281,
title = {Quantum Error Correction via Noise Guessing Decoding},
author = {Diogo Cruz and Francisco Monteiro and Bruno Coutinho},
url = {https://arxiv.org/abs/2208.02744},
year = {2023},
date = {2023-01-01},
abstract = {We present a novel method of quantum error correction, dubbed QGRAND, and analyze its performance for the Pauli noise model. The decoding is adapted from a classical technique called guessing random additive noise decoding (GRAND), which works well for low entropy noise. This decoding process is agnostic to the encoding chosen, enabling us to use quantum random linear codes for the encoding step, which are known to be near-capacity achieving.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Nilton Filho, Taketoshi Iyota
Quantum Gate Optimization for Low-level Classical Simulation Poster
2023.
@Poster{P1533,
title = {Quantum Gate Optimization for Low-level Classical Simulation},
author = {Nilton Filho and Taketoshi Iyota},
year = {2023},
date = {2023-01-01},
abstract = {Simulating quantum computation on a classical computer has many applications, including verification of quantum algorithms and design tools for quantum algorithms.
In this research, we design an architecture of classical hardware specifically for simulating quantum computation, and optimize the quantum circuits that run on the architecture to achieve faster simulations than in previous research. The internal architecture aims to improve efficiency of resource use by optimizing the feasibility and cost of general computations. We also implement the designed architecture on a commercial FPGA device and implement several quantum algorithms to evaluate the performance of our architecture, while discussing about feasible limits for quantum computer simulation on classical computers.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
In this research, we design an architecture of classical hardware specifically for simulating quantum computation, and optimize the quantum circuits that run on the architecture to achieve faster simulations than in previous research. The internal architecture aims to improve efficiency of resource use by optimizing the feasibility and cost of general computations. We also implement the designed architecture on a commercial FPGA device and implement several quantum algorithms to evaluate the performance of our architecture, while discussing about feasible limits for quantum computer simulation on classical computers.
Mateus Araújo, Marcus Huber, Miguel Navascués, Matej Pivoluska, Armin Tavakoli
Quantum key distribution rates from semidefinite programming Poster
2023.
@Poster{P2819,
title = {Quantum key distribution rates from semidefinite programming},
author = {Mateus Araújo and Marcus Huber and Miguel Navascués and Matej Pivoluska and Armin Tavakoli},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
William Kretschmer
Quantum Mass Production Theorems Conference
2023.
Abstract | Links:
@Conference{T6465,
title = {Quantum Mass Production Theorems},
author = {William Kretschmer},
url = {https://arxiv.org/abs/2212.14399},
year = {2023},
date = {2023-01-01},
urldate = {2023-01-01},
abstract = {We prove that for any $n$-qubit unitary transformation $U$ and for any $r = 2^o(n / łog n)$, there exists a quantum circuit to implement $U^øtimes r$ with at most $O(4^n)$ gates. This asymptotically equals the number of gates needed to implement just a single copy of a worst-case $U$. We also establish analogous results for quantum states and diagonal unitary transformations. Our techniques are based on the work of Uhlig [Math. Notes 1974], who proved a similar mass production theorem for Boolean functions.},
howpublished = {Talk and Proceedings},
keywords = {},
pubstate = {published},
tppubtype = {Conference}
}
Vincent Steffan, Fulvio Gesmundo, Vladimir Lysikov
Quantum max-flow in the bridge graph Poster
2023.
@Poster{P1004,
title = {Quantum max-flow in the bridge graph},
author = {Vincent Steffan and Fulvio Gesmundo and Vladimir Lysikov},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Afham, Richard Kueng, Chris Ferrie
Quantum mean states are nicer than you think: fast algorithms to compute states maximizing average fidelity Poster
2023.
@Poster{P9847,
title = {Quantum mean states are nicer than you think: fast algorithms to compute states maximizing average fidelity},
author = {Afham and Richard Kueng and Chris Ferrie},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Liubov Markovich, Attaallah Almasi, Sina Zeytinoglu, Johannes Borregaard
Quantum memory assisted observable estimation Poster
2023.
@Poster{P7800,
title = {Quantum memory assisted observable estimation},
author = {Liubov Markovich and Attaallah Almasi and Sina Zeytinoglu and Johannes Borregaard},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Hugo Delavenne, François Le Gall, Yupan Liu, Masayuki Miyamoto
Quantum Merlin-Arthur proof systems for synthesizing quantum states Poster
2023.
@Poster{P5024,
title = {Quantum Merlin-Arthur proof systems for synthesizing quantum states},
author = {Hugo Delavenne and François Le Gall and Yupan Liu and Masayuki Miyamoto},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Myeongjin Shin, Junseo Lee, Kabgyun Jeong
Quantum Neural Network Approach to Measuring Von Neumann Entropy Poster
2023.
@Poster{P4953,
title = {Quantum Neural Network Approach to Measuring Von Neumann Entropy},
author = {Myeongjin Shin and Junseo Lee and Kabgyun Jeong},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Sofiene Jerbi, Arjan Cornelissen, Maris Ozols, Vedran Dunjko
Quantum policy gradient algorithms Conference
2023.
Abstract | Links:
@Conference{T8953,
title = {Quantum policy gradient algorithms},
author = {Sofiene Jerbi and Arjan Cornelissen and Maris Ozols and Vedran Dunjko},
url = {https://arxiv.org/abs/2212.09328},
year = {2023},
date = {2023-01-01},
urldate = {2023-01-01},
abstract = {Understanding the power and limitations of quantum access to data in machine learning tasks is primordial to assess the potential of quantum computing in artificial intelligence. Previous works have already shown that speed-ups in learning are possible when given quantum access to reinforcement learning environments. Yet, the applicability of quantum algorithms in this setting remains very limited, notably in environments with large state and action spaces. In this work, we design quantum algorithms to train state-of-the-art reinforcement learning policies by exploiting quantum interactions with an environment. However, these algorithms only offer full quadratic speed-ups in sample complexity over their classical analogs when the trained policies satisfy some regularity conditions. Interestingly, we find that reinforcement learning policies derived from parametrized quantum circuits are well-behaved with respect to these conditions, which showcases the benefit of a fully-quantum reinforcement learning framework.},
howpublished = {Talk and Proceedings},
keywords = {},
pubstate = {published},
tppubtype = {Conference}
}
Ansis Rosmanis
Quantum PRP/PRF Switching Lemma via Adversary Method Poster
2023.
@Poster{P8786,
title = {Quantum PRP/PRF Switching Lemma via Adversary Method},
author = {Ansis Rosmanis},
url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1687781638-poster-8786.pdf},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Marco Sciorilli, Lucas Borges, Taylor L. Patti, Giancarlo Camilo, Diego Garcia-Martin, Leandro Aolita
Quantum QUBO solvers with quadratically fewer qubits through multi-basis encoding Poster
2023.
@Poster{P1194,
title = {Quantum QUBO solvers with quadratically fewer qubits through multi-basis encoding},
author = {Marco Sciorilli and Lucas Borges and Taylor L. Patti and Giancarlo Camilo and Diego Garcia-Martin and Leandro Aolita},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Minseong Kim
Quantum reduction of the Hamiltonian path problem to period-finding Poster
2023.
@Poster{P7933,
title = {Quantum reduction of the Hamiltonian path problem to period-finding},
author = {Minseong Kim},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Hayata Yamasaki, Sathyawageeswar Subramanian, Satoshi Hayakawa, Sho Sonoda
Quantum Ridgelet Transform: Winning Lottery Ticket of Neural Networks with Quantum Computation Poster
2023.
@Poster{P5798,
title = {Quantum Ridgelet Transform: Winning Lottery Ticket of Neural Networks with Quantum Computation},
author = {Hayata Yamasaki and Sathyawageeswar Subramanian and Satoshi Hayakawa and Sho Sonoda},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Ryan Babbush, William Huggins, Dominic Berry, Shu Fay Ung, Andrew Zhao, David Reichman, Hartmut Neven, Andrew Baczewski, Joonho Lee
Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods Poster
2023.
@Poster{P7701,
title = {Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods},
author = {Ryan Babbush and William Huggins and Dominic Berry and Shu Fay Ung and Andrew Zhao and David Reichman and Hartmut Neven and Andrew Baczewski and Joonho Lee},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Ugnė Liaubaitė, Sabhayata Gupta, Younes Javanmard, Luis Santos, Tobias J. Osborne
Quantum Simulation of Quantum Link Models Poster
2023.
@Poster{P8554,
title = {Quantum Simulation of Quantum Link Models},
author = {Ugnė Liaubaitė and Sabhayata Gupta and Younes Javanmard and Luis Santos and Tobias J. Osborne},
year = {2023},
date = {2023-01-01},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Frank Somhorst, Reinier Meer, Malaquias Correa Anguita, Riko Schadow, Henk Snijders, Michiel Goede, Ben Kassenberg, Pim Venderbosch, Caterina Taballione, Jorn Epping, Hans Vlekkert, Jardi Timmerhuis, Jacob Bulmer, Jasleen Lugani, Ian Walmsley, P. W. H. Pinkse, Jens Eisert, Nathan Walk, Jelmer Renema
Quantum simulation of thermodynamics in an integrated quantum photonic processor Poster
2023.
@Poster{P3478,
title = {Quantum simulation of thermodynamics in an integrated quantum photonic processor},
author = {Frank Somhorst and Reinier Meer and Malaquias Correa Anguita and Riko Schadow and Henk Snijders and Michiel Goede and Ben Kassenberg and Pim Venderbosch and Caterina Taballione and Jorn Epping and Hans Vlekkert and Jardi Timmerhuis and Jacob Bulmer and Jasleen Lugani and Ian Walmsley and P. W. H. Pinkse and Jens Eisert and Nathan Walk and Jelmer Renema},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Yuanye Zhu
Quantum solving algorithm for d’Alembert solutions of the wave equation Poster
2023.
@Poster{P7995,
title = {Quantum solving algorithm for d’Alembert solutions of the wave equation},
author = {Yuanye Zhu},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Xiao-Ming Zhang, Tongyang Li, Xiao Yuan
Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications Poster
2023.
Abstract | Links:
@Poster{P2403,
title = {Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications},
author = {Xiao-Ming Zhang and Tongyang Li and Xiao Yuan},
url = {https://arxiv.org/abs/2201.11495 https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1683015338-poster-2403.pdf},
year = {2023},
date = {2023-01-01},
abstract = {Quantum state preparation is an important subroutine for quantum computing. We show that any $n$-qubit quantum state can be prepared with a $Theta(n)$-depth circuit using only single- and two-qubit gates, although with a cost of an exponential amount of ancillary qubits. On the other hand, for sparse quantum states with $dgeqslant2$ non-zero entries, we can reduce the circuit depth to $Theta(łog(nd))$ with $O(ndłog d)$ ancillary qubits. The algorithm for sparse states is exponentially faster than best-known results and the number of ancillary qubits is nearly optimal and only increases polynomially with the system size. We discuss applications of the results in different quantum computing tasks, such as Hamiltonian simulation, solving linear systems of equations, and realizing quantum random access memories, and find cases with exponential reductions of the circuit depth for all these three tasks. In particular, using our algorithm, we find a family of linear system solving problems enjoying exponential speedups, even compared to the best-known quantum and classical dequantization algorithms.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Yupan Liu
Quantum state testing beyond the polarizing regime and quantum triangular discrimination Poster
2023.
@Poster{P9117,
title = {Quantum state testing beyond the polarizing regime and quantum triangular discrimination},
author = {Yupan Liu},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Ming-Chien Hsu, En-Jui Kuo, Wei-Hsuan Yu, Jian-Feng Cai, Min-Hsiu Hsieh
Quantum state tomography via non-convex Riemannian gradient descent Poster
2023.
@Poster{P2471,
title = {Quantum state tomography via non-convex Riemannian gradient descent},
author = {Ming-Chien Hsu and En-Jui Kuo and Wei-Hsuan Yu and Jian-Feng Cai and Min-Hsiu Hsieh},
url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688135521-poster-poster_2471_Quantum-state-tomography-via-non-convex-Riemannian-gradient-descent.pdf},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Matt Wilson, Giulio Chiribella, Aleks Kissinger
Quantum Supermaps are Characterised by Locality Poster
2023.
@Poster{P7367,
title = {Quantum Supermaps are Characterised by Locality},
author = {Matt Wilson and Giulio Chiribella and Aleks Kissinger},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
David Trillo, Thinh Le, Miguel Navascues
Quantum supremacy in mechanical tasks: projectiles, rockets and quantum backflow Workshop
2023.
Abstract | Links:
@Workshop{T5145,
title = {Quantum supremacy in mechanical tasks: projectiles, rockets and quantum backflow},
author = {David Trillo and Thinh Le and Miguel Navascues},
url = {https://arxiv.org/abs/2209.00725},
year = {2023},
date = {2023-01-01},
abstract = {We consider a non-relativistic quantum particle in an infinite line. We estimate the maximum probability of finding the particle at some distant position given that it is initially bound in some region. We prove that quantum mechanics allows for greater probabilities than classical mechanics - thus obtaining a new kind of quantum advantage. We show that this effect is mathematically related to quantum backflow, and use this to improve the upper bounds on the Bracken-Mellow constant. Several generalizations are studied.},
howpublished = {Talk},
keywords = {},
pubstate = {published},
tppubtype = {Workshop}
}
Marco Fanizza, Josep Lumbreras, Andreas Winter
Quantum theory in finite dimension cannot explain every general process with finite memory Workshop
2023.
Abstract | Links:
@Workshop{T4004,
title = {Quantum theory in finite dimension cannot explain every general process with finite memory},
author = {Marco Fanizza and Josep Lumbreras and Andreas Winter},
url = {https://arxiv.org/abs/2209.11225 https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688151704-video-4004tqc2023.mp4},
year = {2023},
date = {2023-01-01},
abstract = {Arguably, the largest class of stochastic processes generated by means of a finite memory consists of those that are sequences of observations produced by sequential measurements in a suitable generalized probabilistic theory (GPT). These are constructed from a finite-dimensional memory evolving under a set of possible linear maps, and with probabilities of outcomes determined by linear functions of the memory state. Examples of such models are given by classical hidden Markov processes, where the memory state is a probability distribution, and at each step it evolves according to a non-negative matrix, and hidden quantum Markov processes, where the memory state is a finite dimensional quantum state, and at each step it evolves according to a completely positive map. Here we show that the set of processes admitting a finite-dimensional explanation do not need to be explainable in terms of either classical probability or quantum mechanics. To wit, we exhibit families of processes that have a finite-dimensional explanation, defined manifestly by the dynamics of explicitly given GPT, but that do not admit a quantum, and therefore not even classical, explanation in finite dimension. Furthermore, we present a family of quantum processes on qubits and qutrits that do not admit a classical finite-dimensional realization, which includes examples introduced earlier by Fox, Rubin, Dharmadikari and Nadkarni as functions of infinite dimensional Markov chains, and lower bound the size of the memory of a classical model realizing a noisy version of the qubit processes.},
howpublished = {Talk},
keywords = {},
pubstate = {published},
tppubtype = {Workshop}
}
Stefano Chessa, Salvatore Tirone, Raffaele Salvia, Vittorio Giovannetti
Quantum Work Capacitances of quantum channels Poster
2023.
@Poster{P687,
title = {Quantum Work Capacitances of quantum channels},
author = {Stefano Chessa and Salvatore Tirone and Raffaele Salvia and Vittorio Giovannetti},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Samson Wang, Sam McArdle, Mario Berta
Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra Workshop
2023.
Abstract | Links:
@Workshop{T1887,
title = {Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra},
author = {Samson Wang and Sam McArdle and Mario Berta},
url = {https://arxiv.org/abs/2302.01873},
year = {2023},
date = {2023-01-01},
abstract = {We propose a class of randomized quantum algorithms for the task of sampling from matrix functions, without the use of quantum block encodings or any other coherent oracle access to the matrix elements. As such, our use of qubits is purely algorithmic, and no additional qubits are required for quantum data structures. For $N times N$ Hermitian matrices, the space cost is $łog(N)+1$ qubits and depending on the structure of the matrices, the gate complexity can be comparable to state-of-the-art methods that use quantum data structures of up to size $O(N^2)$, when considering equivalent end-to-end problems. Within our framework, we present a quantum linear system solver that allows one to sample properties of the solution vector, as well as algorithms for sampling properties of ground states and Gibbs states of Hamiltonians. As a concrete application, we combine these sub-routines to present a scheme for calculating Green's functions of quantum many-body systems.},
howpublished = {Talk},
keywords = {},
pubstate = {published},
tppubtype = {Workshop}
}
Yixu Wang, Yijia Xu, En-Jui Kuo, Victor V. Albert
Qubit-oscillator concatenated codes: decoding formalism & code comparison Poster
2023.
@Poster{P8276,
title = {Qubit-oscillator concatenated codes: decoding formalism & code comparison},
author = {Yixu Wang and Yijia Xu and En-Jui Kuo and Victor V. Albert},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Jonas Haferkamp
Random quantum circuits are approximate unitary $t$-designs in depth $Ołeft(nt^5+o(1)right)$ Poster
2023.
@Poster{P2475,
title = {Random quantum circuits are approximate unitary $t$-designs in depth $Ołeft(nt^5+o(1)right)$},
author = {Jonas Haferkamp},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Newton Cheng, Cécilia Lancien, Geoff Penington, Michael Walter, Freek Witteveen
Random Tensor Networks with Nontrivial Links Poster
2023.
@Poster{P8176,
title = {Random Tensor Networks with Nontrivial Links},
author = {Newton Cheng and Cécilia Lancien and Geoff Penington and Michael Walter and Freek Witteveen},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Vishnu Iyer, Siddhartha Jain, Vinayak Kumar, Michael Whitmeyer
Rational Degree, Postselection, and Bounded-Error Quantum Computation Poster
2023.
@Poster{P229,
title = {Rational Degree, Postselection, and Bounded-Error Quantum Computation},
author = {Vishnu Iyer and Siddhartha Jain and Vinayak Kumar and Michael Whitmeyer},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Anastasiia Nikolaeva, Evgeniy Kiktenko, Aleksey Fedorov
Realizing quantum algorithms on qubits embedded into trapped-ion qudits Poster
2023.
@Poster{P9010,
title = {Realizing quantum algorithms on qubits embedded into trapped-ion qudits},
author = {Anastasiia Nikolaeva and Evgeniy Kiktenko and Aleksey Fedorov},
url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688366691-poster-9010.pdf},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Mathieu Bérubé-Vallières, Noah Brüstle, Claude Crépeau
Reductions among Magic Rectangle Games Poster
2023.
@Poster{P3108,
title = {Reductions among Magic Rectangle Games},
author = {Mathieu Bérubé-Vallières and Noah Brüstle and Claude Crépeau},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Felix Huber, Nikolai Wyderka
Refuting spectral compatibility of quantum marginals Workshop
2023.
Abstract | Links:
@Workshop{T9488,
title = {Refuting spectral compatibility of quantum marginals},
author = {Felix Huber and Nikolai Wyderka},
url = {https://arxiv.org/abs/2211.06349},
year = {2023},
date = {2023-01-01},
abstract = {The spectral variant of the quantum marginal problem asks: Given prescribed spectra for a set of quantum marginals, does there exist a compatible joint state? The main idea of this work is a symmetry-reduced semidefinite programming hierarchy for detecting incompatible spectra. The hierarchy is complete, in the sense that it detects every incompatible set of spectra. The refutations it provides are dimension-free, certifying incompatibility in all local dimensions. The hierarchy equally applies to the sums of Hermitian matrices problem, to optimize trace polynomials on the positive cone, to the compatibility of invariants, and to certify vanishing Kronecker coefficients.},
howpublished = {Talk},
keywords = {},
pubstate = {published},
tppubtype = {Workshop}
}
Fulvio Flamini, Marius Krumm, Lukas J. Fiderer, Thomas Mueller, Hans J. Briegel
Reinforcement learning and decision making via single-photon quantum walks Poster
2023.
@Poster{P8047,
title = {Reinforcement learning and decision making via single-photon quantum walks},
author = {Fulvio Flamini and Marius Krumm and Lukas J. Fiderer and Thomas Mueller and Hans J. Briegel},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Julius Wallnöfer, Frederik Hahn, Fabian Wiesner, Nathan Walk, Jens Eisert
ReQuSim: Faithfully simulating near-term quantum repeaters Poster
2023.
@Poster{P9247,
title = {ReQuSim: Faithfully simulating near-term quantum repeaters},
author = {Julius Wallnöfer and Frederik Hahn and Fabian Wiesner and Nathan Walk and Jens Eisert},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Luís Bugalho, Emmanuel Zambrini Cruzeiro, Kevin Chen, Wenhan Dai, Dirk Englund, Yasser Omar
Resource-efficient simulation of noisy quantum circuits and application to network-enabled QRAM optimization Poster
2023.
@Poster{P9470,
title = {Resource-efficient simulation of noisy quantum circuits and application to network-enabled QRAM optimization},
author = {Luís Bugalho and Emmanuel Zambrini Cruzeiro and Kevin Chen and Wenhan Dai and Dirk Englund and Yasser Omar},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Ulysse Chabaud, Mattia Walschaers
Resources for bosonic quantum computational advantage Workshop
2023.
Abstract | Links:
@Workshop{T6568,
title = {Resources for bosonic quantum computational advantage},
author = {Ulysse Chabaud and Mattia Walschaers},
url = {https://arxiv.org/abs/2207.11781},
year = {2023},
date = {2023-01-01},
abstract = {Quantum computers promise to dramatically outperform their classical counterparts. However, the non-classical resources enabling such computational advantages are challenging to pinpoint, as it is not a single resource but the subtle interplay of many that can be held responsible for these potential advantages. In this work, we show that every bosonic quantum computation can be recast into a continuous-variable sampling computation where all computational resources are contained in the input state. Using this reduction, we derive a general classical algorithm for the strong simulation of bosonic computations, whose complexity scales with the non-Gaussian stellar rank of both the input state and the measurement setup. We further study the conditions for an efficient classical simulation of the associated continuous-variable sampling computations and identify an operational notion of non-Gaussian entanglement based on the lack of passive separability, thus clarifying the interplay of bosonic quantum computational resources such as squeezing, non-Gaussianity and entanglement.},
howpublished = {Talk},
keywords = {},
pubstate = {published},
tppubtype = {Workshop}
}
Kyrylo Simonov, Giulio Chiribella
Revealing non-classicality with indefinite causal orders Poster
2023.
@Poster{P3844,
title = {Revealing non-classicality with indefinite causal orders},
author = {Kyrylo Simonov and Giulio Chiribella},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Ryo Hiromasa, Akihiro Mizutani, Yuki Takeuchi, Seiichiro Tani
Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection Conference
2023.
Abstract | Links:
@Conference{T6430,
title = {Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection},
author = {Ryo Hiromasa and Akihiro Mizutani and Yuki Takeuchi and Seiichiro Tani},
url = {https://arxiv.org/abs/2206.05434},
year = {2023},
date = {2023-01-01},
urldate = {2023-01-01},
abstract = {We define rewinding operators that invert quantum measurements. Then, we define complexity classes $latex sf RwBQP$, $latex sf CBQP$, and $latex sf AdPostBQP$ as sets of decision problems solvable by polynomial-size quantum circuits with a polynomial number of rewinding operators, cloning operators, and adaptive postselections, respectively. Our main result is that $latex sf BPP^sf PP subseteq sf RwBQP = sf CBQP = sf AdPostBQP subseteq sf PSPACE$. As a byproduct of this result, we show that any problem in $latex sf PostBQP$ can be solved with only postselections of outputs whose probabilities are polynomially close to one. Under the strongly believed assumption that $latex sf BQP nsupseteq sf SZK$, or the shortest independent vectors problem cannot be efficiently solved with quantum computers, we also show that a single rewinding operator is sufficient to achieve tasks that are intractable for quantum computation. In addition, we consider rewindable Clifford and instantaneous quantum polynomial time circuits.},
howpublished = {Talk and Proceedings},
keywords = {},
pubstate = {published},
tppubtype = {Conference}
}
Pavlo Pyshkin, Aurél Gábris, Da-Wei Luo, J. Q. You, Lian-Ao Wu
Robust quantum search algorithm via non-unitary Zeno-like dynamics Poster
2023.
@Poster{P8442,
title = {Robust quantum search algorithm via non-unitary Zeno-like dynamics},
author = {Pavlo Pyshkin and Aurél Gábris and Da-Wei Luo and J. Q. You and Lian-Ao Wu},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Renato Mello, Ingo Roth, Leandro Aolita
Robust shadow estimation by directly sampling short-depth random circuits Poster
2023.
@Poster{P2774,
title = {Robust shadow estimation by directly sampling short-depth random circuits},
author = {Renato Mello and Ingo Roth and Leandro Aolita},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Aadil Oufkir
Sample-Optimal Quantum Process Tomography with Non-Adaptive Incoherent Measurements Workshop
2023.
Abstract | Links:
@Workshop{T1682,
title = {Sample-Optimal Quantum Process Tomography with Non-Adaptive Incoherent Measurements},
author = {Aadil Oufkir},
url = {https://arxiv.org/abs/2301.12925},
year = {2023},
date = {2023-01-01},
abstract = {How many copies of a quantum process are necessary and sufficient to construct an approximate classical description of it? We extend the result of Surawy-Stepney, Kahn, Kueng, and Guta (2022) to show that $tildemathcalO(din^3dout^3/ε^2)$ copies are sufficient to learn any quantum channel $mathdsC^dintimes dinrightarrowmathdsC^douttimes dout$ to within ε in diamond norm. Moreover, we show that $Ømega(din^3dout^3/ε^2)$ copies are necessary for any strategy using incoherent non-adaptive measurements. This lower bound applies even for ancilla-assisted strategies.},
howpublished = {Talk},
keywords = {},
pubstate = {published},
tppubtype = {Workshop}
}
Rebecca Erbanni, Antonios Varvitsiotis, Dario Poletti
Second mover advantage in unbalanced quantum games Poster
2023.
@Poster{P8519,
title = {Second mover advantage in unbalanced quantum games},
author = {Rebecca Erbanni and Antonios Varvitsiotis and Dario Poletti},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Michele Ciampi, Alexandru Cojocaru, Elham Kashefi, Atul Mantri
Secure Two-Party Quantum Computation Over Classical Channels Poster
2023.
@Poster{P2401,
title = {Secure Two-Party Quantum Computation Over Classical Channels},
author = {Michele Ciampi and Alexandru Cojocaru and Elham Kashefi and Atul Mantri},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Guillermo Currás-Lorenzo, Kiyoshi Tamaki, Marcos Curty
Security of decoy-state quantum key distribution with imperfect phase randomization Poster
2023.
@Poster{P1093,
title = {Security of decoy-state quantum key distribution with imperfect phase randomization},
author = {Guillermo Currás-Lorenzo and Kiyoshi Tamaki and Marcos Curty},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Martin Sandfuchs, Marcus Haberland, V. Vilasini, Ramona Wolf
Security of differential phase shift QKD from relativistic principles Workshop
2023.
Abstract | Links:
@Workshop{T686,
title = {Security of differential phase shift QKD from relativistic principles},
author = {Martin Sandfuchs and Marcus Haberland and V. Vilasini and Ramona Wolf},
url = {https://arxiv.org/abs/2301.11340},
year = {2023},
date = {2023-01-01},
abstract = {The design of quantum protocols for secure key generation poses many challenges: On the one hand, they need to be practical concerning experimental realisations. On the other hand, their theoretical description must be simple enough to allow for a security proof against all possible attacks. Often, these two requirements are in conflict with each other, and the differential phase shift (DPS) QKD protocol exemplifies these difficulties: It is designed to be implementable with current optical telecommunication technology, which, for this protocol, comes at the cost that many standard security proof techniques do not apply to it. After about 20 years since its invention, this work presents the first full security proof of DPS QKD against general attacks, including finite-size effects. The proof combines techniques from quantum information theory, quantum optics, and relativity. We first give a security proof of a QKD protocol whose security stems from relativistic constraints. We then show that security of DPS QKD can be reduced to security of the relativistic protocol. In addition, we show that coherent attacks on the DPS protocol are, in fact, stronger than collective attacks.},
howpublished = {Talk},
keywords = {},
pubstate = {published},
tppubtype = {Workshop}
}
Shubhayan Sarkar, Chandan Datta, Saronath Halder, Remigiusz Augusiak
Self-testing composite measurements and bound entangled state in a unified framework Poster
2023.
@Poster{P6891,
title = {Self-testing composite measurements and bound entangled state in a unified framework},
author = {Shubhayan Sarkar and Chandan Datta and Saronath Halder and Remigiusz Augusiak},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Zane Rossi, Isaac Chuang
Semantic Embedding for Quantum Algorithms Poster
2023.
@Poster{P3237,
title = {Semantic Embedding for Quantum Algorithms},
author = {Zane Rossi and Isaac Chuang},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Dina Abdelhadi
Semidefinite program formulation of contraction coefficients of Quantum Hadamard channels Poster
2023.
@Poster{P2387,
title = {Semidefinite program formulation of contraction coefficients of Quantum Hadamard channels},
author = {Dina Abdelhadi},
year = {2023},
date = {2023-01-01},
abstract = {We show a connection between contraction coefficients of Hadamard channels and the semidefinite program of the gamma 2-norm quantity that is used for obtaining bounds in communication complexity. Specifically, we show how an upper-bound on the contraction of the coherence under dephasing can be obtained via such an SDP.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
John Calsamiglia, Marco Fanizza, Christoph Hirche, Yonglong Li, Esteban Martínez Vargas, Ramon Muñoz-Tapia, Gael Sentis, Michalis Skotiniotis, Vincent Tan, Marco Tomamichel
Sequential Methods in Quantum Hypothesis Testing Workshop
2023.
Abstract | Links:
@Workshop{T5807,
title = {Sequential Methods in Quantum Hypothesis Testing},
author = {John Calsamiglia and Marco Fanizza and Christoph Hirche and Yonglong Li and Esteban Martínez Vargas and Ramon Muñoz-Tapia and Gael Sentis and Michalis Skotiniotis and Vincent Tan and Marco Tomamichel},
url = {https://arxiv.org/abs/2208.03265 https://arxiv.org/abs/2104.14706},
year = {2023},
date = {2023-01-01},
abstract = {The task of testing the validity of a hypothesis underlies numerous applications in quantum information theory. The most commonly investigated approach is that of gathering all the available (quantum) data and making a final decision based on a collective measurement. However, such offline strategies are often far from practical, both in the amount of data required as well as in the complexity of the required measurement. In some settings, when the goal is quick detection, offline algorithms are not applicable at all, as they can only make a decision once all samples are received. Sequential methods offer the use of online strategies, where samples are requested on a need-to-know basis, drastically reducing the number of required samples in order to guarantee the, task specific, associated performance criteria. While extensively investigated and applied in the classical setting, we know far less about the optimal performance of such online strategies when quantum data is available. In this joint submission we present major recent progress on sequential methods for the fundamental tasks of quantum state discrimination, channel discrimination and quickest change point detection. In summary, we provide a comprehensive picture of the optimal asymptotic performance of online strategies in these settings under different performance criteria.},
howpublished = {Talk},
keywords = {},
pubstate = {published},
tppubtype = {Workshop}
}