There are 429 accepted posters for TQC 2024. Of these, the Programme Committee highlighted 19 Outstanding Posters: you can find them by filtering on the dropdown tag menu below.
Clarifications
Accepted does not mean presented: Note that not all accepted posters will be presented at the conference due to author availability constraints. Shortly before the conference start, we will clarify which posters are set to be presented in person, based on whether the authors have registered for the conference. If you are interested in a particular poster, please contact the author directly.
Online presentation: For authors who cannot make it to the conference, it will be possible to present the poster online throughout the week on our Discord server. We will share instructions closer to the conference. In our experience, online attendance of these presentations is much lower than in-person attendance.
Withdrawing poster: If you cannot or do not wish to present your accepted poster, you don’t need to contact the organizers or PC chairs; this list will stay here to mark all submissions that were accepted. Exception: if you found a fatal mistake in the submission or would like to change the authors’ names, please let us know.
Upload media: If you would like to upload a thumbnail, more links or the poster pdf, please follow the link on the notification email sent by the PC chairs to the corresponding authors.
Poster sessions: The live poster sessions will be on Monday and Thursday (see schedule). If your poster submission number is below 290, you present on Monday; if it is above 290, you present on Thursday (290 is a talk). If you cannot make it to your allocated session, just bring the poster to the other session and find a free slot. You don’t need to ask the organizers.
Poster printing and size: The poster size should be A0 (84.1 cm × 118.9 cm) in portrait orientation. We recommend bringing your poster with you, as printing options in Okinawa are limited.
101.
Carlos Pascual, Stefan Baeuml, Mateus Araújo, Rotem Liss, Antonio Acin
Improved finite-size key rates for discrete-modulated continuous variable quantum key distribution in the presence of coherent attacks Poster
2024.
Tags: Poster session Thursday
@Poster{P24_493,
title = {Improved finite-size key rates for discrete-modulated continuous variable quantum key distribution in the presence of coherent attacks},
author = {Carlos Pascual and Stefan Baeuml and Mateus Araújo and Rotem Liss and Antonio Acin},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
102.
Dohun Kim, Minyoung Kim, Sarah Meng Li, Michele Mosca
Improving the Fidelity of CNOT Circuits on NISQ Hardware Poster
2024.
Tags: Poster session Thursday
@Poster{P24_460,
title = {Improving the Fidelity of CNOT Circuits on NISQ Hardware},
author = {Dohun Kim and Minyoung Kim and Sarah Meng Li and Michele Mosca},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
103.
Brandon Augustino, Madelyn Cain, Edward Farhi, Swati Gupta, Sam Gutmann, Daniel Ranard, Eugene Tang, Katherine Van Kirk
Improving the QAOA using warm-starts generated by Goemans-Williamson Poster
2024.
Abstract | Tags: Poster session Thursday
@Poster{P24_560,
title = {Improving the QAOA using warm-starts generated by Goemans-Williamson},
author = {Brandon Augustino and Madelyn Cain and Edward Farhi and Swati Gupta and Sam Gutmann and Daniel Ranard and Eugene Tang and Katherine Van Kirk},
year = {2024},
date = {2024-01-01},
abstract = {The Quantum Approximate Optimization Algorithm (QAOA) can be used to find good approximate solutions to the problem of extremizing a classical cost function defined on bit strings. We study the QAOA in its application to the MaxCut problem and explore how information from classical semi-definite programming (SDP) approximations can be used to improve the performance of the QAOA. In particular, Tate et al. previously constructed a warm-start variant of the QAOA using information from the Goemans-Williamson (GW) algorithm, a polynomial-time classical approximation algorithm based on SDP relaxation. We investigate the performance of this SDP-informed, warm-start QAOA on several classes of graphs: bipartite graphs, large random regular graphs, and Karloff graphs (worst-case graphs that saturate the GW approximation guarantee). For these families of graphs, we find that not only does the warm-start variant exhibit superior performance over the standard QAOA, but also it consistently outperforms the GW algorithm even at low depths. For example, with large, random 3-regular graphs, the warm-start QAOA begins to regularly outperform GW starting at depth p = 4. We are able to explore both the ordinary QAOA and the warm-start variant at high-depths by leveraging tensor network techniques, and we believe these techniques may have broader applications in analyzing the QAOA at larger system sizes and higher depths. This work is a step towards understanding how information from classical algorithms can be used to improve their quantum counterparts.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
The Quantum Approximate Optimization Algorithm (QAOA) can be used to find good approximate solutions to the problem of extremizing a classical cost function defined on bit strings. We study the QAOA in its application to the MaxCut problem and explore how information from classical semi-definite programming (SDP) approximations can be used to improve the performance of the QAOA. In particular, Tate et al. previously constructed a warm-start variant of the QAOA using information from the Goemans-Williamson (GW) algorithm, a polynomial-time classical approximation algorithm based on SDP relaxation. We investigate the performance of this SDP-informed, warm-start QAOA on several classes of graphs: bipartite graphs, large random regular graphs, and Karloff graphs (worst-case graphs that saturate the GW approximation guarantee). For these families of graphs, we find that not only does the warm-start variant exhibit superior performance over the standard QAOA, but also it consistently outperforms the GW algorithm even at low depths. For example, with large, random 3-regular graphs, the warm-start QAOA begins to regularly outperform GW starting at depth p = 4. We are able to explore both the ordinary QAOA and the warm-start variant at high-depths by leveraging tensor network techniques, and we believe these techniques may have broader applications in analyzing the QAOA at larger system sizes and higher depths. This work is a step towards understanding how information from classical algorithms can be used to improve their quantum counterparts.
104.
Nicolás Medina Sánchez
Information-theoretic Reconstruction of Quantum Particle Statistics Poster
2024.
Tags: Poster session Thursday
@Poster{P24_480,
title = {Information-theoretic Reconstruction of Quantum Particle Statistics},
author = {Nicolás Medina Sánchez},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
105.
Islam Faisal
Interactive Oracle Arguments in the QROM and Applications to Succinct Verification of Quantum Computation Poster
2024.
Tags: Poster session Thursday
@Poster{P24_443,
title = {Interactive Oracle Arguments in the QROM and Applications to Succinct Verification of Quantum Computation},
author = {Islam Faisal},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
106.
Brent Harrison, Jason Necaise, Andrew Projansky, James Whitfield
Jordan-Wigner, Ternary Trees and Sierpinski Trees: A Unified Picture of One-to-One Fermion-to-Qubit Encodings Poster
2024.
Abstract | Tags: Poster session Thursday
@Poster{P24_369,
title = {Jordan-Wigner, Ternary Trees and Sierpinski Trees: A Unified Picture of One-to-One Fermion-to-Qubit Encodings},
author = {Brent Harrison and Jason Necaise and Andrew Projansky and James Whitfield},
year = {2024},
date = {2024-01-01},
abstract = {Several mappings of fermions to qubits similar to Jordan-Wigner have been proposed, including the Bravyi-Kitaev, Ternary Tree and Parity mappings. We present a unified group-theoretic framework for this class of one-to-one mappings, which we use to reformulate the ternary tree mapping in terms of a novel class of classical data structures, which we call Sierpinski trees. While matching the optimal locality properties of ternary trees, the Sierpinski tree mapping has the additional benefit of encoding the fermionic states as computational basis states. This is analogous to the reformulation of the Bravyi-Kitaev encoding in terms of Fenwick trees. In the classical setting, Fenwick trees see use in applications that require storing and dynamically updating data in an array, as well as efficiently calculating prefix sums. They accomplish these operations in $O(łog_2 N)$ time. We show that our ``quantum-inspired'' Sierpinski trees are strictly better, accomplishing them in $O(łog_3 N)$ time instead. Using the connection to the ternary tree encoding, we prove this order to be optimal.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Several mappings of fermions to qubits similar to Jordan-Wigner have been proposed, including the Bravyi-Kitaev, Ternary Tree and Parity mappings. We present a unified group-theoretic framework for this class of one-to-one mappings, which we use to reformulate the ternary tree mapping in terms of a novel class of classical data structures, which we call Sierpinski trees. While matching the optimal locality properties of ternary trees, the Sierpinski tree mapping has the additional benefit of encoding the fermionic states as computational basis states. This is analogous to the reformulation of the Bravyi-Kitaev encoding in terms of Fenwick trees. In the classical setting, Fenwick trees see use in applications that require storing and dynamically updating data in an array, as well as efficiently calculating prefix sums. They accomplish these operations in $O(łog_2 N)$ time. We show that our ``quantum-inspired'' Sierpinski trees are strictly better, accomplishing them in $O(łog_3 N)$ time instead. Using the connection to the ternary tree encoding, we prove this order to be optimal.
107.
Yu-Chao Hsu, Ran-Yu Chang, Tsung-Wei Huang
Learning Classical Neural Networks for Quantum Support Vector Machine Poster
2024.
Abstract | Tags: Poster session Thursday
@Poster{P24_521,
title = {Learning Classical Neural Networks for Quantum Support Vector Machine},
author = {Yu-Chao Hsu and Ran-Yu Chang and Tsung-Wei Huang},
year = {2024},
date = {2024-01-01},
abstract = {In this study, we propose an innovative method that uses classical neural networks to optimize the kernel functions of a Quantum Support Vector Machine (QSVM). The Quantum Embedding Kernels (QEK) technique in QSVM, which involves embedding data into the Hilbert space of a quantum computer to construct kernels, has been further enhanced through optimization with classical neural networks. The optimized model has significantly improved accuracy for image classification tasks, demonstrating the potent potential of integrating classical machine learning with quantum computing. Our work provides a practical tool for addressing the issue of poor discrimination accuracy in Quantum Machine Learning (QML) models, thereby enhancing the potential of QML for future research and development.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
In this study, we propose an innovative method that uses classical neural networks to optimize the kernel functions of a Quantum Support Vector Machine (QSVM). The Quantum Embedding Kernels (QEK) technique in QSVM, which involves embedding data into the Hilbert space of a quantum computer to construct kernels, has been further enhanced through optimization with classical neural networks. The optimized model has significantly improved accuracy for image classification tasks, demonstrating the potent potential of integrating classical machine learning with quantum computing. Our work provides a practical tool for addressing the issue of poor discrimination accuracy in Quantum Machine Learning (QML) models, thereby enhancing the potential of QML for future research and development.
108.
Marco Fanizza, Niklas Galke, Josep Lumbreras, Cambyse Rouze, Andreas Winter
Learning finitely correlated states: stability of the spectral reconstruction Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_312,
title = {Learning finitely correlated states: stability of the spectral reconstruction},
author = {Marco Fanizza and Niklas Galke and Josep Lumbreras and Cambyse Rouze and Andreas Winter},
url = {https://arxiv.org/abs/2312.07516},
year = {2024},
date = {2024-01-01},
abstract = {We show that marginals of blocks of t systems of any finitely correlated translation invariant state on a chain can be learned, in trace distance, with O(t2) copies – with an explicit dependence on local dimension, memory dimension and spectral properties of a certain map constructed from the state – and computational complexity polynomial in t. The algorithm requires only the estimation of a marginal of a controlled size, in the worst case bounded by the minimum bond dimension, from which it reconstructs a translation invariant matrix product operator. In the analysis, a central role is played by the theory of operator systems. A refined error bound can be proven for C∗-finitely correlated states, which have an operational interpretation in terms of sequential quantum channels applied to the memory system. We can also obtain an analogous error bound for a class of matrix product density operators reconstructible by local marginals. In this case, a linear number of marginals must be estimated, obtaining a sample complexity of Õ(t3). The learning algorithm also works for states that are only close to a finitely correlated state, with the potential of providing competitive algorithms for other interesting families of states.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
We show that marginals of blocks of t systems of any finitely correlated translation invariant state on a chain can be learned, in trace distance, with O(t2) copies – with an explicit dependence on local dimension, memory dimension and spectral properties of a certain map constructed from the state – and computational complexity polynomial in t. The algorithm requires only the estimation of a marginal of a controlled size, in the worst case bounded by the minimum bond dimension, from which it reconstructs a translation invariant matrix product operator. In the analysis, a central role is played by the theory of operator systems. A refined error bound can be proven for C∗-finitely correlated states, which have an operational interpretation in terms of sequential quantum channels applied to the memory system. We can also obtain an analogous error bound for a class of matrix product density operators reconstructible by local marginals. In this case, a linear number of marginals must be estimated, obtaining a sample complexity of Õ(t3). The learning algorithm also works for states that are only close to a finitely correlated state, with the potential of providing competitive algorithms for other interesting families of states.
109.
Arjun Mirani, Patrick Hayden
Learning interacting fermionic Hamiltonians at the Heisenberg limit Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_562,
title = {Learning interacting fermionic Hamiltonians at the Heisenberg limit},
author = {Arjun Mirani and Patrick Hayden},
url = {https://arxiv.org/abs/2403.00069},
year = {2024},
date = {2024-01-01},
abstract = {Efficiently learning an unknown Hamiltonian given access to its dynamics is a problem of interest for quantum metrology, many-body physics and machine learning. A fundamental question is whether learning can be performed at the Heisenberg limit, where the Hamiltonian evolution time scales inversely with the error, epsilon, in the reconstructed parameters. The Heisenberg limit has previously been shown to be achievable for certain classes of qubit and bosonic Hamiltonians. Most recently, a Heisenberg-limited learning algorithm was proposed for a simplified class of fermionic Hubbard Hamiltonians restricted to real hopping amplitudes and zero chemical potential at all sites, along with on-site interactions. In this work, we provide an algorithm to learn a more general class of fermionic Hubbard Hamiltonians at the Heisenberg limit, allowing complex hopping amplitudes and nonzero chemical potentials in addition to the on-site interactions, thereby including several models of physical interest. The required evolution time across all experiments in our protocol is O(1/epsilon) and the number of experiments required to learn all the Hamiltonian parameters is O(polylog(1/epsilon)), independent of system size as long as each fermionic mode interacts with O(1) other modes. Unlike prior algorithms for bosonic and fermionic Hamiltonians, to obey fermionic parity superselection constraints in our more general setting, our protocol utilizes O(N) ancillary fermionic modes, where N is the system size. Each experiment involves preparing fermionic Gaussian states, interleaving time evolution with fermionic linear optics unitaries, and performing local occupation number measurements on the fermionic modes. The protocol is robust to a constant amount of state preparation and measurement error.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Efficiently learning an unknown Hamiltonian given access to its dynamics is a problem of interest for quantum metrology, many-body physics and machine learning. A fundamental question is whether learning can be performed at the Heisenberg limit, where the Hamiltonian evolution time scales inversely with the error, epsilon, in the reconstructed parameters. The Heisenberg limit has previously been shown to be achievable for certain classes of qubit and bosonic Hamiltonians. Most recently, a Heisenberg-limited learning algorithm was proposed for a simplified class of fermionic Hubbard Hamiltonians restricted to real hopping amplitudes and zero chemical potential at all sites, along with on-site interactions. In this work, we provide an algorithm to learn a more general class of fermionic Hubbard Hamiltonians at the Heisenberg limit, allowing complex hopping amplitudes and nonzero chemical potentials in addition to the on-site interactions, thereby including several models of physical interest. The required evolution time across all experiments in our protocol is O(1/epsilon) and the number of experiments required to learn all the Hamiltonian parameters is O(polylog(1/epsilon)), independent of system size as long as each fermionic mode interacts with O(1) other modes. Unlike prior algorithms for bosonic and fermionic Hamiltonians, to obey fermionic parity superselection constraints in our more general setting, our protocol utilizes O(N) ancillary fermionic modes, where N is the system size. Each experiment involves preparing fermionic Gaussian states, interleaving time evolution with fermionic linear optics unitaries, and performing local occupation number measurements on the fermionic modes. The protocol is robust to a constant amount of state preparation and measurement error.
110.
Armando Angrisani
Learning unitaries with quantum statistical queries Poster
2024.
Tags: Poster session Thursday
@Poster{P24_411,
title = {Learning unitaries with quantum statistical queries},
author = {Armando Angrisani},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
111.
Chengkai Zhu, Zhiping Liu, Chenghong Zhu, Xin Wang
Limitations of Classically-Simulable Measurements for Quantum State Discrimination Poster
2024.
Tags: Poster session Thursday
@Poster{P24_418,
title = {Limitations of Classically-Simulable Measurements for Quantum State Discrimination},
author = {Chengkai Zhu and Zhiping Liu and Chenghong Zhu and Xin Wang},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
112.
Yuxuan Yan, Zhenyu Du, Junjie Chen, Xiongfeng Ma
Limitations of Noisy Quantum Devices in Computing and Entangling Power Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_483,
title = {Limitations of Noisy Quantum Devices in Computing and Entangling Power},
author = {Yuxuan Yan and Zhenyu Du and Junjie Chen and Xiongfeng Ma},
url = {https://arxiv.org/abs/2306.02836},
year = {2024},
date = {2024-01-01},
abstract = {Finding solid and practical quantum advantages via noisy quantum devices without error correction is a critical but challenging problem. Conversely, comprehending the fundamental limitations of the state-of-the-art is equally crucial. In this work, we observe the polynomial-time indistinguishability of n-qubit devices from random coins when circuit depths exceed omega(log(n)) under single-qubit depolarizing noise. Even with classical processing, we can demonstrate the absence of computational advantage in polynomial-time algorithms with noisy quantum circuits of super-logarithmic depths. This finding decisively negates the feasibility of executing prominent quantum algorithms such as Shor's, Grover's, and the Harrow-Hassidim-Lloyd algorithm. In addition, our results apply to variational quantum algorithms, error mitigation, and quantum simulation with polynomial depths. Furthermore, we consider noisy quantum devices with restraint gate topology. We rule out super-polynomial quantum advantages for a one-dimensional noisy qubit array in all-depth regimes. We also establish upper limits on entanglement generation: O(log(n)) for one-dimensional arrays and O(sqrt(n) log(n)) for two-dimensional arrays. Our findings underscore the entanglement scalability constraints in noisy quantum devices.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Finding solid and practical quantum advantages via noisy quantum devices without error correction is a critical but challenging problem. Conversely, comprehending the fundamental limitations of the state-of-the-art is equally crucial. In this work, we observe the polynomial-time indistinguishability of n-qubit devices from random coins when circuit depths exceed omega(log(n)) under single-qubit depolarizing noise. Even with classical processing, we can demonstrate the absence of computational advantage in polynomial-time algorithms with noisy quantum circuits of super-logarithmic depths. This finding decisively negates the feasibility of executing prominent quantum algorithms such as Shor's, Grover's, and the Harrow-Hassidim-Lloyd algorithm. In addition, our results apply to variational quantum algorithms, error mitigation, and quantum simulation with polynomial depths. Furthermore, we consider noisy quantum devices with restraint gate topology. We rule out super-polynomial quantum advantages for a one-dimensional noisy qubit array in all-depth regimes. We also establish upper limits on entanglement generation: O(log(n)) for one-dimensional arrays and O(sqrt(n) log(n)) for two-dimensional arrays. Our findings underscore the entanglement scalability constraints in noisy quantum devices.
113.
Luke Coffman, Akshay Seshadri, Graeme Smith, Jacob Beckey
Local measurement strategies for multipartite entanglement quantification Poster
2024.
Tags: Poster session Thursday
@Poster{P24_406,
title = {Local measurement strategies for multipartite entanglement quantification},
author = {Luke Coffman and Akshay Seshadri and Graeme Smith and Jacob Beckey},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
114.
Quinten Tupker
Loop Null Homology is Complete for slightly more than NQL Poster
2024.
Tags: Poster session Thursday
@Poster{P24_378,
title = {Loop Null Homology is Complete for slightly more than NQL},
author = {Quinten Tupker},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
115.
Vivien Vandaele
Lower T-count with faster algorithms Poster
2024.
Tags: Poster session Thursday
@Poster{P24_424,
title = {Lower T-count with faster algorithms},
author = {Vivien Vandaele},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
116.
Angelos Bampounis, Rui Soares Barbosa, Nadish Silva
Matchgate hierarchy: A Clifford-like hierarchy for matchgate circuits Poster
2024.
Tags: Poster session Thursday
@Poster{P24_414,
title = {Matchgate hierarchy: A Clifford-like hierarchy for matchgate circuits},
author = {Angelos Bampounis and Rui Soares Barbosa and Nadish Silva},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
117.
Shuyang Meng, Fionnuala Curran, Gabriel Senno, Victoria J. Wright, Máté Farkas, Valerio Scarani, Antonio Acín
Maximal intrinsic randomness of a quantum state Poster
2024.
Tags: Poster session Thursday
@Poster{P24_292,
title = {Maximal intrinsic randomness of a quantum state},
author = {Shuyang Meng and Fionnuala Curran and Gabriel Senno and Victoria J. Wright and Máté Farkas and Valerio Scarani and Antonio Acín},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
118.
Hendrik Poulsen Nautrup, Hans J. Briegel
Measurement-based Quantum Computation from Clifford Quantum Cellular Automata Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_341,
title = {Measurement-based Quantum Computation from Clifford Quantum Cellular Automata},
author = {Hendrik Poulsen Nautrup and Hans J. Briegel},
url = {https://arxiv.org/abs/2310.13524 https://arxiv.org/abs/2312.13185},
year = {2024},
date = {2024-01-01},
abstract = {In this talk we explore measurement-based quantum computation (MBQC) for quantum machine learning. To this end, we show that unitary MBQC on a regular lattice with measurements in the XY-basis is equivalent to a circuit model quantum computation based on Clifford quantum cellulare automata. While this model of quantum computation is ideally suited as a Hardware-efficient Ansatz for certain quantum computation architectures such as neutral atoms, there remains sufficient flexibility to use it as a problem specific Ansatz for variational quantum circuits. We further explore non-unitary MBQC as a variational Ansatz for generative modelling which makes explicit use of the non-unitary nature of measurements. We find that this quantum channel ansatz for generative modelling outperforms the corresponding unitary ansatz both numerically and algebraically.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
In this talk we explore measurement-based quantum computation (MBQC) for quantum machine learning. To this end, we show that unitary MBQC on a regular lattice with measurements in the XY-basis is equivalent to a circuit model quantum computation based on Clifford quantum cellulare automata. While this model of quantum computation is ideally suited as a Hardware-efficient Ansatz for certain quantum computation architectures such as neutral atoms, there remains sufficient flexibility to use it as a problem specific Ansatz for variational quantum circuits. We further explore non-unitary MBQC as a variational Ansatz for generative modelling which makes explicit use of the non-unitary nature of measurements. We find that this quantum channel ansatz for generative modelling outperforms the corresponding unitary ansatz both numerically and algebraically.
119.
Qingyue Zhang, Qing Liu, You Zhou
Minimal Clifford Shadow Estimation by Mutually Unbiased Bases Poster
2024.
Tags: Poster session Thursday
@Poster{P24_311,
title = {Minimal Clifford Shadow Estimation by Mutually Unbiased Bases},
author = {Qingyue Zhang and Qing Liu and You Zhou},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
120.
Jakub Czartowski, Karol Życzkowski, Daniel Braun
Minimal-noise estimation of noncommuting rotations of a spin Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_536,
title = {Minimal-noise estimation of noncommuting rotations of a spin},
author = {Jakub Czartowski and Karol Życzkowski and Daniel Braun},
url = {https://quantum-journal.org/papers/q-2024-05-08-1341/},
year = {2024},
date = {2024-01-01},
abstract = {We introduce a novel approach inspired by SU(1,1) interferometry to measure spin rotation using two-spin squeezed states, employing a squeeze-rotate-unsqueeze protocol. We demonstrate the achievability of the Heisenberg limit for estimating rotation angles, particularly with maximal and half-maximal squeezing. Notably, we showcase enhanced sensitivity for all equatorial rotation axes compared to classical methods, owing to a specific squeezing direction and strength. This advantage is evidenced by the quadratic scaling of the single-parameter quantum Fisher information for corresponding rotation angles, highlighting the potential for improved precision in estimation of non-commuting rotations. Our findings provide a novel method for measuring magnetic fields in any direction within the x-y-plane using a single optimized initial state.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
We introduce a novel approach inspired by SU(1,1) interferometry to measure spin rotation using two-spin squeezed states, employing a squeeze-rotate-unsqueeze protocol. We demonstrate the achievability of the Heisenberg limit for estimating rotation angles, particularly with maximal and half-maximal squeezing. Notably, we showcase enhanced sensitivity for all equatorial rotation axes compared to classical methods, owing to a specific squeezing direction and strength. This advantage is evidenced by the quadratic scaling of the single-parameter quantum Fisher information for corresponding rotation angles, highlighting the potential for improved precision in estimation of non-commuting rotations. Our findings provide a novel method for measuring magnetic fields in any direction within the x-y-plane using a single optimized initial state.
121.
Sahil Gopalkrishna Naik, Samrat Sen, Ramkrishna Patra, Mir Alimuddin, Manik Banik, Ananya Chakraborty, Pratik Ghoshal
Multiparty Local Bit Hiding: Non-Causal Advantage and Super-Activation of Causal Indefiniteness Poster
2024.
Tags: Poster session Thursday
@Poster{P24_551,
title = {Multiparty Local Bit Hiding: Non-Causal Advantage and Super-Activation of Causal Indefiniteness},
author = {Sahil Gopalkrishna Naik and Samrat Sen and Ramkrishna Patra and Mir Alimuddin and Manik Banik and Ananya Chakraborty and Pratik Ghoshal},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
122.
Aron Rozgonyi, Gábor Széchenyi, Tamás Kiss, Orsolya Kalman
N-qubit GHZ state distillation via alternating local operations Poster
2024.
Tags: Poster session Thursday
@Poster{P24_533,
title = {N-qubit GHZ state distillation via alternating local operations},
author = {Aron Rozgonyi and Gábor Széchenyi and Tamás Kiss and Orsolya Kalman},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
123.
Kenneth Goodenough, Sebastian Bone, Vaishnavi Addala, Stefan Krastanov, Sarah Jansen, Dion Gijswijt, David Elkouss
Near-term n to k distillation protocols using graph codes Poster
2024.
Tags: Poster session Thursday
@Poster{P24_502,
title = {Near-term n to k distillation protocols using graph codes},
author = {Kenneth Goodenough and Sebastian Bone and Vaishnavi Addala and Stefan Krastanov and Sarah Jansen and Dion Gijswijt and David Elkouss},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
124.
Emilio Onorati, Jonas Kitzinger, Jonas Helsen, Marios Ioannou, Albert H. Werner, Ingo Roth, Jens Eisert
Noise-mitigated randomized measurements Poster
2024.
Tags: Poster session Thursday
@Poster{P24_337,
title = {Noise-mitigated randomized measurements},
author = {Emilio Onorati and Jonas Kitzinger and Jonas Helsen and Marios Ioannou and Albert H. Werner and Ingo Roth and Jens Eisert},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
125.
Marco Fellous Asiani, Moein Naseri, Chandan Datta, Alexander Streltsov, Michał Oszmaniec
Noise-resilient quantum circuits for qubits admitting a noise bias Poster
2024.
Tags: Poster session Thursday
@Poster{P24_361,
title = {Noise-resilient quantum circuits for qubits admitting a noise bias},
author = {Marco Fellous Asiani and Moein Naseri and Chandan Datta and Alexander Streltsov and Michał Oszmaniec},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
126.
Sadra Boreiri, Bora Ulu, Pavel Sekatski, Nicolas Brunner
Noise-robust proofs of quantum network nonlocality Poster
2024.
Tags: Poster session Thursday
@Poster{P24_352,
title = {Noise-robust proofs of quantum network nonlocality},
author = {Sadra Boreiri and Bora Ulu and Pavel Sekatski and Nicolas Brunner},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
127.
Liubov Markovich, Justus Urbanetz, Vladimir Man'Ko
Not all Probability Density Functions are Tomograms Poster
2024.
Tags: Poster session Thursday
@Poster{P24_306,
title = {Not all Probability Density Functions are Tomograms},
author = {Liubov Markovich and Justus Urbanetz and Vladimir Man'Ko},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
128.
Seiseki Akibue, Yuki Takeuchi, Akihito Mizutani
Numerical studies on quantum state verification with single-qubit measurements Poster
2024.
Abstract | Tags: Poster session Thursday
@Poster{P24_528,
title = {Numerical studies on quantum state verification with single-qubit measurements},
author = {Seiseki Akibue and Yuki Takeuchi and Akihito Mizutani},
year = {2024},
date = {2024-01-01},
abstract = {We propose a quantum state verification protocol using single-qubit Pauli measurements. As a main result, we numerically demonstrate that our protocol can verify several classes of $N(łeq 5)$-qubit pure states, including randomly sampled pure states with $cN$ number of samples with a constant $c$. In contrast, the best-known verification protocol using single-qubit Pauli measurements that can verify an arbitrary entangled state, called the direct fidelity estimation, requires $O(2^N)$ number of samples. Our results not only support a very recent result proven by Huang et al. but also suggest that their verification protocol could be improved in terms of sample complexity.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
We propose a quantum state verification protocol using single-qubit Pauli measurements. As a main result, we numerically demonstrate that our protocol can verify several classes of $N(łeq 5)$-qubit pure states, including randomly sampled pure states with $cN$ number of samples with a constant $c$. In contrast, the best-known verification protocol using single-qubit Pauli measurements that can verify an arbitrary entangled state, called the direct fidelity estimation, requires $O(2^N)$ number of samples. Our results not only support a very recent result proven by Huang et al. but also suggest that their verification protocol could be improved in terms of sample complexity.
129.
Grégoire Gliniasty, Rawad Mezher, Damian Markham
On fault-tolerant constant depth computations: generalisations and applications Poster
2024.
Tags: Poster session Thursday
@Poster{P24_347,
title = {On fault-tolerant constant depth computations: generalisations and applications},
author = {Grégoire Gliniasty and Rawad Mezher and Damian Markham},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
130.
Lennart Bittel, Sevag Gharibian, Martin Kliesch
On the computational complexity of equilibrating quantum systems Poster
2024.
Abstract | Tags: Outstanding Poster, Poster session Thursday
@Poster{P24_363,
title = {On the computational complexity of equilibrating quantum systems},
author = {Lennart Bittel and Sevag Gharibian and Martin Kliesch},
year = {2024},
date = {2024-01-01},
abstract = {Understanding equilibration behavior of closed systems is an important but difficult problem.
Intuitively, after some equilibration time, many-body systems typically transition to a steady state, in which expectation values become stationary.
Sometimes, after long evolution times, however, a system can exit an equilibrium state again.
Thus, it is natural to ask (i) for how long is an expectation value of a time-evolved observable <O(t)> equilibrated and (ii) what are the extremal values of <O(t)>. For simple observables and states under k-local Hamiltonian dynamics we show that the associated computational problems are (i) coNEXP-complete and (ii) NEXP-complete to answer for time scales given in scientific notation.
Thus, no classical polynomial-time algorithm exist for these problems (unconditionally). Hence, understanding equilibration behavior of closed systems can be computationally intractable.
We then show a similar result for estimating the ansatz error for a VQA setup, in which one can potentially reuse gate generators an arbitary number of times.
Hence, we provide arguably rare examples of physically motivated NEXP-complete problems. Finally, we also derive upper bounds for the question of equilibration over all time. Here we show that the computational problem is contained in a subclass of EXPSPACE i.e. solvable in exponential space, but potentially double-exponential time.},
keywords = {Outstanding Poster, Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Understanding equilibration behavior of closed systems is an important but difficult problem.
Intuitively, after some equilibration time, many-body systems typically transition to a steady state, in which expectation values become stationary.
Sometimes, after long evolution times, however, a system can exit an equilibrium state again.
Thus, it is natural to ask (i) for how long is an expectation value of a time-evolved observable <O(t)> equilibrated and (ii) what are the extremal values of <O(t)>. For simple observables and states under k-local Hamiltonian dynamics we show that the associated computational problems are (i) coNEXP-complete and (ii) NEXP-complete to answer for time scales given in scientific notation.
Thus, no classical polynomial-time algorithm exist for these problems (unconditionally). Hence, understanding equilibration behavior of closed systems can be computationally intractable.
We then show a similar result for estimating the ansatz error for a VQA setup, in which one can potentially reuse gate generators an arbitary number of times.
Hence, we provide arguably rare examples of physically motivated NEXP-complete problems. Finally, we also derive upper bounds for the question of equilibration over all time. Here we show that the computational problem is contained in a subclass of EXPSPACE i.e. solvable in exponential space, but potentially double-exponential time.
Intuitively, after some equilibration time, many-body systems typically transition to a steady state, in which expectation values become stationary.
Sometimes, after long evolution times, however, a system can exit an equilibrium state again.
Thus, it is natural to ask (i) for how long is an expectation value of a time-evolved observable <O(t)> equilibrated and (ii) what are the extremal values of <O(t)>. For simple observables and states under k-local Hamiltonian dynamics we show that the associated computational problems are (i) coNEXP-complete and (ii) NEXP-complete to answer for time scales given in scientific notation.
Thus, no classical polynomial-time algorithm exist for these problems (unconditionally). Hence, understanding equilibration behavior of closed systems can be computationally intractable.
We then show a similar result for estimating the ansatz error for a VQA setup, in which one can potentially reuse gate generators an arbitary number of times.
Hence, we provide arguably rare examples of physically motivated NEXP-complete problems. Finally, we also derive upper bounds for the question of equilibration over all time. Here we show that the computational problem is contained in a subclass of EXPSPACE i.e. solvable in exponential space, but potentially double-exponential time.
131.
Tommaso Guaita
On the locality of fermion to qubit mappings Poster
2024.
Tags: Poster session Thursday
@Poster{P24_324,
title = {On the locality of fermion to qubit mappings},
author = {Tommaso Guaita},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
132.
Kishor Bharti, Rahul Jain
On the power of geometrically-local classical and quantum circuits Poster
2024.
Tags: Poster session Thursday
@Poster{P24_454,
title = {On the power of geometrically-local classical and quantum circuits},
author = {Kishor Bharti and Rahul Jain},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
133.
Vjosa Blakaj, Michael Wolf
On the set of reduced states of translation invariant, infinite quantum systems Poster
2024.
Tags: Poster session Thursday
@Poster{P24_375,
title = {On the set of reduced states of translation invariant, infinite quantum systems},
author = {Vjosa Blakaj and Michael Wolf},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
134.
Andreas Bluhm, Leevi Leppäjärvi, Ion Nechita
On the simulation of quantum multimeters Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_318,
title = {On the simulation of quantum multimeters},
author = {Andreas Bluhm and Leevi Leppäjärvi and Ion Nechita},
url = {https://arxiv.org/abs/2402.18333},
year = {2024},
date = {2024-01-01},
abstract = {In the quest for robust and universal quantum devices, the notion of simulation plays a crucial role, both from a theoretical and from an applied perspective. In this work, we go beyond the simulation of quantum channels and quantum measurements, studying what it means to simulate a collection of measurements, which we call a multimeter. To this end, we first explicitly characterize the completely positive transformation between multimeters. However, not all of these transformations between multimeters correspond to valid simulations, as evidenced by the existence of maps that always prepare the same multimeter regardless of the input, which we call trash-and-prepare. We give a new definition of multimeter simulations as transformations that are triviality-preserving, i.e., when given a multimeter consisting of trivial measurements they can only produce another trivial multimeter. In the absence of a quantum ancilla, we then characterize the transformations that are triviality-preserving and the transformations that are trash-and-prepare. Finally, we use these characterizations to compare our new definition of multimeter simulation to three existing ones: classical simulations, compression of multimeters, and compatibility-preserving simulations.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
In the quest for robust and universal quantum devices, the notion of simulation plays a crucial role, both from a theoretical and from an applied perspective. In this work, we go beyond the simulation of quantum channels and quantum measurements, studying what it means to simulate a collection of measurements, which we call a multimeter. To this end, we first explicitly characterize the completely positive transformation between multimeters. However, not all of these transformations between multimeters correspond to valid simulations, as evidenced by the existence of maps that always prepare the same multimeter regardless of the input, which we call trash-and-prepare. We give a new definition of multimeter simulations as transformations that are triviality-preserving, i.e., when given a multimeter consisting of trivial measurements they can only produce another trivial multimeter. In the absence of a quantum ancilla, we then characterize the transformations that are triviality-preserving and the transformations that are trash-and-prepare. Finally, we use these characterizations to compare our new definition of multimeter simulation to three existing ones: classical simulations, compression of multimeters, and compatibility-preserving simulations.
135.
Sayantan Chakraborty, Rahul Jain, Pranab Sen
One-Shot Non-Catalytic Distributed Purity Distillation Poster
2024.
Tags: Poster session Thursday
@Poster{P24_440,
title = {One-Shot Non-Catalytic Distributed Purity Distillation},
author = {Sayantan Chakraborty and Rahul Jain and Pranab Sen},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
136.
Zhaokai Li
Optimal and robust experiment design for quantum state tomography of star-topology register Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_465,
title = {Optimal and robust experiment design for quantum state tomography of star-topology register},
author = {Zhaokai Li},
url = {https://arxiv.org/abs/2206.08581},
year = {2024},
date = {2024-01-01},
abstract = {While quantum state tomography plays a vital role in the verification and benchmarking of quantum systems, it is an intractable task if the controllability of the quantum registers are constrained. In this paper, we propose a novel scheme for optimal and robust quantum state tomography for systems with constrained controllability. Based on the specific symmetry, we decompose the Hilbert space to alleviate the complexity of tomography and design a compact strategy with the minimum number of measurements. To switch between these measurement settings, we adopted parameterized quantum circuits consisting of local operations and free evolution, which are easy to implement in most practical systems. Then the parameters of these circuits were optimized to improve the robustness against random errors of measurements. Furthermore, we apply this method to a 10-spin star-topology register and demonstrate its ability to characterize large-scale systems. Our results can help future investigations of quantum systems with constrained ability of quantum control and measurement},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
While quantum state tomography plays a vital role in the verification and benchmarking of quantum systems, it is an intractable task if the controllability of the quantum registers are constrained. In this paper, we propose a novel scheme for optimal and robust quantum state tomography for systems with constrained controllability. Based on the specific symmetry, we decompose the Hilbert space to alleviate the complexity of tomography and design a compact strategy with the minimum number of measurements. To switch between these measurement settings, we adopted parameterized quantum circuits consisting of local operations and free evolution, which are easy to implement in most practical systems. Then the parameters of these circuits were optimized to improve the robustness against random errors of measurements. Furthermore, we apply this method to a 10-spin star-topology register and demonstrate its ability to characterize large-scale systems. Our results can help future investigations of quantum systems with constrained ability of quantum control and measurement
137.
Yuan Liu, Ravishankar Ramanathan, Karol Horodecki, Monika Rosicka, Paweł Horodecki
Optimal Measurement Structures for Contextuality Applications Poster
2024.
Tags: Poster session Thursday
@Poster{P24_339,
title = {Optimal Measurement Structures for Contextuality Applications},
author = {Yuan Liu and Ravishankar Ramanathan and Karol Horodecki and Monika Rosicka and Paweł Horodecki},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
138.
Dario De Santis, Salvatore Tirone, Stefano Marmi, Vittorio Giovannetti
Optimized QUBO formulation methods for quantum computing Poster
2024.
Tags: Poster session Thursday
@Poster{P24_485,
title = {Optimized QUBO formulation methods for quantum computing},
author = {Dario De Santis and Salvatore Tirone and Stefano Marmi and Vittorio Giovannetti},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
139.
Lennart Bittel, Antonio Anna Mele, Jens Eisert, Lorenzo Leone
PAC-Learning of Free-Fermionic States is NP-Hard Poster
2024.
Tags: Poster session Thursday
@Poster{P24_329,
title = {PAC-Learning of Free-Fermionic States is NP-Hard},
author = {Lennart Bittel and Antonio Anna Mele and Jens Eisert and Lorenzo Leone},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
140.
Shivani Singh, Craig Hamilton, Igor Jex
Phase estimation in driven discrete-time quantum walks Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_525,
title = {Phase estimation in driven discrete-time quantum walks},
author = {Shivani Singh and Craig Hamilton and Igor Jex},
url = {https://doi.org/10.1103/PhysRevA.108.042607},
year = {2024},
date = {2024-01-01},
abstract = {Quantum walks have been shown to be important for quantum metrological tasks, in particular for the estimation of the evolution parameters of the walk. In this work, we address the enhancement of this parameter estimation using the driven discrete-time quantum walk (DDTQW), which is a variant of the discrete-time quantum walk with multiple walkers. DDTQW has two regimes based on the interference between the walker number, i.e., phase matched and phase mismatched. We derive an expression for the quantum Fisher information (QFI) in the phase-matched regime of DDTQW driven using the squeezing operator, demonstrating an exponential increase in QFI. In the phase-mismatched regime, QFI varies as 𝑡^2, consistent with previous studies. Our analysis shows that parameter estimation can be improved by driving the walk using squeezing operators.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Quantum walks have been shown to be important for quantum metrological tasks, in particular for the estimation of the evolution parameters of the walk. In this work, we address the enhancement of this parameter estimation using the driven discrete-time quantum walk (DDTQW), which is a variant of the discrete-time quantum walk with multiple walkers. DDTQW has two regimes based on the interference between the walker number, i.e., phase matched and phase mismatched. We derive an expression for the quantum Fisher information (QFI) in the phase-matched regime of DDTQW driven using the squeezing operator, demonstrating an exponential increase in QFI. In the phase-mismatched regime, QFI varies as 𝑡^2, consistent with previous studies. Our analysis shows that parameter estimation can be improved by driving the walk using squeezing operators.
141.
Garazi Muguruza, Florian Speelman
Port-Based State Preparation and Applications Poster
2024.
Tags: Poster session Thursday
@Poster{P24_308,
title = {Port-Based State Preparation and Applications},
author = {Garazi Muguruza and Florian Speelman},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
142.
Yichi Zhang, Siyuan Jin, Yuhan Huang, Bei Zeng, Qiming Shao
Post-Quantum Security and Privacy via Cloud: A Practical Quantum Digital Token Protocol Poster
2024.
Abstract | Tags: Poster session Thursday
@Poster{P24_510,
title = {Post-Quantum Security and Privacy via Cloud: A Practical Quantum Digital Token Protocol},
author = {Yichi Zhang and Siyuan Jin and Yuhan Huang and Bei Zeng and Qiming Shao},
year = {2024},
date = {2024-01-01},
abstract = {Digital tokens are pivotal in the burgeoning tokenized economy. This paper looks at the post-quantum security and privacy of digital tokens, with particular emphasis on how quantum tokens can be implemented. Quantum token leverages quantum states for information storage. Traditional proposals often unrealistically assume personal quantum computing access for each user. To overcome this, we introduce a novel cloud-based quantum token protocol, employing a two-layer quantum homomorphic encryption method. This enables classical entities to securely outsource quantum computations to third-party quantum cloud services via classical communication channels. Our approach significantly reduces the quantum resource demands on users and facilitates seamless integration with current classical systems. We present a simulation of our experiment and a quantitative analysis of the cloud's quantum resource needs. Our work offers a strategic blueprint for organizations to adopt a quantum version of digital tokens within their classical frameworks with enhanced security and functionality.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Digital tokens are pivotal in the burgeoning tokenized economy. This paper looks at the post-quantum security and privacy of digital tokens, with particular emphasis on how quantum tokens can be implemented. Quantum token leverages quantum states for information storage. Traditional proposals often unrealistically assume personal quantum computing access for each user. To overcome this, we introduce a novel cloud-based quantum token protocol, employing a two-layer quantum homomorphic encryption method. This enables classical entities to securely outsource quantum computations to third-party quantum cloud services via classical communication channels. Our approach significantly reduces the quantum resource demands on users and facilitates seamless integration with current classical systems. We present a simulation of our experiment and a quantitative analysis of the cloud's quantum resource needs. Our work offers a strategic blueprint for organizations to adopt a quantum version of digital tokens within their classical frameworks with enhanced security and functionality.
143.
Xuanqiang Zhao, Lei Zhang, Benchi Zhao, Xin Wang
Power of quantum measurement in simulating unphysical operations Poster
2024.
Tags: Poster session Thursday
@Poster{P24_453,
title = {Power of quantum measurement in simulating unphysical operations},
author = {Xuanqiang Zhao and Lei Zhang and Benchi Zhao and Xin Wang},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
144.
Arkopal Dutt, Sho Sugiura, William Munro, Sina Zeytinoglu, Isaac Chuang
Power of sequential protocols in hidden quantum channel discrimination Poster
2024.
Tags: Poster session Thursday
@Poster{P24_433,
title = {Power of sequential protocols in hidden quantum channel discrimination},
author = {Arkopal Dutt and Sho Sugiura and William Munro and Sina Zeytinoglu and Isaac Chuang},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
145.
Zhenhuan Liu, Hong-Ye Hu
Predicting Arbitrary State Properties from Single Hamiltonian Quench Dynamics Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_404,
title = {Predicting Arbitrary State Properties from Single Hamiltonian Quench Dynamics},
author = {Zhenhuan Liu and Hong-Ye Hu},
url = {https://arxiv.org/abs/2311.00695},
year = {2024},
date = {2024-01-01},
abstract = {Analog quantum simulation is an important routine for quantum computing and plays a crucial role in studying quantum many-body physics.
Typically, the quantum evolution of an analog simulator is largely determined by its physical characteristics, lacking the precise control or versatility of quantum gates. This limitation poses challenges in measuring specific observables on analog quantum simulators, which is the final step of all quantum information processing tasks.
To address this issue, we introduce the Hamiltonian shadow protocol. This method uses a single quench Hamiltonian for estimating arbitrary state properties, eliminating the need for ancillary systems.
We provide physical intuitions and theoretical guarantees for our protocol. Additionally, we derive the sample complexity of this protocol and show that it performs comparably to the classical shadow protocol. The Hamiltonian shadow protocol does not require sophisticated control and can be applied to a wide range of analog quantum simulators. We demonstrate its utility through numerical demonstrations with Rydberg atom arrays under realistic parameter settings. The new protocol significantly broadens the application of randomized measurements for analog quantum simulators without precise control and ancillary systems.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Analog quantum simulation is an important routine for quantum computing and plays a crucial role in studying quantum many-body physics.
Typically, the quantum evolution of an analog simulator is largely determined by its physical characteristics, lacking the precise control or versatility of quantum gates. This limitation poses challenges in measuring specific observables on analog quantum simulators, which is the final step of all quantum information processing tasks.
To address this issue, we introduce the Hamiltonian shadow protocol. This method uses a single quench Hamiltonian for estimating arbitrary state properties, eliminating the need for ancillary systems.
We provide physical intuitions and theoretical guarantees for our protocol. Additionally, we derive the sample complexity of this protocol and show that it performs comparably to the classical shadow protocol. The Hamiltonian shadow protocol does not require sophisticated control and can be applied to a wide range of analog quantum simulators. We demonstrate its utility through numerical demonstrations with Rydberg atom arrays under realistic parameter settings. The new protocol significantly broadens the application of randomized measurements for analog quantum simulators without precise control and ancillary systems.
Typically, the quantum evolution of an analog simulator is largely determined by its physical characteristics, lacking the precise control or versatility of quantum gates. This limitation poses challenges in measuring specific observables on analog quantum simulators, which is the final step of all quantum information processing tasks.
To address this issue, we introduce the Hamiltonian shadow protocol. This method uses a single quench Hamiltonian for estimating arbitrary state properties, eliminating the need for ancillary systems.
We provide physical intuitions and theoretical guarantees for our protocol. Additionally, we derive the sample complexity of this protocol and show that it performs comparably to the classical shadow protocol. The Hamiltonian shadow protocol does not require sophisticated control and can be applied to a wide range of analog quantum simulators. We demonstrate its utility through numerical demonstrations with Rydberg atom arrays under realistic parameter settings. The new protocol significantly broadens the application of randomized measurements for analog quantum simulators without precise control and ancillary systems.
146.
Marc Wanner, Laura Lewis, Chiranjib Bhattacharyya, Devdatt Dubhashi, Alexandru Gheorghiu
Predicting Ground State Properties: Constant Sample Complexity and Deep Learning Algorithms Poster
2024.
Abstract | Tags: Outstanding Poster, Poster session Thursday | Links:
@Poster{P24_331,
title = {Predicting Ground State Properties: Constant Sample Complexity and Deep Learning Algorithms},
author = {Marc Wanner and Laura Lewis and Chiranjib Bhattacharyya and Devdatt Dubhashi and Alexandru Gheorghiu},
url = {https://arxiv.org/abs/2405.18489},
year = {2024},
date = {2024-01-01},
abstract = {A fundamental problem in quantum many-body physics is that of finding ground states of local Hamiltonians. A number of recent works gave provably efficient machine learning (ML) algorithms for learning ground states. Specifically, [1], introduced an approach for learning properties of the ground state of an n-qubit gapped local Hamiltonian H from data points sampled from Hamiltonians in the same phase of matter polynomial in n. This was subsequently improved by [2], to logarithmic number of samples with respect to system size when the geometry of the n-qubit system is known. In this work, we introduce two approaches that achieve a constant sample complexity, independent of system size, for learning ground state properties. Our first algorithm consists of a simple modification of the ML model used by Lewis et al. and applies to a property of interest known beforehand. Our second algorithm, which applies even if a description of the property is not known, is a deep neural network model. While empirical results showing the performance of neural networks have been demonstrated, to our knowledge, this is the first rigorous sample complexity bound on a neural network model for predicting ground state properties. We also perform numerical experiments that confirm the improved scaling of our approach compared to earlier results.
References: Hsin-Yuan Huang, Richard Kueng, Giacomo Torlai, Victor V Albert, and John Preskill. Provably efficient machine learning for quantum many-body problems. Science, 377(6613):eabk3333, 2022. [2] Laura Lewis, Hsin-Yuan Huang, Viet T Tran, Sebastian Lehner, Richard Kueng, and John Preskill. Improved machine learning algorithm for predicting ground state properties. Nature Communications, 15(1):895, 2024.},
keywords = {Outstanding Poster, Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
A fundamental problem in quantum many-body physics is that of finding ground states of local Hamiltonians. A number of recent works gave provably efficient machine learning (ML) algorithms for learning ground states. Specifically, [1], introduced an approach for learning properties of the ground state of an n-qubit gapped local Hamiltonian H from data points sampled from Hamiltonians in the same phase of matter polynomial in n. This was subsequently improved by [2], to logarithmic number of samples with respect to system size when the geometry of the n-qubit system is known. In this work, we introduce two approaches that achieve a constant sample complexity, independent of system size, for learning ground state properties. Our first algorithm consists of a simple modification of the ML model used by Lewis et al. and applies to a property of interest known beforehand. Our second algorithm, which applies even if a description of the property is not known, is a deep neural network model. While empirical results showing the performance of neural networks have been demonstrated, to our knowledge, this is the first rigorous sample complexity bound on a neural network model for predicting ground state properties. We also perform numerical experiments that confirm the improved scaling of our approach compared to earlier results.
References: Hsin-Yuan Huang, Richard Kueng, Giacomo Torlai, Victor V Albert, and John Preskill. Provably efficient machine learning for quantum many-body problems. Science, 377(6613):eabk3333, 2022. [2] Laura Lewis, Hsin-Yuan Huang, Viet T Tran, Sebastian Lehner, Richard Kueng, and John Preskill. Improved machine learning algorithm for predicting ground state properties. Nature Communications, 15(1):895, 2024.
References: Hsin-Yuan Huang, Richard Kueng, Giacomo Torlai, Victor V Albert, and John Preskill. Provably efficient machine learning for quantum many-body problems. Science, 377(6613):eabk3333, 2022. [2] Laura Lewis, Hsin-Yuan Huang, Viet T Tran, Sebastian Lehner, Richard Kueng, and John Preskill. Improved machine learning algorithm for predicting ground state properties. Nature Communications, 15(1):895, 2024.
147.
Silvia Onofri, Vittorio Giovannetti
Probabilistic versions of Quantum Private Queries Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_548,
title = {Probabilistic versions of Quantum Private Queries},
author = {Silvia Onofri and Vittorio Giovannetti},
url = {https://arxiv.org/abs/2401.05754},
year = {2024},
date = {2024-01-01},
abstract = {The no-go theorem regarding unconditionally secure Quantum Bit Commitment protocols is a relevant result in quantum cryptography. Such result has been used to prove the impossibility of unconditional security for other protocols, such as Quantum Oblivious Transfer or One-Sided Two Party Computation. In this paper, we formally define two non-deterministic versions of Quantum Private Queries, a protocol addressing the Symmetric-Private Information Retrieval problem. We show that the strongest variant of such scheme is formally equivalent to Quantum Bit Commitment, Quantum Oblivious Transfer and One-Sided Two Party Computation protocols. This equivalence serves as conclusive evidence of the impracticality of achieving unconditionally secure Strong Probabilistic Quantum Private Queries.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
The no-go theorem regarding unconditionally secure Quantum Bit Commitment protocols is a relevant result in quantum cryptography. Such result has been used to prove the impossibility of unconditional security for other protocols, such as Quantum Oblivious Transfer or One-Sided Two Party Computation. In this paper, we formally define two non-deterministic versions of Quantum Private Queries, a protocol addressing the Symmetric-Private Information Retrieval problem. We show that the strongest variant of such scheme is formally equivalent to Quantum Bit Commitment, Quantum Oblivious Transfer and One-Sided Two Party Computation protocols. This equivalence serves as conclusive evidence of the impracticality of achieving unconditionally secure Strong Probabilistic Quantum Private Queries.
148.
Bence Bakó, Dániel Nagy, Zoltán Zimborás
Problem-informed Graphical Quantum Generative Learning Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_457,
title = {Problem-informed Graphical Quantum Generative Learning},
author = {Bence Bakó and Dániel Nagy and Zoltán Zimborás},
url = {https://arxiv.org/abs/2405.14072},
year = {2024},
date = {2024-01-01},
abstract = {Leveraging the intrinsic probabilistic nature of quantum systems, generative quantum machine learning (QML) offers the potential to outperform classical learning models. Current generative QML algorithms mostly rely on general-purpose models that, while being very expressive, face several training challenges. A potential way to address these setbacks involves constructing problem-informed models capable of more efficient training on structured problems. In particular, probabilistic graphical models provide a flexible framework for representing structure in generative learning problems and can thus be exploited to incorporate inductive bias in QML algorithms. In this work, we propose a problem-informed quantum circuit Born machine Ansatz for learning the joint probability distribution of random variables, with independence relations efficiently represented by a Markov network (MN). We further demonstrate the applicability of the MN framework in constructing generative learning benchmarks and compare our model's performance to previous designs, showing it outperforms problem-agnostic circuits. Based on a preliminary analysis of trainability, we narrow down the class of MNs to those exhibiting favorable trainability properties. Finally, we discuss the potential of our model to offer quantum advantage in the context of generative learning.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Leveraging the intrinsic probabilistic nature of quantum systems, generative quantum machine learning (QML) offers the potential to outperform classical learning models. Current generative QML algorithms mostly rely on general-purpose models that, while being very expressive, face several training challenges. A potential way to address these setbacks involves constructing problem-informed models capable of more efficient training on structured problems. In particular, probabilistic graphical models provide a flexible framework for representing structure in generative learning problems and can thus be exploited to incorporate inductive bias in QML algorithms. In this work, we propose a problem-informed quantum circuit Born machine Ansatz for learning the joint probability distribution of random variables, with independence relations efficiently represented by a Markov network (MN). We further demonstrate the applicability of the MN framework in constructing generative learning benchmarks and compare our model's performance to previous designs, showing it outperforms problem-agnostic circuits. Based on a preliminary analysis of trainability, we narrow down the class of MNs to those exhibiting favorable trainability properties. Finally, we discuss the potential of our model to offer quantum advantage in the context of generative learning.
149.
Fernando Jeronimo, Nir Magrafta, Pei Wu
Pseudorandom and Pseudoentangled States from Subset States Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_482,
title = {Pseudorandom and Pseudoentangled States from Subset States},
author = {Fernando Jeronimo and Nir Magrafta and Pei Wu},
url = {https://arxiv.org/abs/2312.15285},
year = {2024},
date = {2024-01-01},
abstract = {Pseudorandom states (PRS) are an important primitive in quantum cryptography. In this paper, we show that emphsubset states can be used to construct PRSs. A subset state with respect to $S$, a subset of the computational basis, is
[
frac1sqrt|S|sum_iın S |irangle.
] As a technical centerpiece, we show that for any fixed subset size $|S|=s$ such that $s = 2^n/ømega(poly(n))$ and $s=ømega(poly(n))$, where $n$ is the number of qubits, a random subset state is information-theoretically indistinguishable from a Haar random state even provided with polynomially many copies.
This range of parameter is tight. Our work resolves a conjecture by Ji, Liu and Song.
Since subset states of small size have small entanglement across all cuts, this construction also illustrates a pseudoentanglement phenomenon.
Zhengfeng Ji, Yi-Kai Liu, and Fang Song. Pseudorandom quantum states. In Proceedings of the 38th Annual International Cryptology Conference (CRYPTO), pages 126–152. Springer, 2018.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Pseudorandom states (PRS) are an important primitive in quantum cryptography. In this paper, we show that emphsubset states can be used to construct PRSs. A subset state with respect to $S$, a subset of the computational basis, is
[
frac1sqrt|S|sum_iın S |irangle.
] As a technical centerpiece, we show that for any fixed subset size $|S|=s$ such that $s = 2^n/ømega(poly(n))$ and $s=ømega(poly(n))$, where $n$ is the number of qubits, a random subset state is information-theoretically indistinguishable from a Haar random state even provided with polynomially many copies.
This range of parameter is tight. Our work resolves a conjecture by Ji, Liu and Song.
Since subset states of small size have small entanglement across all cuts, this construction also illustrates a pseudoentanglement phenomenon.
Zhengfeng Ji, Yi-Kai Liu, and Fang Song. Pseudorandom quantum states. In Proceedings of the 38th Annual International Cryptology Conference (CRYPTO), pages 126–152. Springer, 2018.
[
frac1sqrt|S|sum_iın S |irangle.
] As a technical centerpiece, we show that for any fixed subset size $|S|=s$ such that $s = 2^n/ømega(poly(n))$ and $s=ømega(poly(n))$, where $n$ is the number of qubits, a random subset state is information-theoretically indistinguishable from a Haar random state even provided with polynomially many copies.
This range of parameter is tight. Our work resolves a conjecture by Ji, Liu and Song.
Since subset states of small size have small entanglement across all cuts, this construction also illustrates a pseudoentanglement phenomenon.
Zhengfeng Ji, Yi-Kai Liu, and Fang Song. Pseudorandom quantum states. In Proceedings of the 38th Annual International Cryptology Conference (CRYPTO), pages 126–152. Springer, 2018.
150.
Shiv Akshar Yadavalli, Nikola Andrejić, Ravi Kunjwal
Qualitative equivalence between incompatibility and Bell nonlocality Poster
2024.
Tags: Poster session Thursday
@Poster{P24_321,
title = {Qualitative equivalence between incompatibility and Bell nonlocality},
author = {Shiv Akshar Yadavalli and Nikola Andrejić and Ravi Kunjwal},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
151.
Xuanran Zhu, Chao Zhang, Bei Zeng
Quantifying Subspace Entanglement with Geometric Measures Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_479,
title = {Quantifying Subspace Entanglement with Geometric Measures},
author = {Xuanran Zhu and Chao Zhang and Bei Zeng},
url = {https://arxiv.org/abs/2311.10353},
year = {2024},
date = {2024-01-01},
abstract = {Determining whether a quantum subspace is entangled and quantifying its entanglement level remains a fundamental challenge in quantum information science. This paper introduces a geometric measure of $r$-bounded rank, $E_r(S)$, for a given subspace $S$. This measure, derived from the established geometric measure of entanglement, is tailored to assess the entanglement within $S$. It not only provides a benchmark for quantifying the entanglement level but also sheds light on the subspace's ability to preserve such entanglement. Utilizing non-convex optimization techniques from the domain of machine learning, we effectively calculate $E_r(S)$ textcolorredin the manifold optimization framework. Showcasing strong performance in comparison to existing hierarchical and PPT relaxation techniques, our approach is notable for its accuracy, computational efficiency, and wide-ranging applicability. This versatile and effective tool paves the way for numerous new applications in quantum information science. It is particularly useful in validating textcolorredhigh-dimensional entangled subspaces in bipartite systems, determining the border rank of multipartite states, and identifying genuinely or completely entangled subspaces. Our approach offers a fresh perspective for quantifying entanglement, while also shedding light on the intricate structure of quantum entanglement.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Determining whether a quantum subspace is entangled and quantifying its entanglement level remains a fundamental challenge in quantum information science. This paper introduces a geometric measure of $r$-bounded rank, $E_r(S)$, for a given subspace $S$. This measure, derived from the established geometric measure of entanglement, is tailored to assess the entanglement within $S$. It not only provides a benchmark for quantifying the entanglement level but also sheds light on the subspace's ability to preserve such entanglement. Utilizing non-convex optimization techniques from the domain of machine learning, we effectively calculate $E_r(S)$ textcolorredin the manifold optimization framework. Showcasing strong performance in comparison to existing hierarchical and PPT relaxation techniques, our approach is notable for its accuracy, computational efficiency, and wide-ranging applicability. This versatile and effective tool paves the way for numerous new applications in quantum information science. It is particularly useful in validating textcolorredhigh-dimensional entangled subspaces in bipartite systems, determining the border rank of multipartite states, and identifying genuinely or completely entangled subspaces. Our approach offers a fresh perspective for quantifying entanglement, while also shedding light on the intricate structure of quantum entanglement.
152.
Robert Salzmann
Quantitative Quantum Zeno and Strong Damping Limits in Strong Topology Poster
2024.
Abstract | Tags: Poster session Thursday
@Poster{P24_293,
title = {Quantitative Quantum Zeno and Strong Damping Limits in Strong Topology},
author = {Robert Salzmann},
year = {2024},
date = {2024-01-01},
abstract = {Frequent applications of a mixing quantum operation to a quantum system slow down its time evolution and eventually drive it into the invariant subspace of the named quantum operation. We prove this phenomenon, the quantum Zeno effect, and its continuous variant, strong damping, in a unified way for infinite-dimensional open quantum systems, while merely demanding that the respective mixing convergence holds pointwise for all states. Both results are quantitative in the following sense: Given a speed of convergence for the mixing limits, then we obtain bounds on the speed of convergence for the respective quantum Zeno and strong damping limits. We apply our results to prove quantum Zeno and strong damping limits for the photon loss channel with a bound on the convergence speed.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Frequent applications of a mixing quantum operation to a quantum system slow down its time evolution and eventually drive it into the invariant subspace of the named quantum operation. We prove this phenomenon, the quantum Zeno effect, and its continuous variant, strong damping, in a unified way for infinite-dimensional open quantum systems, while merely demanding that the respective mixing convergence holds pointwise for all states. Both results are quantitative in the following sense: Given a speed of convergence for the mixing limits, then we obtain bounds on the speed of convergence for the respective quantum Zeno and strong damping limits. We apply our results to prove quantum Zeno and strong damping limits for the photon loss channel with a bound on the convergence speed.
153.
Nishad Maskara, Stefan Ostermann, James Shee, Marcin Kalinowski, Abigail McClain Gomez, Rodrigo Araiza Bravo, Varun Menon, Christian Kokail, Hsin-Yuan Huang, Derek Wang, Anna Krylov, Norman Yao, Martin Head-Gordon, Mikhail Lukin, Susanne Yelin
Quantum algorithms for many-body spectroscopy using dynamics and classical shadows Poster
2024.
Tags: Outstanding Poster, Poster session Thursday
@Poster{P24_387,
title = {Quantum algorithms for many-body spectroscopy using dynamics and classical shadows},
author = {Nishad Maskara and Stefan Ostermann and James Shee and Marcin Kalinowski and Abigail McClain Gomez and Rodrigo Araiza Bravo and Varun Menon and Christian Kokail and Hsin-Yuan Huang and Derek Wang and Anna Krylov and Norman Yao and Martin Head-Gordon and Mikhail Lukin and Susanne Yelin},
year = {2024},
date = {2024-01-01},
keywords = {Outstanding Poster, Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
154.
Joshua Cudby, Sergii Strelchuk
Quantum Algorithms For String Problems Poster
2024.
Abstract | Tags: Poster session Thursday
@Poster{P24_508,
title = {Quantum Algorithms For String Problems},
author = {Joshua Cudby and Sergii Strelchuk},
year = {2024},
date = {2024-01-01},
abstract = {The problem of aligning two or more strings is fundamentally important for bioinformatic applications. Pairwise
alignments can reveal information about evolutionary or structural features of DNA sequences; moreover, some “biologically similar” protein sequences may
exhibit only weak sequence similarity, which can be overlooked by pairwise alignments, motivating the need for
multiple sequence alignment and comparison. We discuss Quantum Algorithms for the pairwise and multiple sequence alignment problems.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
The problem of aligning two or more strings is fundamentally important for bioinformatic applications. Pairwise
alignments can reveal information about evolutionary or structural features of DNA sequences; moreover, some “biologically similar” protein sequences may
exhibit only weak sequence similarity, which can be overlooked by pairwise alignments, motivating the need for
multiple sequence alignment and comparison. We discuss Quantum Algorithms for the pairwise and multiple sequence alignment problems.
alignments can reveal information about evolutionary or structural features of DNA sequences; moreover, some “biologically similar” protein sequences may
exhibit only weak sequence similarity, which can be overlooked by pairwise alignments, motivating the need for
multiple sequence alignment and comparison. We discuss Quantum Algorithms for the pairwise and multiple sequence alignment problems.
155.
Matilde Baroni, Quoc-Huy Vu, Boris Bourdoncle, Eleni Diamanti, Damian Markham, Ivan Šupić
Quantum bounds for compiled XOR games and d-outcome CHSH games Poster
2024.
Tags: Poster session Thursday
@Poster{P24_546,
title = {Quantum bounds for compiled XOR games and d-outcome CHSH games},
author = {Matilde Baroni and Quoc-Huy Vu and Boris Bourdoncle and Eleni Diamanti and Damian Markham and Ivan Šupić},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
156.
Orson Ye, Sergii Strelchuk
Quantum Circuit Complexity of Genomic Data Encoding Poster
2024.
Abstract | Tags: Poster session Thursday
@Poster{P24_563,
title = {Quantum Circuit Complexity of Genomic Data Encoding},
author = {Orson Ye and Sergii Strelchuk},
year = {2024},
date = {2024-01-01},
abstract = {Data encoding is a key step in almost all applications of quantum computation, but one that is not very well understood in general. While naive methods, such as basis encoding, will almost always work, they are extremely inefficient in terms qubit use, rendering them infeasible for near-term applications. We focus on data encoding for genomics, a deeply data-driven field with computationally intensive algorithms throughout, from the initial DNA sequencing to pangenome assembly and more. We review some standard approaches to data encoding in the context of genomics data from both the preparation complexity and usefulness perspectives. We also present some new data encoding methods designed specifically for genomics that have a low-depth preparation circuits while still maintaining the essential features the algorithms require.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Data encoding is a key step in almost all applications of quantum computation, but one that is not very well understood in general. While naive methods, such as basis encoding, will almost always work, they are extremely inefficient in terms qubit use, rendering them infeasible for near-term applications. We focus on data encoding for genomics, a deeply data-driven field with computationally intensive algorithms throughout, from the initial DNA sequencing to pangenome assembly and more. We review some standard approaches to data encoding in the context of genomics data from both the preparation complexity and usefulness perspectives. We also present some new data encoding methods designed specifically for genomics that have a low-depth preparation circuits while still maintaining the essential features the algorithms require.
157.
Adam Marks
Quantum Codes from Small High Dimensional Expanders Poster
2024.
Abstract | Tags: Poster session Thursday
@Poster{P24_527,
title = {Quantum Codes from Small High Dimensional Expanders},
author = {Adam Marks},
year = {2024},
date = {2024-01-01},
abstract = {We construct the smallest possible examples of CSS codes from high dimensional expanders and measure their length, rate and distance using a combination of theoretical and computational methods. We offer software to calculate Cartwright-Steger generators, Cayley complexes, mod two homology, systoles and cosystoles.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
We construct the smallest possible examples of CSS codes from high dimensional expanders and measure their length, rate and distance using a combination of theoretical and computational methods. We offer software to calculate Cartwright-Steger generators, Cayley complexes, mod two homology, systoles and cosystoles.
158.
Joonas Ilmavirta, Matti Lassas, Jinpeng Lu, Lauri Oksanen, Lauri Ylinen
Quantum computing algorithm for an inverse problem on graphs Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_340,
title = {Quantum computing algorithm for an inverse problem on graphs},
author = {Joonas Ilmavirta and Matti Lassas and Jinpeng Lu and Lauri Oksanen and Lauri Ylinen},
url = {https://arxiv.org/abs/2306.05253},
year = {2024},
date = {2024-01-01},
abstract = {We consider an inverse problem for a finite graph (X,E) where we are given a subset of vertices B and the distances d(b1,b2) of all vertices b1, b2 in B. The distance of two vertices x1, x2 of X is defined as the minimal number of edges needed to connect them. The inverse problem is a discrete version of the boundary rigidity problem in Riemannian geometry or the inverse travel time problem in geophysics. We will show that this problem has unique solution under certain conditions and develop quantum computing methods to solve it. We present a quantum algorithm which produces a graph (X,E), or one of those, which has a given number of vertices and the required distances between vertices in B. We also consider applications in theory of computation, and show that a slight modification of the above inverse problem is NP-complete.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
We consider an inverse problem for a finite graph (X,E) where we are given a subset of vertices B and the distances d(b1,b2) of all vertices b1, b2 in B. The distance of two vertices x1, x2 of X is defined as the minimal number of edges needed to connect them. The inverse problem is a discrete version of the boundary rigidity problem in Riemannian geometry or the inverse travel time problem in geophysics. We will show that this problem has unique solution under certain conditions and develop quantum computing methods to solve it. We present a quantum algorithm which produces a graph (X,E), or one of those, which has a given number of vertices and the required distances between vertices in B. We also consider applications in theory of computation, and show that a slight modification of the above inverse problem is NP-complete.
159.
Nunzia Cerrato, Giacomo De Palma, Vittorio Giovannetti
Quantum entanglement survival time and positive partial transpose time in the presence of Markovian noise: a statistical analysis Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@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}
}
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.
160.
Naixu Guo, Zhan Yu, Aman Agrawal, Patrick Rebentrost
Quantum linear algebra is all you need for Transformer architectures Poster
2024.
Tags: Poster session Thursday
@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}
}
161.
Askery Canabarro, André Juan Ferreira Martins, Isis Didier, Rafael Chaves, Lavínia Araújo, Caio Maior, Plinio Ramos, Marcio Moura
Quantum Machine Learning for Drowsiness Detection with Electroencephalogram Signals Poster
2024.
Tags: Poster session Thursday
@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}
}
162.
Samuel Bouaziz-Ermann, Garazi Muguruza
Quantum Pseudorandomness Cannot Be Shrunk In a Black-Box Way Poster
2024.
Tags: Poster session Thursday
@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}
}
163.
Rishabh Batra, Naresh Goud Boddu, Rahul Jain
Quantum secure non-malleable randomness encoder and its applications Poster
2024.
Tags: Poster session Thursday | Links:
@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}
}
164.
Lynn Engelberts, Johanna Loyer, Simona Etinski
Quantum Sieving for Code-Based Cryptanalysis Poster
2024.
Tags: Poster session Thursday
@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}
}
165.
Dong An, Murphy Yuezhen Niu
Quantum Signal Processing with Errors Poster
2024.
Tags: Poster session Thursday
@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}
}
166.
Chusei Kiumi, Akito Suzuki, Yohei Tanaka
Quantum singular value transformation for an arbitrary bounded operator embedded in a unitary operator Poster
2024.
Tags: Poster session Thursday
@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}
}
167.
Touheed Anwar Atif, S. Sandeep Pradhan, Andreas Winter
Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels Poster
2024.
Tags: Poster session Thursday
@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}
}
168.
Josep Lumbreras, Mikhail Terekhov, Marco Tomamichel
Quantum state tomography of pure states with (almost) no regrets Poster
2024.
Abstract | Tags: Poster session Thursday
@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}
}
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.
169.
Teague Tomesh, Nicholas Allen, Daniel Dilley, Zain Saleem
Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@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}
}
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.
170.
Mehil Agarwal, Shravas Rao, Fang Song
Query Complexity in Limited Quantum Oracle Models Poster
2024.
Abstract | Tags: Poster session Thursday
@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}
}
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
[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
171.
Daniele Trisciani, Marco Cattaneo, Zoltan Zimboras
Qutrit-QAOA Approach for Graph 9-Coloring Optimization Poster
2024.
Abstract | Tags: Poster session Thursday
@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}
}
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.
172.
Benoît Dubus, Jérémie Roland
Random Compilers for Hamiltonian Simulation via Markov Chain Poster
2024.
Abstract | Tags: Poster session Thursday
@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}
}
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).
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).
173.
Ion Nechita, Sang-Jun Park
Random Covariant Quantum Channels Poster
2024.
Tags: Poster session Thursday
@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}
}
174.
Ion Nechita, Sang-Jun Park
Random Covariant Quantum Channels Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@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}
}
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.
175.
Ioannis Kolotouros, Petros Wallden
Random Natural Gradient Poster
2024.
Tags: Poster session Thursday
@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}
}
176.
Lucas Tecot, Cho-Jui Hsieh
Randomized Benchmarking of Local Zeroth-Order Optimizers for Variational Quantum Systems Poster
2024.
Tags: Poster session Thursday
@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}
}
177.
İskender Yalçınkaya, Martin Stefanak, Václav Potoček, Aurél Gábris, Sonja Barkhofen, Christine Silberhorn, Igor Jex
Recurrence in discrete-time stochastic quantum walks Poster
2024.
Tags: Poster session Thursday
@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}
}
178.
Sayantan Pramanik, Chaitanya Murti, Chiranjib Bhattacharyya, M Girish Chandra
Reducing Circuit Executions with Gradient-Sampling Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@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}
}
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.
179.
Giuseppe Catalano, Farzad Kianvash, Vittorio Giovannetti
Resonant Tunneling Effects in Quantum Communication Poster
2024.
Abstract | Tags: Poster session Thursday
@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}
}
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.
180.
Rishabh Batra, Sayantan Chakraborty, Rahul Jain, Upendra Kapshikar
Robust and composable device-independent quantum protocols for oblivious transfer and bit commitment Poster
2024.
Tags: Poster session Thursday
@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}
}
181.
Boris Arseniev
Search for the order of Pauli operators that reduces the Trotter error Poster
2024.
Abstract | Tags: Poster session Thursday
@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}
}
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.
182.
Zhenhuan Liu, Fuchuan Wei
Separation between Entanglement Criteria and Entanglement Detection Protocols Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@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}
}
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.
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.
183.
Yuguo Shao, Fuchuan Wei, Song Cheng, Zhengwei Liu
Simulating Noisy Variational Quantum Algorithms: A Polynomial Approach Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@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}
}
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.
184.
Quinten Tupker
Single Boson Boson Sampling Characterises Quantum Logspace Poster
2024.
Tags: Poster session Thursday
@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}
}
185.
Raphael Brieger, Markus Heinrich, Ingo Roth, Martin Kliesch
Stability of classical shadows under gate-dependent noise Poster
2024.
Tags: Outstanding Poster, Poster session Thursday
@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}
}
186.
Leo Zhou, Joao Basso, Song Mei
Statistical Estimation in the Spiked Tensor Model via the Quantum Approximate Optimization Algorithm Poster
2024.
Tags: Poster session Thursday
@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}
}
187.
Nick Blunt, Laura Caune, Róbert Izsák, Earl Campbell, Nicole Holzmann
Statistical phase estimation and error mitigation on a superconducting quantum processor Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@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}
}
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.
188.
Guneykan Ozgul, Xiantao Li, Mehrdad Mahdavi, Chunhao Wang
Stochastic Quantum Sampling for Non-Logconcave Distributions and Estimating Partition Functions Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@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}
}
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.
189.
Joseph Carolan, Luke Schaeffer
Succinct Fermion Data Structures Poster
2024.
Tags: Poster session Thursday
@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}
}
190.
Shin Nishio, Thomas Scruby, Nicolò Lo Piparo, William Munro, Kae Nemoto
Surface Code Communication with Quantum Multiplexing Poster
2024.
Tags: Poster session Thursday
@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}
}
191.
Hsin-Yu Hsu, Gelo Noel Tabia, Bo-An Tasi, Kai-Siang Chen, Yeong-Cherng Liang
Symmetric and asymmetric strategies for Bell-inequality violation Poster
2024.
Abstract | Tags: Poster session Thursday
@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}
}
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
192.
Maximilian Balthasar Mansky, Miguel Armayor Martinez, Alejandro Bravo Serna, Santiago Londoño Castillo, Gautham Sathish, Zhihao Wang, Claudia Linnhof-Popien
Symmetry-restricted quantum circuits are still well-behaved Poster
2024.
Tags: Poster session Thursday
@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}
}
193.
Dhrumil Patel, Shi Jie Samuel Tan, Yigit Subasi, Andrew Sornborger
Tapered Quantum Phase Estimation Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@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}
}
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.
194.
Lennart Bittel, Antonio Anna Mele, Jens Eisert, Lorenzo Leone
Testing and tomography of free-fermionic quantum states Poster
2024.
Abstract | Tags: Poster session Thursday
@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}
}
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
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
195.
Dhruv Devulapalli, Timothy Connor Mooney, James Watson
The Complexity of Determining Whether Finite Sized Systems Thermalize Poster
2024.
Tags: Poster session Thursday
@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}
}
196.
Sofiene Jerbi, Joe Gibbs, Manuel Rudolph, Matthias Caro, Patrick Coles, Hsin-Yuan Huang, Zoe Holmes
The power and limitations of learning quantum dynamics incoherently Poster
2024.
Tags: Poster session Thursday
@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}
}
197.
Alex Bredariol Grilo, Elham Kashefi, Damian Markham, Michael Oliveira
The power of shallow-depth Toffoli and qudit quantum circuits Poster
2024.
Tags: Poster session Thursday
@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}
}
198.
Tamás Kriváchy, Sadra Boreiri, Antoine Girardin, Pavel Sekatski, Nicolas Brunner
Topologically Robust Quantum Network Nonlocality Poster
2024.
Abstract | Tags: Poster session Thursday
@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}
}
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.
199.
Shraddha Singh, Baptiste Royer, Steven M Girvin
Towards Non-Abelian QSP: Control of Hybrid Continuous- and Discrete-Variable Architectures Poster
2024.
Tags: Poster session Thursday
@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}
}
200.
George Cowperthwaite, Adrian Kent, Damián Pitalúa-García
Towards practical quantum position verification Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@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}
}
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).
