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.
Kun Fang, Munan Zhang, Ruqi Shi, Yinan Li
Dynamic quantum circuit compilation Poster
2024.
Tags: Poster session Monday
@Poster{P24_143,
title = {Dynamic quantum circuit compilation},
author = {Kun Fang and Munan Zhang and Ruqi Shi and Yinan Li},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
102.
Oriel Kiss, Utkarsh Azad, Alessandro Roggero, Juan Miguel Arrazola, Borja Requena, David Wakeham
Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation Poster
2024.
Tags: Poster session Thursday
@Poster{P24_494,
title = {Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation},
author = {Oriel Kiss and Utkarsh Azad and Alessandro Roggero and Juan Miguel Arrazola and Borja Requena and David Wakeham},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
103.
Giuseppe Catalano, Marco Fanizza, Francesco Anna Mele, Giacomo De Palma, Vittorio Giovannetti
Efficiency Analysis of Continuous Variable Quantum Communication Lines in the Presence of Fluctuating Parameters Poster
2024.
Abstract | Tags: Poster session Thursday
@Poster{P24_542,
title = {Efficiency Analysis of Continuous Variable Quantum Communication Lines in the Presence of Fluctuating Parameters},
author = {Giuseppe Catalano and Marco Fanizza and Francesco Anna Mele and Giacomo De Palma and Vittorio Giovannetti},
year = {2024},
date = {2024-01-01},
abstract = {The emergence of quantum mechanics has led to the development of quantum technologies such as quantum communication. In order to optimize the performance of this technology, understanding quantum channels and assessing their efficacy, typically through concepts like transmission capacity, is essential. This study focuses on the entanglement-assisted classical capacity of certain types of quantum channels, specifically convex combinations of pure loss channels, aiming to identify states that outperform standard thermal states in communication performance. Through iterative approaches, optimal states maximizing quantum mutual information are identified, providing explicit values for channel capacity.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
The emergence of quantum mechanics has led to the development of quantum technologies such as quantum communication. In order to optimize the performance of this technology, understanding quantum channels and assessing their efficacy, typically through concepts like transmission capacity, is essential. This study focuses on the entanglement-assisted classical capacity of certain types of quantum channels, specifically convex combinations of pure loss channels, aiming to identify states that outperform standard thermal states in communication performance. Through iterative approaches, optimal states maximizing quantum mutual information are identified, providing explicit values for channel capacity.
104.
Raul A. Santos, Jan Lukas Bosse, Filippo Maria Gambetta, Ashley Montanaro, Andrew M. Childs, Charles Derby
Efficient and practical Hamiltonian simulation from time-dependent product formulas Poster
2024.
Tags: Poster session Thursday
@Poster{P24_301,
title = {Efficient and practical Hamiltonian simulation from time-dependent product formulas},
author = {Raul A. Santos and Jan Lukas Bosse and Filippo Maria Gambetta and Ashley Montanaro and Andrew M. Childs and Charles Derby},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
105.
Michael Zurel, Arne Heimendahl
Efficient classical simulation of quantum computation beyond Wigner positivity Poster
2024.
Tags: Poster session Thursday
@Poster{P24_430,
title = {Efficient classical simulation of quantum computation beyond Wigner positivity},
author = {Michael Zurel and Arne Heimendahl},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
106.
Manuel S. Rudolph, Enrico Fontana, Ross Duncan, Ivan Rungger, Zoe Holmes, Lukasz Cincio, Cristina Cirstoiu
Efficient classical surrogate simulation of quantum circuits Poster
2024.
Tags: Poster session Thursday
@Poster{P24_372,
title = {Efficient classical surrogate simulation of quantum circuits},
author = {Manuel S. Rudolph and Enrico Fontana and Ross Duncan and Ivan Rungger and Zoe Holmes and Lukasz Cincio and Cristina Cirstoiu},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
107.
Marcel Hinsche, Marios Ioannou, Sofiene Jerbi, Lorenzo Leone, Jens Eisert, Jose Carrasco
Efficient distributed inner product estimation via Pauli sampling Poster
2024.
Tags: Poster session Thursday
@Poster{P24_344,
title = {Efficient distributed inner product estimation via Pauli sampling},
author = {Marcel Hinsche and Marios Ioannou and Sofiene Jerbi and Lorenzo Leone and Jens Eisert and Jose Carrasco},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
108.
Carlos Octavio Ribeiro Neto, Bertúlio Bernardo
Efficient erasure of quantum information beyond Landauer's limit Poster
2024.
Tags: Poster session Thursday
@Poster{P24_499,
title = {Efficient erasure of quantum information beyond Landauer's limit},
author = {Carlos Octavio Ribeiro Neto and Bertúlio Bernardo},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
109.
Ben Zindorf, Sougato Bose
Efficient Implementation of Multi-Controlled Quantum Gates Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_475,
title = {Efficient Implementation of Multi-Controlled Quantum Gates},
author = {Ben Zindorf and Sougato Bose},
url = {https://arxiv.org/abs/2404.02279 https://arxiv.org/abs/2402.12356},
year = {2024},
date = {2024-01-01},
abstract = {We present an implementation of multi-controlled quantum gates which provides significant reductions of cost compared to state-of-the-art methods. The operator applied on the target qubit is a unitary, special unitary, or the Pauli X operator (Multi-Controlled Toffoli). The required number of ancilla qubits is no larger than one, similarly to known linear cost decompositions. We extend our methods for any number of target qubits, and provide further cost reductions if additional ancilla qubits are available. For each type of multi-controlled gate, we provide implementations for unrestricted (all-to-all) connectivity and for linear-nearest-neighbor. All of the methods use a linear cost of gates from the Clifford+T (fault-tolerant) set. In the context of linear-nearest-neighbor architecture, the cost and depth of our circuits scale linearly irrespective of the position of the qubits on which the gate is applied. Our methods directly improve the compilation process of many quantum algorithms, providing optimized circuits, which will result in a large reduction of errors.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
We present an implementation of multi-controlled quantum gates which provides significant reductions of cost compared to state-of-the-art methods. The operator applied on the target qubit is a unitary, special unitary, or the Pauli X operator (Multi-Controlled Toffoli). The required number of ancilla qubits is no larger than one, similarly to known linear cost decompositions. We extend our methods for any number of target qubits, and provide further cost reductions if additional ancilla qubits are available. For each type of multi-controlled gate, we provide implementations for unrestricted (all-to-all) connectivity and for linear-nearest-neighbor. All of the methods use a linear cost of gates from the Clifford+T (fault-tolerant) set. In the context of linear-nearest-neighbor architecture, the cost and depth of our circuits scale linearly irrespective of the position of the qubits on which the gate is applied. Our methods directly improve the compilation process of many quantum algorithms, providing optimized circuits, which will result in a large reduction of errors.
110.
Nai-Hui Chia, Ching-Yi Lai, Han-Hsuan Lin
Efficient learning of $t$-doped stabilizer states with single-copy measurements Poster
2024.
Tags: Poster session Monday
@Poster{P24_250,
title = {Efficient learning of $t$-doped stabilizer states with single-copy measurements},
author = {Nai-Hui Chia and Ching-Yi Lai and Han-Hsuan Lin},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
111.
Štěpán Šmíd, Roberto Bondesan
Efficient Learning of Long-Range and Equivariant Quantum Systems Poster
2024.
Abstract | Tags: Poster session Monday | Links:
@Poster{P24_28,
title = {Efficient Learning of Long-Range and Equivariant Quantum Systems},
author = {Štěpán Šmíd and Roberto Bondesan},
url = {https://arxiv.org/abs/2312.17019},
year = {2024},
date = {2024-01-01},
abstract = {In this work, we consider a fundamental task in quantum many-body physics – finding and learning ground states of quantum Hamiltonians and their properties.
Recent works have studied the task of predicting the ground state expectation value of sums of geometrically local observables by learning from data. For short-range gapped Hamiltonians, a sample complexity that is logarithmic in the number of qubits and quasipolynomial in the error was obtained.
Here we extend these results beyond the local requirements on both Hamiltonians and observables, motivated by the relevance of long-range interactions in molecular and atomic systems. For interactions decaying as a power law with exponent greater than twice the dimension of the system, we recover the same efficient logarithmic scaling with respect to the number of qubits, but the dependence on the error worsens to exponential.
Further, we show that learning algorithms equivariant under the automorphism group of the interaction hypergraph achieve a sample complexity reduction, leading in particular to a constant number of samples for learning sums of local observables in systems with periodic boundary conditions. We demonstrate the efficient scaling in practice by learning from DMRG simulations of 1D long-range and disordered systems with up to 128 qubits. Finally, we provide an analysis of the concentration of expectation values of global observables stemming from the central limit theorem, resulting in increased prediction accuracy.},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
In this work, we consider a fundamental task in quantum many-body physics – finding and learning ground states of quantum Hamiltonians and their properties.
Recent works have studied the task of predicting the ground state expectation value of sums of geometrically local observables by learning from data. For short-range gapped Hamiltonians, a sample complexity that is logarithmic in the number of qubits and quasipolynomial in the error was obtained.
Here we extend these results beyond the local requirements on both Hamiltonians and observables, motivated by the relevance of long-range interactions in molecular and atomic systems. For interactions decaying as a power law with exponent greater than twice the dimension of the system, we recover the same efficient logarithmic scaling with respect to the number of qubits, but the dependence on the error worsens to exponential.
Further, we show that learning algorithms equivariant under the automorphism group of the interaction hypergraph achieve a sample complexity reduction, leading in particular to a constant number of samples for learning sums of local observables in systems with periodic boundary conditions. We demonstrate the efficient scaling in practice by learning from DMRG simulations of 1D long-range and disordered systems with up to 128 qubits. Finally, we provide an analysis of the concentration of expectation values of global observables stemming from the central limit theorem, resulting in increased prediction accuracy.
Recent works have studied the task of predicting the ground state expectation value of sums of geometrically local observables by learning from data. For short-range gapped Hamiltonians, a sample complexity that is logarithmic in the number of qubits and quasipolynomial in the error was obtained.
Here we extend these results beyond the local requirements on both Hamiltonians and observables, motivated by the relevance of long-range interactions in molecular and atomic systems. For interactions decaying as a power law with exponent greater than twice the dimension of the system, we recover the same efficient logarithmic scaling with respect to the number of qubits, but the dependence on the error worsens to exponential.
Further, we show that learning algorithms equivariant under the automorphism group of the interaction hypergraph achieve a sample complexity reduction, leading in particular to a constant number of samples for learning sums of local observables in systems with periodic boundary conditions. We demonstrate the efficient scaling in practice by learning from DMRG simulations of 1D long-range and disordered systems with up to 128 qubits. Finally, we provide an analysis of the concentration of expectation values of global observables stemming from the central limit theorem, resulting in increased prediction accuracy.
112.
Antonio Anna Mele, Yaroslav Herasymenko
Efficient learning of quantum states prepared with few fermionic non-Gaussian gates Poster
2024.
Abstract | Tags: Poster session Monday | Links:
@Poster{P24_252,
title = {Efficient learning of quantum states prepared with few fermionic non-Gaussian gates},
author = {Antonio Anna Mele and Yaroslav Herasymenko},
url = {https://arxiv.org/abs/2402.18665},
year = {2024},
date = {2024-01-01},
abstract = {The experimental realization of increasingly complex quantum states underscores the pressing need for new methods of state learning and verification. In one such framework, quantum state tomography, the aim is to learn the full quantum state from data obtained by measurements. Without prior assumptions on the state, this task is prohibitively hard. Here, we present an efficient algorithm for learning states on n fermion modes prepared by any number of Gaussian and at most t non-Gaussian gates. By Jordan-Wigner mapping, this also includes n-qubit states prepared by nearest-neighbour matchgate circuits with at most t SWAP-gates. Our algorithm is based exclusively on single-copy measurements and produces a classical representation of a state, guaranteed to be close in trace distance to the target state. The sample and time complexity of our algorithm is poly(n,2t); thus if t=O(log(n)), it is efficient. We also show that, if t scales slightly more than logarithmically, any learning algorithm to solve the same task must be inefficient, under common cryptographic assumptions. We also provide an efficient property testing algorithm that, given access to copies of a state, determines whether such state is far or close to the set of states for which our learning algorithm works. Beyond tomography, our work sheds light on the structure of states prepared with few non-Gaussian gates and offers an improved upper bound on their circuit complexity.},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
The experimental realization of increasingly complex quantum states underscores the pressing need for new methods of state learning and verification. In one such framework, quantum state tomography, the aim is to learn the full quantum state from data obtained by measurements. Without prior assumptions on the state, this task is prohibitively hard. Here, we present an efficient algorithm for learning states on n fermion modes prepared by any number of Gaussian and at most t non-Gaussian gates. By Jordan-Wigner mapping, this also includes n-qubit states prepared by nearest-neighbour matchgate circuits with at most t SWAP-gates. Our algorithm is based exclusively on single-copy measurements and produces a classical representation of a state, guaranteed to be close in trace distance to the target state. The sample and time complexity of our algorithm is poly(n,2t); thus if t=O(log(n)), it is efficient. We also show that, if t scales slightly more than logarithmically, any learning algorithm to solve the same task must be inefficient, under common cryptographic assumptions. We also provide an efficient property testing algorithm that, given access to copies of a state, determines whether such state is far or close to the set of states for which our learning algorithm works. Beyond tomography, our work sheds light on the structure of states prepared with few non-Gaussian gates and offers an improved upper bound on their circuit complexity.
113.
Tobias Haug, Soovin Lee, Myungshik Kim Kim
Efficient stabilizer entropies for quantum computers Poster
2024.
Tags: Poster session Monday
@Poster{P24_207,
title = {Efficient stabilizer entropies for quantum computers},
author = {Tobias Haug and Soovin Lee and Myungshik Kim Kim},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
114.
Hitomi Mori, Kosuke Mitarai, Keisuke Fujii
Efficient state preparation for multivariate Monte Carlo simulation Poster
2024.
Abstract | Tags: Poster session Thursday
@Poster{P24_504,
title = {Efficient state preparation for multivariate Monte Carlo simulation},
author = {Hitomi Mori and Kosuke Mitarai and Keisuke Fujii},
year = {2024},
date = {2024-01-01},
abstract = {Quantum state preparation is a task to prepare a state with a specific function encoded in the amplitude, which is an essential subroutine in many quantum algorithms. In this paper, we focus on multivariate state preparation, as it is an important extension for many application areas. Specifically in finance, multivariate state preparation is required for multivariate Monte Carlo simulation, which is used for important numerical tasks. Using the existing method, multivariate quantum state preparation requires the number of gates exponential in the number of variables. For this task, we propose a quantum algorithm that only requires the number of gates linear in the number of variables. Our algorithm utilizes multivariable quantum signal processing (M-QSP), a technique to perform the multivariate polynomial transformation of the amplitude. Using easily prepared block-encodings corresponding to each variable, we apply the M-QSP in the subspace to construct the target function. In this way, our algorithm prepares the target state efficiently for functions achievable with M-QSP.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Quantum state preparation is a task to prepare a state with a specific function encoded in the amplitude, which is an essential subroutine in many quantum algorithms. In this paper, we focus on multivariate state preparation, as it is an important extension for many application areas. Specifically in finance, multivariate state preparation is required for multivariate Monte Carlo simulation, which is used for important numerical tasks. Using the existing method, multivariate quantum state preparation requires the number of gates exponential in the number of variables. For this task, we propose a quantum algorithm that only requires the number of gates linear in the number of variables. Our algorithm utilizes multivariable quantum signal processing (M-QSP), a technique to perform the multivariate polynomial transformation of the amplitude. Using easily prepared block-encodings corresponding to each variable, we apply the M-QSP in the subspace to construct the target function. In this way, our algorithm prepares the target state efficiently for functions achievable with M-QSP.
115.
Carlos Gois, Matthias Kleinmann
Efficient, informative and versatile confidence region for quantum state tomography Poster
2024.
Tags: Poster session Thursday
@Poster{P24_332,
title = {Efficient, informative and versatile confidence region for quantum state tomography},
author = {Carlos Gois and Matthias Kleinmann},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
116.
Zhenning Liu, Dhruv Devulapalli, Dominik Hangleiter, Yi-Kai Liu, Alicia Kollár, Alexey Gorshkov, Andrew Childs
Efficiently verifiable quantum advantage on near-term analog quantum simulators Poster
2024.
Tags: Poster session Thursday
@Poster{P24_413,
title = {Efficiently verifiable quantum advantage on near-term analog quantum simulators},
author = {Zhenning Liu and Dhruv Devulapalli and Dominik Hangleiter and Yi-Kai Liu and Alicia Kollár and Alexey Gorshkov and Andrew Childs},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
117.
Maryam Mudassar, Riley Chien, Daniel Gottesman
Encoding Majorana codes Poster
2024.
Tags: Poster session Thursday
@Poster{P24_357,
title = {Encoding Majorana codes},
author = {Maryam Mudassar and Riley Chien and Daniel Gottesman},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
118.
Hugo Thomas, Pierre-Emmanuel Emeriau, Rawad Mezher
Encoding quantum circuits onto graphs: computation of probability amplitudes via permanents Poster
2024.
Tags: Poster session Monday
@Poster{P24_174,
title = {Encoding quantum circuits onto graphs: computation of probability amplitudes via permanents},
author = {Hugo Thomas and Pierre-Emmanuel Emeriau and Rawad Mezher},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
119.
Paul Gondolf, Tim Möbus, Cambyse Rouzé
Energy preserving evolutions over Bosonic systems Poster
2024.
Abstract | Tags: Poster session Monday | Links:
@Poster{P24_184,
title = {Energy preserving evolutions over Bosonic systems},
author = {Paul Gondolf and Tim Möbus and Cambyse Rouzé},
url = {https://arxiv.org/abs/2307.13801},
year = {2024},
date = {2024-01-01},
abstract = {The exponential convergence to invariant subspaces of quantum Markov semigroups plays a crucial role in quantum information theory. One such example is in bosonic error correction schemes, where dissipation is used to drive states back to the code-space - an invariant subspace protected against certain types of errors. In this paper, we investigate perturbations of quantum dynamical semigroups that operate on continuous variable (CV) systems and admit an invariant subspace. First, we prove a generation theorem for quantum Markov semigroups on CV systems under the physical assumptions that (i) the generator has GKSL form with corresponding jump operators defined as polynomials of annihilation and creation operators; and (ii) the (possibly unbounded) generator increases all moments in a controlled manner. Additionally, we show that the level sets of operators with bounded first moments are admissible subspaces of the evolution, providing the foundations for a perturbative analysis. Our results also extend to time-dependent semigroups. We apply our general framework to two settings of interest in continuous variables quantum information processing. First, we provide a new scheme for deriving continuity bounds on the energy-constrained capacities of Markovian perturbations of Quantum dynamical semigroups. Second, we provide quantitative perturbation bounds for the steady state of the quantum Ornstein Uhlenbeck semigroup and the invariant subspace of the photon dissipation used in bosonic error correction.},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
The exponential convergence to invariant subspaces of quantum Markov semigroups plays a crucial role in quantum information theory. One such example is in bosonic error correction schemes, where dissipation is used to drive states back to the code-space - an invariant subspace protected against certain types of errors. In this paper, we investigate perturbations of quantum dynamical semigroups that operate on continuous variable (CV) systems and admit an invariant subspace. First, we prove a generation theorem for quantum Markov semigroups on CV systems under the physical assumptions that (i) the generator has GKSL form with corresponding jump operators defined as polynomials of annihilation and creation operators; and (ii) the (possibly unbounded) generator increases all moments in a controlled manner. Additionally, we show that the level sets of operators with bounded first moments are admissible subspaces of the evolution, providing the foundations for a perturbative analysis. Our results also extend to time-dependent semigroups. We apply our general framework to two settings of interest in continuous variables quantum information processing. First, we provide a new scheme for deriving continuity bounds on the energy-constrained capacities of Markovian perturbations of Quantum dynamical semigroups. Second, we provide quantitative perturbation bounds for the steady state of the quantum Ornstein Uhlenbeck semigroup and the invariant subspace of the photon dissipation used in bosonic error correction.
120.
Antonio Sannia, Francesco Tacchino, Ivano Tavernelli, Gian Luca Giorgi, Roberta Zambrini
Engineered dissipation to mitigate barren plateaus Poster
2024.
Tags: Poster session Monday
@Poster{P24_67,
title = {Engineered dissipation to mitigate barren plateaus},
author = {Antonio Sannia and Francesco Tacchino and Ivano Tavernelli and Gian Luca Giorgi and Roberta Zambrini},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
121.
Chenghong Zhu, Chengkai Zhu, Zhiping Liu, Xin Wang
Entanglement cost of discriminating quantum states under locality constraints Poster
2024.
Tags: Poster session Thursday
@Poster{P24_333,
title = {Entanglement cost of discriminating quantum states under locality constraints},
author = {Chenghong Zhu and Chengkai Zhu and Zhiping Liu and Xin Wang},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
122.
Fei Shi, Lin Chen, Giulio Chiribella, Qi Zhao
Entanglement detection length of multipartite quantum states Poster
2024.
Tags: Poster session Monday
@Poster{P24_69,
title = {Entanglement detection length of multipartite quantum states},
author = {Fei Shi and Lin Chen and Giulio Chiribella and Qi Zhao},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
123.
Albert Rico, Felix Huber
Entanglement detection with trace polynomials Poster
2024.
Tags: Poster session Thursday
@Poster{P24_350,
title = {Entanglement detection with trace polynomials},
author = {Albert Rico and Felix Huber},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
124.
Vikesh Siddhu, Dina Abdelhadi, Tomas Jochym-O'Connor, John Smolin
Entanglement sharing across a damping-dephasing channel Poster
2024.
Tags: Outstanding Poster, Poster session Monday
@Poster{P24_242,
title = {Entanglement sharing across a damping-dephasing channel},
author = {Vikesh Siddhu and Dina Abdelhadi and Tomas Jochym-O'Connor and John Smolin},
year = {2024},
date = {2024-01-01},
keywords = {Outstanding Poster, Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
125.
Ruge Lin
Entanglement Trajectory and its Boundary Poster
2024.
Abstract | Tags: Poster session Monday | Links:
@Poster{P24_66,
title = {Entanglement Trajectory and its Boundary},
author = {Ruge Lin},
url = {https://doi.org/10.22331/q-2024-03-14-1282},
year = {2024},
date = {2024-01-01},
abstract = {In this article, we present a novel approach to investigating entanglement in the context of quantum computing. Our methodology involves analyzing reduced density matrices at different stages of a quantum algorithm's execution and representing the dominant eigenvalue and von Neumann entropy on a graph, creating an "entanglement trajectory." To establish the trajectory's boundaries, we employ random matrix theory. Through the examination of examples such as quantum adiabatic computation, the Grover algorithm, and the Shor algorithm, we demonstrate that the entanglement trajectory remains within the established boundaries, exhibiting unique characteristics for each example. Moreover, we show that these boundaries and features can be extended to trajectories defined by alternative entropy measures. The entanglement trajectory serves as an invariant property of a quantum system, maintaining consistency across varying situations and definitions of entanglement. Numerical simulations accompanying this research are available via open access.},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
In this article, we present a novel approach to investigating entanglement in the context of quantum computing. Our methodology involves analyzing reduced density matrices at different stages of a quantum algorithm's execution and representing the dominant eigenvalue and von Neumann entropy on a graph, creating an "entanglement trajectory." To establish the trajectory's boundaries, we employ random matrix theory. Through the examination of examples such as quantum adiabatic computation, the Grover algorithm, and the Shor algorithm, we demonstrate that the entanglement trajectory remains within the established boundaries, exhibiting unique characteristics for each example. Moreover, we show that these boundaries and features can be extended to trajectories defined by alternative entropy measures. The entanglement trajectory serves as an invariant property of a quantum system, maintaining consistency across varying situations and definitions of entanglement. Numerical simulations accompanying this research are available via open access.
126.
Dominic Verdon
Entanglement-symmetries of covariant channels Poster
2024.
Tags: Poster session Thursday
@Poster{P24_327,
title = {Entanglement-symmetries of covariant channels},
author = {Dominic Verdon},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
127.
Ernest Y. -Z. Tan, Ramona Wolf
Entropy bounds for device-independent quantum key distribution with local Bell test Poster
2024.
Abstract | Tags: Poster session Monday | Links:
@Poster{P24_232,
title = {Entropy bounds for device-independent quantum key distribution with local Bell test},
author = {Ernest Y. -Z. Tan and Ramona Wolf},
url = {https://arxiv.org/abs/2404.00792},
year = {2024},
date = {2024-01-01},
abstract = {One of the main challenges in device-independent quantum key distribution (DIQKD) is achieving the required Bell violation over long distances, as the channel losses result in low overall detection efficiencies. Recent works have explored the concept of certifying nonlocal correlations over extended distances through the use of a local Bell test. Here, an additional quantum device is placed in close proximity to one party, using short-distance correlations to verify nonlocal behavior at long distances. However, existing works have either not resolved the question of DIQKD security against active attackers in this setup, or used methods that do not yield tight bounds on the keyrates. In this work, we introduce a general formulation of the key rate computation task in this setup that can be combined with recently developed methods for analyzing standard DIQKD. Using this method, we show that if the short-distance devices exhibit sufficiently high detection efficiencies, positive key rates can be achieved in the long-distance branch with lower detection efficiencies as compared to standard DIQKD setups. This highlights the potential for improved performance of DIQKD over extended distances in scenarios where short-distance correlations are leveraged to validate quantum correlations.},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
One of the main challenges in device-independent quantum key distribution (DIQKD) is achieving the required Bell violation over long distances, as the channel losses result in low overall detection efficiencies. Recent works have explored the concept of certifying nonlocal correlations over extended distances through the use of a local Bell test. Here, an additional quantum device is placed in close proximity to one party, using short-distance correlations to verify nonlocal behavior at long distances. However, existing works have either not resolved the question of DIQKD security against active attackers in this setup, or used methods that do not yield tight bounds on the keyrates. In this work, we introduce a general formulation of the key rate computation task in this setup that can be combined with recently developed methods for analyzing standard DIQKD. Using this method, we show that if the short-distance devices exhibit sufficiently high detection efficiencies, positive key rates can be achieved in the long-distance branch with lower detection efficiencies as compared to standard DIQKD setups. This highlights the potential for improved performance of DIQKD over extended distances in scenarios where short-distance correlations are leveraged to validate quantum correlations.
128.
Marine Demarty, James Mills, Raul Garcia-Patron
Entropy Density Benchmarking of Near-Term Quantum Circuits Poster
2024.
Abstract | Tags: Poster session Thursday
@Poster{P24_450,
title = {Entropy Density Benchmarking of Near-Term Quantum Circuits},
author = {Marine Demarty and James Mills and Raul Garcia-Patron},
year = {2024},
date = {2024-01-01},
abstract = {Understanding the limitations imposed by noise on current and next generation quantum devices is a crucial step towards demonstrations of quantum advantage with practical applications. In this work we investigate the accumulation of entropy as a benchmark to monitor the performance of quantum processing units. A combination of numerical simulations and experiments on programmable superconducting quantum circuits provides further evidence that global depolarising noise is an excellent back-of-the-envelope predictive model. The monitoring of entropy density not only provides a complementary approach to existing circuit-level benchmarking techniques, but more importantly, it provides a much needed bridge between circuit-level and application-level benchmarking protocols. Our work shows that the combination of analytical, numerical and experimental methods, has the potential to build good heuristic models that improve over existing techniques to bound the circuit size above which quantum advantage is lost.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Understanding the limitations imposed by noise on current and next generation quantum devices is a crucial step towards demonstrations of quantum advantage with practical applications. In this work we investigate the accumulation of entropy as a benchmark to monitor the performance of quantum processing units. A combination of numerical simulations and experiments on programmable superconducting quantum circuits provides further evidence that global depolarising noise is an excellent back-of-the-envelope predictive model. The monitoring of entropy density not only provides a complementary approach to existing circuit-level benchmarking techniques, but more importantly, it provides a much needed bridge between circuit-level and application-level benchmarking protocols. Our work shows that the combination of analytical, numerical and experimental methods, has the potential to build good heuristic models that improve over existing techniques to bound the circuit size above which quantum advantage is lost.
129.
Cheng Shang, Hayato Kinkawa, Tomotaka Kuwahara
Equivalence between operator spreading and information propagation Poster
2024.
Abstract | Tags: Poster session Thursday
@Poster{P24_544,
title = {Equivalence between operator spreading and information propagation},
author = {Cheng Shang and Hayato Kinkawa and Tomotaka Kuwahara},
year = {2024},
date = {2024-01-01},
abstract = {A critical and unresolved problem in information science is: What are the precise limits of quantum communication? Dr. T. Kuwahara and I are curious whether this challenge can be solved through the powerful techniques of operator spreading. In 1972, the concept of the Lieb-Robinson bound was proposed, defining the maximum propagation of any information inside quantum many-body systems. This principle, intimately linked to the spreading of operators, finds extensive application in areas such as quantum simulation and information scrambling. On the other hand, the Holevo capacity characterizes the maximum amount of classical information that can be transferred through a quantum channel. In this poster, Dr. T. Kuwahara and I first established the general connection between the Holevo capacity and the Lieb-Robinson bound. We first provided the rigorous conditions under which operator spreading is equivalent to information propagation. We then provided two generalized theorems for the limits of quantum communication as long as unitary time evolution is satisfied. Theorem one universally gives strict upper and lower bounds on the amount of classical information over a quantum channel. Theorem two generalized shows rigorous upper and lower bounds on the entanglement capacity, which is the quantum information theoretic counterpart of heat capacity. Moving forward, we intend to extend our findings to open systems and explore the complexity of quantum dissipative dynamics from an information-theoretic lens.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
A critical and unresolved problem in information science is: What are the precise limits of quantum communication? Dr. T. Kuwahara and I are curious whether this challenge can be solved through the powerful techniques of operator spreading. In 1972, the concept of the Lieb-Robinson bound was proposed, defining the maximum propagation of any information inside quantum many-body systems. This principle, intimately linked to the spreading of operators, finds extensive application in areas such as quantum simulation and information scrambling. On the other hand, the Holevo capacity characterizes the maximum amount of classical information that can be transferred through a quantum channel. In this poster, Dr. T. Kuwahara and I first established the general connection between the Holevo capacity and the Lieb-Robinson bound. We first provided the rigorous conditions under which operator spreading is equivalent to information propagation. We then provided two generalized theorems for the limits of quantum communication as long as unitary time evolution is satisfied. Theorem one universally gives strict upper and lower bounds on the amount of classical information over a quantum channel. Theorem two generalized shows rigorous upper and lower bounds on the entanglement capacity, which is the quantum information theoretic counterpart of heat capacity. Moving forward, we intend to extend our findings to open systems and explore the complexity of quantum dissipative dynamics from an information-theoretic lens.
130.
Yotam Vaknin, Alex Retzker
Erasure Qubits with shorter syndrome cycles and biased noise on dual-rail transmons Poster
2024.
Abstract | Tags: Poster session Thursday
@Poster{P24_315,
title = {Erasure Qubits with shorter syndrome cycles and biased noise on dual-rail transmons},
author = {Yotam Vaknin and Alex Retzker},
year = {2024},
date = {2024-01-01},
abstract = {Erasure qubits are a promising path to achieving error rates below the error-correcting threshold with current superconducting hardware. In this study, we investigate in detail the effect of erasure on dual-rail qubits, a major candidate for erasure qubits based on transmons. We find that reducing the number of erasure detections per round can reduce the physical requirement on the transmons composing the dual-rails. We further show that by changing the type of 2-Qubit gate, we can bias the erasure noise and further improve the erasure threshold using the XZZX code. Since dual-rails can detect decay and leakage without disturbing the logical subspace, we further show how they can mitigate the effect of leakage better than standard transmons, since the effect of false-positive and false-negative detection can be controlled by changing the number of detections per round.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Erasure qubits are a promising path to achieving error rates below the error-correcting threshold with current superconducting hardware. In this study, we investigate in detail the effect of erasure on dual-rail qubits, a major candidate for erasure qubits based on transmons. We find that reducing the number of erasure detections per round can reduce the physical requirement on the transmons composing the dual-rails. We further show that by changing the type of 2-Qubit gate, we can bias the erasure noise and further improve the erasure threshold using the XZZX code. Since dual-rails can detect decay and leakage without disturbing the logical subspace, we further show how they can mitigate the effect of leakage better than standard transmons, since the effect of false-positive and false-negative detection can be controlled by changing the number of detections per round.
131.
Haruki Emori, Hiroyasu Tajima
Error and Disturbance as Irreversibility with Applications: Unified Definition, Wigner—Araki—Yanase Theorem and Out-of-Time-Order Correlator Poster
2024.
Tags: Poster session Monday
@Poster{P24_134,
title = {Error and Disturbance as Irreversibility with Applications: Unified Definition, Wigner—Araki—Yanase Theorem and Out-of-Time-Order Correlator},
author = {Haruki Emori and Hiroyasu Tajima},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
132.
Xiaozhen Fu, Daniel Gottesman
Error Correction in Dynamical Codes Poster
2024.
Tags: Poster session Thursday
@Poster{P24_368,
title = {Error Correction in Dynamical Codes},
author = {Xiaozhen Fu and Daniel Gottesman},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
133.
Boyang Chen, Jue Xu, Xiao Yuan, Qi Zhao
Error interference in quantum simulation Poster
2024.
Tags: Poster session Thursday
@Poster{P24_446,
title = {Error interference in quantum simulation},
author = {Boyang Chen and Jue Xu and Xiao Yuan and Qi Zhao},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
134.
Junxiang Huang, Qiming Ding, Xiao Yuan
Error Mitigation via N-Representability conditions Poster
2024.
Tags: Poster session Thursday
@Poster{P24_445,
title = {Error Mitigation via N-Representability conditions},
author = {Junxiang Huang and Qiming Ding and Xiao Yuan},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
135.
Bujiao Wu, Dax Enshan Koh
Error-mitigated fermionic classical shadows on noisy quantum devices Poster
2024.
Tags: Poster session Monday
@Poster{P24_136,
title = {Error-mitigated fermionic classical shadows on noisy quantum devices},
author = {Bujiao Wu and Dax Enshan Koh},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
136.
Sina Zeytinoglu, Sho Sugiura
Error-Robust Quantum Signal Processing using Rydberg Atoms Poster
2024.
Tags: Poster session Thursday
@Poster{P24_405,
title = {Error-Robust Quantum Signal Processing using Rydberg Atoms},
author = {Sina Zeytinoglu and Sho Sugiura},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
137.
Khurshed Fitter, Cécilia Lancien, Ion Nechita
Estimating the entanglement of random multipartite quantum states Poster
2024.
Tags: Poster session Thursday
@Poster{P24_294,
title = {Estimating the entanglement of random multipartite quantum states},
author = {Khurshed Fitter and Cécilia Lancien and Ion Nechita},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
138.
Emil Khabiboulline, Neeraj Tata, Daniel Jafferis, Mikhail Lukin
Eternal Wormhole-Assisted Transfer in Critical Spin Chains Poster
2024.
Abstract | Tags: Poster session Thursday
@Poster{P24_367,
title = {Eternal Wormhole-Assisted Transfer in Critical Spin Chains},
author = {Emil Khabiboulline and Neeraj Tata and Daniel Jafferis and Mikhail Lukin},
year = {2024},
date = {2024-01-01},
abstract = {Preparing the ground state of two weakly coupled Sachdev-Ye-Kitaev (SYK) models and perturbing one side, the excitation emerges on the other side, oscillating back and forth, consistent with a particle traversing an eternal wormhole. We show that critical spin chains with no simple gravitational dual have similar features. In particular, they exhibit non-thermalizing revivals with an enhancement in transmission speed, in agreement with 1+1-dimensional conformal field theory. We provide microscopic descriptions in terms of operator spreading resulting in a speed-up of information transfer, contrasting generic many-body behavior from gravitational. The limited amount of required experimental control eases study in analog quantum simulators, such as arrays of Rydberg atoms.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Preparing the ground state of two weakly coupled Sachdev-Ye-Kitaev (SYK) models and perturbing one side, the excitation emerges on the other side, oscillating back and forth, consistent with a particle traversing an eternal wormhole. We show that critical spin chains with no simple gravitational dual have similar features. In particular, they exhibit non-thermalizing revivals with an enhancement in transmission speed, in agreement with 1+1-dimensional conformal field theory. We provide microscopic descriptions in terms of operator spreading resulting in a speed-up of information transfer, contrasting generic many-body behavior from gravitational. The limited amount of required experimental control eases study in analog quantum simulators, such as arrays of Rydberg atoms.
139.
Kohdai Kuroiwa, Ryuji Takagi, Gerardo Adesso, Hayata Yamasaki
Every quantum helps: Operational advantage of quantum resources beyond convexity Poster
2024.
Abstract | Tags: Poster session Monday | Links:
@Poster{P24_241,
title = {Every quantum helps: Operational advantage of quantum resources beyond convexity},
author = {Kohdai Kuroiwa and Ryuji Takagi and Gerardo Adesso and Hayata Yamasaki},
url = {https://arxiv.org/abs/2310.09154 https://arxiv.org/abs/2310.09321},
year = {2024},
date = {2024-01-01},
abstract = {Identifying what quantum-mechanical properties are useful to untap a superior performance in quantum technologies is a pivotal question. Quantum resource theories provide a unified framework to analyze and understand such properties, as successfully demonstrated for entanglement and coherence. While these are examples of convex resources, for which quantum advantages can always be identified, many physical resources are described by a nonconvex set of free states and their interpretation has so far remained elusive. Here we address the fundamental question of the usefulness of quantum resources without convexity assumption, by providing two operational interpretations of the generalized robustness measure in general resource theories. First, we characterize the generalized robustness in terms of a nonlinear resource witness and reveal that any state is more advantageous than a free one in some multicopy channel discrimination task. Next, we consider a scenario where a theory is characterized by multiple constraints and show that the generalized robustness coincides with the worst-case advantage in a single-copy channel discrimination setting. Based on these characterizations, we conclude that every quantum resource state shows a qualitative and quantitative advantage in discrimination problems in a general resource theory even without any specification on the structure of the free states.},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
Identifying what quantum-mechanical properties are useful to untap a superior performance in quantum technologies is a pivotal question. Quantum resource theories provide a unified framework to analyze and understand such properties, as successfully demonstrated for entanglement and coherence. While these are examples of convex resources, for which quantum advantages can always be identified, many physical resources are described by a nonconvex set of free states and their interpretation has so far remained elusive. Here we address the fundamental question of the usefulness of quantum resources without convexity assumption, by providing two operational interpretations of the generalized robustness measure in general resource theories. First, we characterize the generalized robustness in terms of a nonlinear resource witness and reveal that any state is more advantageous than a free one in some multicopy channel discrimination task. Next, we consider a scenario where a theory is characterized by multiple constraints and show that the generalized robustness coincides with the worst-case advantage in a single-copy channel discrimination setting. Based on these characterizations, we conclude that every quantum resource state shows a qualitative and quantitative advantage in discrimination problems in a general resource theory even without any specification on the structure of the free states.
140.
Bjorn Berntson, Zalan Nemeth, Andrew Patterson, Christoph Sünderhauf
Exact results on matrix inversion polynomials Poster
2024.
Tags: Poster session Thursday
@Poster{P24_547,
title = {Exact results on matrix inversion polynomials},
author = {Bjorn Berntson and Zalan Nemeth and Andrew Patterson and Christoph Sünderhauf},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
141.
Andrew Zhao, Nicholas Rubin
Expanding the reach of quantum optimization with fermionic embeddings Poster
2024.
Tags: Poster session Thursday
@Poster{P24_401,
title = {Expanding the reach of quantum optimization with fermionic embeddings},
author = {Andrew Zhao and Nicholas Rubin},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
142.
Jacob Spainhour, Akshay Seshadri, Stephen Becker
Experiment Design for Minimax Fidelity Estimation Poster
2024.
Abstract | Tags: Poster session Monday | Links:
@Poster{P24_229,
title = {Experiment Design for Minimax Fidelity Estimation},
author = {Jacob Spainhour and Akshay Seshadri and Stephen Becker},
url = {https://amath.colorado.edu/faculty/becker/Experimental_Design_Manuscript.pdf},
year = {2024},
date = {2024-01-01},
abstract = {Technological limitations require that additional resources be spent to verify the output of a quantum device. We consider this verification through the lens of fidelity estimation, in which measurements of the quantum state directly inform how “close” a constructed state is to the intended target. This is in contrast to tomography schemes that first reconstruct the complete state, as these often require a greater number of measurements to obtain a reasonably accurate estimate. To be experimentally viable, a central goal of any approach is to accurately estimate the fidelity from as few observations, and types of observations, as possible. We present a technique that designs an experimental measurement protocol of a known target state, finding one that minimizes the width of a nearly optimal minimax confidence interval around the true value of the fidelity. Importantly, the nature of the underlying fidelity estimation scheme means that this design procedure is robust to the availability of measurements, and can be designed prior to the collection of any observations.},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
Technological limitations require that additional resources be spent to verify the output of a quantum device. We consider this verification through the lens of fidelity estimation, in which measurements of the quantum state directly inform how “close” a constructed state is to the intended target. This is in contrast to tomography schemes that first reconstruct the complete state, as these often require a greater number of measurements to obtain a reasonably accurate estimate. To be experimentally viable, a central goal of any approach is to accurately estimate the fidelity from as few observations, and types of observations, as possible. We present a technique that designs an experimental measurement protocol of a known target state, finding one that minimizes the width of a nearly optimal minimax confidence interval around the true value of the fidelity. Importantly, the nature of the underlying fidelity estimation scheme means that this design procedure is robust to the availability of measurements, and can be designed prior to the collection of any observations.
143.
Supanut Thanasilp, Samson Wang, Marco Cerezo, Zoe Holmes
Exponential concentration in quantum kernel methods Poster
2024.
Tags: Poster session Thursday
@Poster{P24_336,
title = {Exponential concentration in quantum kernel methods},
author = {Supanut Thanasilp and Samson Wang and Marco Cerezo and Zoe Holmes},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
144.
Dar Gilboa, Jarrod McClean
Exponential Quantum Communication Advantage in Distributed Learning Poster
2024.
Tags: Poster session Monday
@Poster{P24_268,
title = {Exponential Quantum Communication Advantage in Distributed Learning},
author = {Dar Gilboa and Jarrod McClean},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
145.
Vivek Balsaheb Sabale, Nihar Ranjan Dash, Atul Kumar, Subhashish Banerjee
Facets of correlated non-Markovian quantum channels Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_526,
title = {Facets of correlated non-Markovian quantum channels},
author = {Vivek Balsaheb Sabale and Nihar Ranjan Dash and Atul Kumar and Subhashish Banerjee},
url = {https://arxiv.org/abs/2401.05499},
year = {2024},
date = {2024-01-01},
abstract = {We investigate the domain of correlated non-Markovian channels, exploring the potential memory arising
from the correlated action of channels and the inherent memory due to non-Markovian dynamics. The
impact of channel correlations of different quantum channels is studied using different non-Markovianity
indicators and measures. In addition, the dynamical aspects of correlated non-Markovian channels,
including entanglement dynamics and changes in the volume of accessible states are explored. The
article analyses both unital and non-unital correlated channels and links the correlation factor and error correction success probability},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
We investigate the domain of correlated non-Markovian channels, exploring the potential memory arising
from the correlated action of channels and the inherent memory due to non-Markovian dynamics. The
impact of channel correlations of different quantum channels is studied using different non-Markovianity
indicators and measures. In addition, the dynamical aspects of correlated non-Markovian channels,
including entanglement dynamics and changes in the volume of accessible states are explored. The
article analyses both unital and non-unital correlated channels and links the correlation factor and error correction success probability
from the correlated action of channels and the inherent memory due to non-Markovian dynamics. The
impact of channel correlations of different quantum channels is studied using different non-Markovianity
indicators and measures. In addition, the dynamical aspects of correlated non-Markovian channels,
including entanglement dynamics and changes in the volume of accessible states are explored. The
article analyses both unital and non-unital correlated channels and links the correlation factor and error correction success probability
146.
Nadish Silva, Wilfred Salmon, Ming Yin
Fast algorithms for classical specifications of stabiliser states and Clifford gates Poster
2024.
Tags: Poster session Monday
@Poster{P24_181,
title = {Fast algorithms for classical specifications of stabiliser states and Clifford gates},
author = {Nadish Silva and Wilfred Salmon and Ming Yin},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
147.
Christopher Pattison, Gefen Baranes, Juan Pablo Bonilla Ataides, Mikhail Lukin, Hengyun Zhou
Fast quantum interconnects via constant-rate entanglement distillation Poster
2024.
Abstract | Tags: Outstanding Poster, Poster session Monday
@Poster{P24_226,
title = {Fast quantum interconnects via constant-rate entanglement distillation},
author = {Christopher Pattison and Gefen Baranes and Juan Pablo Bonilla Ataides and Mikhail Lukin and Hengyun Zhou},
year = {2024},
date = {2024-01-01},
abstract = {Distributed quantum computing allows the modular construction of large-scale quantum computers and enables new protocols for verifiably-secure quantum computation. However, such applications place stringent demands on the fidelity and rate of remote logical entanglement generation, which are not met by existing methods for quantum interconnects. In this work, we develop constant-rate entanglement distillation methods to address this bottleneck. By using a sequence of two-way entanglement distillation protocols with increasing rate, we achieve constant-rate entanglement distillation with competitive overhead. We encode the distributed Bell pairs into error-correcting codes prior to distillation, thereby making most efficient use of the noisy, distributed entanglement while only incurring a modest increase in memory footprint. We prove that our protocol achieves a constant expected ratio of physical to logical Bell pairs, for a given input error rate, and perform extensive numerical optimization to identify concrete code sequences with low overhead. We further analyze the possible improvements afforded by our scheme in the execution of concrete distributed algorithms. We find that our scheme outperforms existing quantum interconnect schemes by an order of magnitude, paving the way towards fast, distributed quantum computing.},
keywords = {Outstanding Poster, Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
Distributed quantum computing allows the modular construction of large-scale quantum computers and enables new protocols for verifiably-secure quantum computation. However, such applications place stringent demands on the fidelity and rate of remote logical entanglement generation, which are not met by existing methods for quantum interconnects. In this work, we develop constant-rate entanglement distillation methods to address this bottleneck. By using a sequence of two-way entanglement distillation protocols with increasing rate, we achieve constant-rate entanglement distillation with competitive overhead. We encode the distributed Bell pairs into error-correcting codes prior to distillation, thereby making most efficient use of the noisy, distributed entanglement while only incurring a modest increase in memory footprint. We prove that our protocol achieves a constant expected ratio of physical to logical Bell pairs, for a given input error rate, and perform extensive numerical optimization to identify concrete code sequences with low overhead. We further analyze the possible improvements afforded by our scheme in the execution of concrete distributed algorithms. We find that our scheme outperforms existing quantum interconnect schemes by an order of magnitude, paving the way towards fast, distributed quantum computing.
148.
Yue Wang, Qi Zhao
Faster Quantum Algorithms with “Fractional”-Truncated Series Poster
2024.
Tags: Poster session Monday
@Poster{P24_156,
title = {Faster Quantum Algorithms with “Fractional”-Truncated Series},
author = {Yue Wang and Qi Zhao},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
149.
Alvin Gonzales, Anjala M Babu, Ji Liu, Zain Saleem, Mark Byrd
Fault Tolerant Quantum Error Mitigation Poster
2024.
Tags: Poster session Thursday
@Poster{P24_505,
title = {Fault Tolerant Quantum Error Mitigation},
author = {Alvin Gonzales and Anjala M Babu and Ji Liu and Zain Saleem and Mark Byrd},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
150.
Yaroslav Herasymenko, Anurag Anshu, Barbara Terhal, Jonas Helsen
Fermionic Hamiltonians without trivial low-energy states Poster
2024.
Tags: Poster session Thursday
@Poster{P24_385,
title = {Fermionic Hamiltonians without trivial low-energy states},
author = {Yaroslav Herasymenko and Anurag Anshu and Barbara Terhal and Jonas Helsen},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
151.
Ravishankar Ramanathan
Finite Device-Independent Extraction of a Block Min-Entropy Source against Quantum Adversaries Poster
2024.
Tags: Poster session Monday
@Poster{P24_145,
title = {Finite Device-Independent Extraction of a Block Min-Entropy Source against Quantum Adversaries},
author = {Ravishankar Ramanathan},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
152.
Jasminder Sidhu, Thomas Brougham, Duncan McArthur, Roberto Pousa, Daniel Oi
Finite key performance of satellite quantum key distribution under practical constraints Poster
2024.
Tags: Poster session Monday
@Poster{P24_204,
title = {Finite key performance of satellite quantum key distribution under practical constraints},
author = {Jasminder Sidhu and Thomas Brougham and Duncan McArthur and Roberto Pousa and Daniel Oi},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
153.
Zishen Li, Yuxiang Yang, Xinyue Long, Xiaodong Yang, Dawei Lu
Frequency estimation with time uncertainty in non-Markovian processes Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_517,
title = {Frequency estimation with time uncertainty in non-Markovian processes},
author = {Zishen Li and Yuxiang Yang and Xinyue Long and Xiaodong Yang and Dawei Lu},
url = {http://www.notyetavailable.com},
year = {2024},
date = {2024-01-01},
abstract = {Quantum control in the Markovian parameter estimation problem has been shown to improve precision scaling. However, the non-Markovian counterpart is much more complicated due to the memory effect of the environment. We ask whether an advantage gap exists between free-evolving and controlled non-Markovian processes in the context of quantum parameter estimation. We analyze a certain case where the system is subjected to a strong coupling environment. The desired parameter to be estimated is the system frequency. The whole experiment suffers from an unknown time uncertainty due to a bad clock. The experimenter can choose to estimate the system frequency with the free-evolving process or with the controlled process. We show that the latter has a better precision scaling than the former. This demonstrates that quantum control can improve quantum parameter estimation and increase robustness to certain hardware defects. Our work provides a new perspective on quantum parameter estimation with limited resources and may also shed light on the study of non-Markovian processes.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Quantum control in the Markovian parameter estimation problem has been shown to improve precision scaling. However, the non-Markovian counterpart is much more complicated due to the memory effect of the environment. We ask whether an advantage gap exists between free-evolving and controlled non-Markovian processes in the context of quantum parameter estimation. We analyze a certain case where the system is subjected to a strong coupling environment. The desired parameter to be estimated is the system frequency. The whole experiment suffers from an unknown time uncertainty due to a bad clock. The experimenter can choose to estimate the system frequency with the free-evolving process or with the controlled process. We show that the latter has a better precision scaling than the former. This demonstrates that quantum control can improve quantum parameter estimation and increase robustness to certain hardware defects. Our work provides a new perspective on quantum parameter estimation with limited resources and may also shed light on the study of non-Markovian processes.
154.
Paula Belzig
Fully quantum arbitrarily varying channel coding for entanglement-assisted communication Poster
2024.
Tags: Poster session Thursday
@Poster{P24_532,
title = {Fully quantum arbitrarily varying channel coding for entanglement-assisted communication},
author = {Paula Belzig},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
155.
Tom Holden-Dye, Lluis Masanes, Arijeet Pal, Christopher J Turner
Fundamental charges for dual-unitary circuits Poster
2024.
Tags: Poster session Thursday
@Poster{P24_303,
title = {Fundamental charges for dual-unitary circuits},
author = {Tom Holden-Dye and Lluis Masanes and Arijeet Pal and Christopher J Turner},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
156.
Junjing Xing, Tianfeng Feng, Zhaobing Fan, Haitao Ma, Kishor Bharti, Dax Koh, Yunlong Xiao
Fundamental Limitations on Communication over a Quantum Network Poster
2024.
Tags: Poster session Monday
@Poster{P24_161,
title = {Fundamental Limitations on Communication over a Quantum Network},
author = {Junjing Xing and Tianfeng Feng and Zhaobing Fan and Haitao Ma and Kishor Bharti and Dax Koh and Yunlong Xiao},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
157.
Paolo Abiuso, Pavel Sekatski, John Calsamiglia, Martí Perarnau-Llobet
Fundamental limits of metrology at thermal equilibrium Poster
2024.
Abstract | Tags: Poster session Monday | Links:
@Poster{P24_167,
title = {Fundamental limits of metrology at thermal equilibrium},
author = {Paolo Abiuso and Pavel Sekatski and John Calsamiglia and Martí Perarnau-Llobet},
url = {https://arxiv.org/pdf/2402.06582},
year = {2024},
date = {2024-01-01},
abstract = {We consider parameter estimation on generic systems at thermal equilibrium, assuming total or partial control on their finite-dimensional Hamiltonian.
We prove that, with no constraints on the control, no fundamental advantage is offered by quantum mechanics in terms of the maximum attainable Fisher Information, which is achieved with classical (i.e. commuting) interactions, and whose optimal scaling is Heisenberg-like, i.e. quadratic in the number of constituents of the system. A quantum advantage is recovered when assuming additional constraints on the control Hamiltonian, such as a minimum energy gap between the ground state and the first excited level. Also in such case the maximum sensitivity scales as N^2. We showcase our results on paradigmatic spin-chain models. Our findings represent a fundamental bound for measurement precision on systems at equilibrium, and provide insights to equilibration theory, many-body criticality and Hamiltonian learning.},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
We consider parameter estimation on generic systems at thermal equilibrium, assuming total or partial control on their finite-dimensional Hamiltonian.
We prove that, with no constraints on the control, no fundamental advantage is offered by quantum mechanics in terms of the maximum attainable Fisher Information, which is achieved with classical (i.e. commuting) interactions, and whose optimal scaling is Heisenberg-like, i.e. quadratic in the number of constituents of the system. A quantum advantage is recovered when assuming additional constraints on the control Hamiltonian, such as a minimum energy gap between the ground state and the first excited level. Also in such case the maximum sensitivity scales as N^2. We showcase our results on paradigmatic spin-chain models. Our findings represent a fundamental bound for measurement precision on systems at equilibrium, and provide insights to equilibration theory, many-body criticality and Hamiltonian learning.
We prove that, with no constraints on the control, no fundamental advantage is offered by quantum mechanics in terms of the maximum attainable Fisher Information, which is achieved with classical (i.e. commuting) interactions, and whose optimal scaling is Heisenberg-like, i.e. quadratic in the number of constituents of the system. A quantum advantage is recovered when assuming additional constraints on the control Hamiltonian, such as a minimum energy gap between the ground state and the first excited level. Also in such case the maximum sensitivity scales as N^2. We showcase our results on paradigmatic spin-chain models. Our findings represent a fundamental bound for measurement precision on systems at equilibrium, and provide insights to equilibration theory, many-body criticality and Hamiltonian learning.
158.
Alexandru Cojocaru, Juan Garay, Fang Song
Generalized Hybrid Search with Applications to Blockchain and Hash Function Security Poster
2024.
Tags: Poster session Monday
@Poster{P24_206,
title = {Generalized Hybrid Search with Applications to Blockchain and Hash Function Security},
author = {Alexandru Cojocaru and Juan Garay and Fang Song},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
159.
Li Gao, Mizanur Mizanur Rahaman
Generalized Stein's lemma for subalgebra entropies Poster
2024.
Tags: Poster session Monday
@Poster{P24_219,
title = {Generalized Stein's lemma for subalgebra entropies},
author = {Li Gao and Mizanur Mizanur Rahaman},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
160.
Wei-Lin Tu, Laurens Vanderstraeten, Norbert Schuch, Hyun-Yong Lee, Naoki Kawashima, Ji-Yao Chen
Generating Function for Projected Entangled-Pair States Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_473,
title = {Generating Function for Projected Entangled-Pair States},
author = {Wei-Lin Tu and Laurens Vanderstraeten and Norbert Schuch and Hyun-Yong Lee and Naoki Kawashima and Ji-Yao Chen},
url = {https://journals.aps.org/prxquantum/abstract/10.1103/PRXQuantum.5.010335 https://journals.aps.org/prb/abstract/10.1103/PhysRevB.103.205155},
year = {2024},
date = {2024-01-01},
abstract = {While the recent development for projected entangled-pair states (PEPS) has demonstrated its capability in studying the ground states of two-dimensional quantum many-body systems, properties of quasiparticle excitations are still cumbersome to compute. The key bottleneck for this computation is the summation of infinitely many tensor diagrams. The way we solve this problem is to represent the tensor diagram summations as a suitably defined generating function [1] for PEPS, as demonstrated in Figure 1. This is possible due to locality of many-body systems and the fact that low-energy excitations only contain one or few quasiparticles. Taking a physically motivated form for excited states, we show that relevant objects in determining excitations can be expressed as derivatives of a single tensor diagram and thus can be efficiently computed [2]. With excited states available, dynamical correlations can also be conveniently computed. We hope that, through the adoption of tensor network generating functions, many physical properties can be more easily obtained with the tensor network algorithm.
[1] W.-L. Tu, H.-K. Wu, N. Schuch, N. Kawashima, and J.-Y. Chen, Phys. Rev. B 103, 205155 (2021). [2] W.-L. Tu, L. Vanderstraeten, N. Schuch, H.-Y. Lee, N. Kawashima, and J.-Y. Chen, PRX Quantum 5, 010335 (2024).},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
While the recent development for projected entangled-pair states (PEPS) has demonstrated its capability in studying the ground states of two-dimensional quantum many-body systems, properties of quasiparticle excitations are still cumbersome to compute. The key bottleneck for this computation is the summation of infinitely many tensor diagrams. The way we solve this problem is to represent the tensor diagram summations as a suitably defined generating function [1] for PEPS, as demonstrated in Figure 1. This is possible due to locality of many-body systems and the fact that low-energy excitations only contain one or few quasiparticles. Taking a physically motivated form for excited states, we show that relevant objects in determining excitations can be expressed as derivatives of a single tensor diagram and thus can be efficiently computed [2]. With excited states available, dynamical correlations can also be conveniently computed. We hope that, through the adoption of tensor network generating functions, many physical properties can be more easily obtained with the tensor network algorithm.
[1] W.-L. Tu, H.-K. Wu, N. Schuch, N. Kawashima, and J.-Y. Chen, Phys. Rev. B 103, 205155 (2021). [2] W.-L. Tu, L. Vanderstraeten, N. Schuch, H.-Y. Lee, N. Kawashima, and J.-Y. Chen, PRX Quantum 5, 010335 (2024).
[1] W.-L. Tu, H.-K. Wu, N. Schuch, N. Kawashima, and J.-Y. Chen, Phys. Rev. B 103, 205155 (2021). [2] W.-L. Tu, L. Vanderstraeten, N. Schuch, H.-Y. Lee, N. Kawashima, and J.-Y. Chen, PRX Quantum 5, 010335 (2024).
161.
Dylan Lewis, Roeland Wiersema, Juan Carrasquilla, Sougato Bose
Geodesic Algorithm for Unitary Gate Design with Time-Independent Hamiltonians Poster
2024.
Tags: Poster session Thursday
@Poster{P24_346,
title = {Geodesic Algorithm for Unitary Gate Design with Time-Independent Hamiltonians},
author = {Dylan Lewis and Roeland Wiersema and Juan Carrasquilla and Sougato Bose},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
162.
Andres Camilo Granda Arango, Federico Holik, Giussepe Sergioli, Roberto Giuntini
Geometrical Aspects Of Resources Distribution In Quantum Random Circuits Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_467,
title = {Geometrical Aspects Of Resources Distribution In Quantum Random Circuits},
author = {Andres Camilo Granda Arango and Federico Holik and Giussepe Sergioli and Roberto Giuntini},
url = {https://arxiv.org/abs/2405.01650},
year = {2024},
date = {2024-01-01},
abstract = {Quantum computers have a great potential to provide a computational advantage in solving difficult problems that classical computers cannot effectively solve. The reason why quantum computers seem to be faster than their classical counterparts is not fully understood. Some works have suggested that
entanglement and coherence could be the reason for the quantum speed-up. But certain results, such as the Gottesmann-Knill theorem, suggest that the answer is more complicated. Recent studies point to contextuality.
In this work, we address the following question: how much of the different quantum resources can a particular device produce? By answering this question, we can understand its capabilities and better tailor its use to solve specific problems.
In this context, we study the resources produced by quantum random circuits using different sets of elementary gates. For this goal we use different quantifiers. We start with the degree of violation of the Svetlichny inequalities to quantify non-locality, we also use different entanglement measures such
as Tangle, Concurrency, Von Neumann Entropy, Negativity, etc. We first perform a theoretical
study based on numerical simulations using Qiskit and the Amazon Braket SDK, compare our theoretical results with experimental data from real quantum processors, and provide a quantitative evaluation of
their capabilities.
Our study contributes to the ongoing debate on the quantum advantage, the certification of quantum devices and shows that entanglement and non-locality are indeed important resources that can be exploited by quantum random circuits. We also show that it is possible to compare them between different devices and that entanglement disappears as the noise in the circuit increases.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Quantum computers have a great potential to provide a computational advantage in solving difficult problems that classical computers cannot effectively solve. The reason why quantum computers seem to be faster than their classical counterparts is not fully understood. Some works have suggested that
entanglement and coherence could be the reason for the quantum speed-up. But certain results, such as the Gottesmann-Knill theorem, suggest that the answer is more complicated. Recent studies point to contextuality.
In this work, we address the following question: how much of the different quantum resources can a particular device produce? By answering this question, we can understand its capabilities and better tailor its use to solve specific problems.
In this context, we study the resources produced by quantum random circuits using different sets of elementary gates. For this goal we use different quantifiers. We start with the degree of violation of the Svetlichny inequalities to quantify non-locality, we also use different entanglement measures such
as Tangle, Concurrency, Von Neumann Entropy, Negativity, etc. We first perform a theoretical
study based on numerical simulations using Qiskit and the Amazon Braket SDK, compare our theoretical results with experimental data from real quantum processors, and provide a quantitative evaluation of
their capabilities.
Our study contributes to the ongoing debate on the quantum advantage, the certification of quantum devices and shows that entanglement and non-locality are indeed important resources that can be exploited by quantum random circuits. We also show that it is possible to compare them between different devices and that entanglement disappears as the noise in the circuit increases.
entanglement and coherence could be the reason for the quantum speed-up. But certain results, such as the Gottesmann-Knill theorem, suggest that the answer is more complicated. Recent studies point to contextuality.
In this work, we address the following question: how much of the different quantum resources can a particular device produce? By answering this question, we can understand its capabilities and better tailor its use to solve specific problems.
In this context, we study the resources produced by quantum random circuits using different sets of elementary gates. For this goal we use different quantifiers. We start with the degree of violation of the Svetlichny inequalities to quantify non-locality, we also use different entanglement measures such
as Tangle, Concurrency, Von Neumann Entropy, Negativity, etc. We first perform a theoretical
study based on numerical simulations using Qiskit and the Amazon Braket SDK, compare our theoretical results with experimental data from real quantum processors, and provide a quantitative evaluation of
their capabilities.
Our study contributes to the ongoing debate on the quantum advantage, the certification of quantum devices and shows that entanglement and non-locality are indeed important resources that can be exploited by quantum random circuits. We also show that it is possible to compare them between different devices and that entanglement disappears as the noise in the circuit increases.
163.
Taehee Ko, Xiantao Li, Chunhao Wang
Ground Energy and Related Properties Estimation in Quantum Chemistry with Linear Dependence on the Number of Atoms Poster
2024.
Abstract | Tags: Poster session Monday | Links:
@Poster{P24_253,
title = {Ground Energy and Related Properties Estimation in Quantum Chemistry with Linear Dependence on the Number of Atoms},
author = {Taehee Ko and Xiantao Li and Chunhao Wang},
url = {https://arxiv.org/abs/2307.07067},
year = {2024},
date = {2024-01-01},
abstract = {Density-functional theory (DFT) has revolutionized computer simulations in chemistry and material science. A faithful implementation of the theory requires self-consistent calculations. However, this effort involves repeatedly diagonalizing the Hamiltonian, for which a classical algorithm typically requires a computational complexity that scales cubically with respect to the number of electrons. This limits DFT's applicability to large-scale problems with complex chemical environments and microstructures. This article presents a quantum algorithm that has a linear scaling with respect to the number of atoms, which is much smaller than the number of electrons. Our algorithm leverages the quantum singular value transformation (QSVT) to generate a quantum circuit to encode the density-matrix, and an estimation method for computing the output electron density. In addition, we present a randomized block coordinate fixed-point method to accelerate the self-consistent field calculations by reducing the number of components of the electron density that needs to be estimated. The proposed framework is accompanied by a rigorous error analysis that quantifies the function approximation error, the statistical fluctuation, and the iteration complexity. In particular, the analysis of our self-consistent iterations takes into account the measurement noise from the quantum circuit. These advancements offer a promising avenue for tackling large-scale DFT problems, enabling simulations of complex systems that were previously computationally infeasible.},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
Density-functional theory (DFT) has revolutionized computer simulations in chemistry and material science. A faithful implementation of the theory requires self-consistent calculations. However, this effort involves repeatedly diagonalizing the Hamiltonian, for which a classical algorithm typically requires a computational complexity that scales cubically with respect to the number of electrons. This limits DFT's applicability to large-scale problems with complex chemical environments and microstructures. This article presents a quantum algorithm that has a linear scaling with respect to the number of atoms, which is much smaller than the number of electrons. Our algorithm leverages the quantum singular value transformation (QSVT) to generate a quantum circuit to encode the density-matrix, and an estimation method for computing the output electron density. In addition, we present a randomized block coordinate fixed-point method to accelerate the self-consistent field calculations by reducing the number of components of the electron density that needs to be estimated. The proposed framework is accompanied by a rigorous error analysis that quantifies the function approximation error, the statistical fluctuation, and the iteration complexity. In particular, the analysis of our self-consistent iterations takes into account the measurement noise from the quantum circuit. These advancements offer a promising avenue for tackling large-scale DFT problems, enabling simulations of complex systems that were previously computationally infeasible.
164.
Guoding Liu, Ziyi Xie, Zitai Xu, Xiongfeng Ma
Group Twirling and Noise Tailoring for Multi-Qubit-Controlled Phase Gates Poster
2024.
Abstract | Tags: Poster session Monday | Links:
@Poster{P24_49,
title = {Group Twirling and Noise Tailoring for Multi-Qubit-Controlled Phase Gates},
author = {Guoding Liu and Ziyi Xie and Zitai Xu and Xiongfeng Ma},
url = {https://arxiv.org/abs/2309.15651},
year = {2024},
date = {2024-01-01},
abstract = {Group twirling is crucial in quantum information processing, particularly in randomized benchmarking and randomized compiling. While protocols based on Pauli twirling have been effectively crafted to transform arbitrary noise channels into Pauli channels for Clifford gates — thereby facilitating efficient benchmarking and mitigating worst-case errors — the lack of practical twirling groups for multi-qubit non-Clifford gates remains a challenge. To address this gap, we study the issue of finding twirling groups for generic quantum gates, focusing on a widely used circuit structure in randomized benchmarking or randomized compiling. Specifically, for multi-qubit-controlled phase gates, which are essential in quantum algorithms and directly implementable in practice, we determine optimal twirling groups within the realm of classically replaceable unitary operations. Contrasting with the local Pauli twirling group for Clifford gates, the optimal groups for such gates contain nonlocal operations, highlighting the overhead of tailoring noise in global non-Clifford contexts. We design new benchmarking procedures for multi-qubit controlled phase gates based on the optimal twirling groups. Our simulation results show that our scheme can improve the precision and accuracy of benchmarking in small-scale systems.},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
Group twirling is crucial in quantum information processing, particularly in randomized benchmarking and randomized compiling. While protocols based on Pauli twirling have been effectively crafted to transform arbitrary noise channels into Pauli channels for Clifford gates — thereby facilitating efficient benchmarking and mitigating worst-case errors — the lack of practical twirling groups for multi-qubit non-Clifford gates remains a challenge. To address this gap, we study the issue of finding twirling groups for generic quantum gates, focusing on a widely used circuit structure in randomized benchmarking or randomized compiling. Specifically, for multi-qubit-controlled phase gates, which are essential in quantum algorithms and directly implementable in practice, we determine optimal twirling groups within the realm of classically replaceable unitary operations. Contrasting with the local Pauli twirling group for Clifford gates, the optimal groups for such gates contain nonlocal operations, highlighting the overhead of tailoring noise in global non-Clifford contexts. We design new benchmarking procedures for multi-qubit controlled phase gates based on the optimal twirling groups. Our simulation results show that our scheme can improve the precision and accuracy of benchmarking in small-scale systems.
165.
Andrew Zhao, Akimasa Miyake
Group-theoretic error mitigation enabled by classical shadows and symmetries Poster
2024.
Tags: Poster session Thursday
@Poster{P24_402,
title = {Group-theoretic error mitigation enabled by classical shadows and symmetries},
author = {Andrew Zhao and Akimasa Miyake},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
166.
Harshdeep Singh, Sonjoy Majumder, Sabyashachi Mishra
H ̈uckel Molecular Orbital Theory on a Quantum Computer: A Scalable System-Agnostic Variational Implementation with Compact Encoding Poster
2024.
Tags: Poster session Monday
@Poster{P24_163,
title = {H ̈uckel Molecular Orbital Theory on a Quantum Computer: A Scalable System-Agnostic Variational Implementation with Compact Encoding},
author = {Harshdeep Singh and Sonjoy Majumder and Sabyashachi Mishra},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
167.
Nazli Ugur Koyluoglu, Johannes Feldmeier, Nishad Maskara, Mikhail Lukin
Hamiltonian engineering of multi-body interactions in periodically driven Rydberg atom arrays Poster
2024.
Abstract | Tags: Poster session Thursday
@Poster{P24_442,
title = {Hamiltonian engineering of multi-body interactions in periodically driven Rydberg atom arrays},
author = {Nazli Ugur Koyluoglu and Johannes Feldmeier and Nishad Maskara and Mikhail Lukin},
year = {2024},
date = {2024-01-01},
abstract = {A key challenge of programmable quantum simulation is expanding the class of many-body Hamiltonians that can be realized on current devices. In particular, realizing complex many-body phenomena such as dynamical lattice gauge theories (LGTs) requires implementation of multi-body interactions that are typically not directly available in natural Hamiltonians. We introduce and analyze a novel Hamiltonian engineering technique based on time-dependent control. Our approach leverages controlled perturbations around periodic many-body trajectories as a resource for operator spreading, and uses these time-evolved operators as a basis to realize a broad class of complex multi-body interactions with tunable coefficients. We apply this framework to the neutral atom array platform, to engineer dynamics within the constrained "Rydberg-blockaded" subspace in two settings. First, we show how blockade-consistent exchange interactions on a one-dimensional chain can be engineered, enabling exploration of novel phases with emergent particle number conservation and interesting dynamics of multi-partite entanglement. Second, we demonstrate our ability to implement multi-body ring-exchange interactions in a two-dimensional setting, and present a realistic proposal for investigating unexplored regimes in non-equilibrium dynamics of 2D LGTs.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
A key challenge of programmable quantum simulation is expanding the class of many-body Hamiltonians that can be realized on current devices. In particular, realizing complex many-body phenomena such as dynamical lattice gauge theories (LGTs) requires implementation of multi-body interactions that are typically not directly available in natural Hamiltonians. We introduce and analyze a novel Hamiltonian engineering technique based on time-dependent control. Our approach leverages controlled perturbations around periodic many-body trajectories as a resource for operator spreading, and uses these time-evolved operators as a basis to realize a broad class of complex multi-body interactions with tunable coefficients. We apply this framework to the neutral atom array platform, to engineer dynamics within the constrained "Rydberg-blockaded" subspace in two settings. First, we show how blockade-consistent exchange interactions on a one-dimensional chain can be engineered, enabling exploration of novel phases with emergent particle number conservation and interesting dynamics of multi-partite entanglement. Second, we demonstrate our ability to implement multi-body ring-exchange interactions in a two-dimensional setting, and present a realistic proposal for investigating unexplored regimes in non-equilibrium dynamics of 2D LGTs.
168.
Nolan Coble, Matthew Coudron, Jon Nelson, Seyed Sajjad Nezhadi
Hamiltonians whose low-energy states require Ω(n) T gates Poster
2024.
Tags: Poster session Thursday
@Poster{P24_397,
title = {Hamiltonians whose low-energy states require Ω(n) T gates},
author = {Nolan Coble and Matthew Coudron and Jon Nelson and Seyed Sajjad Nezhadi},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
169.
Kaito Wada, Naoki Yamamoto, Nobuyuki Yoshioka
Heisenberg-limited quantum algorithm for multiple observables estimation Poster
2024.
Tags: Poster session Thursday
@Poster{P24_447,
title = {Heisenberg-limited quantum algorithm for multiple observables estimation},
author = {Kaito Wada and Naoki Yamamoto and Nobuyuki Yoshioka},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
170.
Qiushi Liu, Yuxiang Yang
Heisenberg-Limited Sequential Quantum Metrology without Ancilla Poster
2024.
Tags: Poster session Thursday
@Poster{P24_320,
title = {Heisenberg-Limited Sequential Quantum Metrology without Ancilla},
author = {Qiushi Liu and Yuxiang Yang},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
171.
Lidia Ruiz, Juan Carlos García Escartín
Heuristics for routing and wavelength assignment in hybrid networks with classical and quantum signals Poster
2024.
Abstract | Tags: Poster session Monday | Links:
@Poster{P24_224,
title = {Heuristics for routing and wavelength assignment in hybrid networks with classical and quantum signals},
author = {Lidia Ruiz and Juan Carlos García Escartín},
url = {https://arxiv.org/abs/2311.10474},
year = {2024},
date = {2024-01-01},
abstract = {Quantum Key Distribution has become a mature quantum technology that has outgrown dedicated links and is ready to be incorporated into the classical infrastructure. In this scenario with multiple potential nodes, it is crucial having efficient ways to allocate the network resources between all the potential users. We propose a simple method for routing and wavelength assignment in wavelength multiplexed networks in which classical and quantum channels coexist. The proposed heuristics take into account the specific requirements of quantum key distribution and focus on keeping at bay the contamination of the quantum channels by photons coming from the classical signals by non-linear processes, among others. These heuristics reduce the shared path between classical and quantum channels and improve the signal-to-noise ratio in the quantum channels, improving their quantum key rate. We compare the results to the usual classical RWA approach.},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
Quantum Key Distribution has become a mature quantum technology that has outgrown dedicated links and is ready to be incorporated into the classical infrastructure. In this scenario with multiple potential nodes, it is crucial having efficient ways to allocate the network resources between all the potential users. We propose a simple method for routing and wavelength assignment in wavelength multiplexed networks in which classical and quantum channels coexist. The proposed heuristics take into account the specific requirements of quantum key distribution and focus on keeping at bay the contamination of the quantum channels by photons coming from the classical signals by non-linear processes, among others. These heuristics reduce the shared path between classical and quantum channels and improve the signal-to-noise ratio in the quantum channels, improving their quantum key rate. We compare the results to the usual classical RWA approach.
172.
Kaushiki Mukherjee, Soma Mandal, Tapaswini Patro, Nirman Ganguly
Hidden Non $n$-locality In Linear Networks Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_538,
title = {Hidden Non $n$-locality In Linear Networks},
author = {Kaushiki Mukherjee and Soma Mandal and Tapaswini Patro and Nirman Ganguly},
url = {https://doi.org/10.48550/arXiv.2303.08699},
year = {2024},
date = {2024-01-01},
abstract = {We study hidden nonlocality in a linear network with independent sources. In the usual paradigm of Bell nonlocality, there are certain states which exhibit nonlocality only after the application of suitable local filtering operations, which, in turn, are some special stochastic local operations assisted with classical communication (SLOCC). In the present work, we introduce the notion of hidden non n-locality. The notion is detailed using a bilocal network. We provide instances of hidden nonbilocality and nontrilocality, where we notice quite intriguingly that nonbilocality is observed even when one of the sources distributes a mixed two-qubit separable state. Furthermore, a characterization of hidden nonbilocality is also provided in terms of the Bloch-Fano decomposition, wherein we conjecture that, to witness hidden nonbilocality, one of the two states (used by the sources) must have nonnull local Bloch vectors. Noise is inevitable in practical scenarios, which makes it imperative to study any possible method to enhance the possibility of detecting nonclassicality in the presence of noise in the network. We find that local filtering enhances the robustness to noise, which we demonstrate using bit-flip and amplitude-damping channels.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
We study hidden nonlocality in a linear network with independent sources. In the usual paradigm of Bell nonlocality, there are certain states which exhibit nonlocality only after the application of suitable local filtering operations, which, in turn, are some special stochastic local operations assisted with classical communication (SLOCC). In the present work, we introduce the notion of hidden non n-locality. The notion is detailed using a bilocal network. We provide instances of hidden nonbilocality and nontrilocality, where we notice quite intriguingly that nonbilocality is observed even when one of the sources distributes a mixed two-qubit separable state. Furthermore, a characterization of hidden nonbilocality is also provided in terms of the Bloch-Fano decomposition, wherein we conjecture that, to witness hidden nonbilocality, one of the two states (used by the sources) must have nonnull local Bloch vectors. Noise is inevitable in practical scenarios, which makes it imperative to study any possible method to enhance the possibility of detecting nonclassicality in the presence of noise in the network. We find that local filtering enhances the robustness to noise, which we demonstrate using bit-flip and amplitude-damping channels.
173.
Philip Taranto, Thomas Elliot, Simon Milz
Hidden Quantum Memory: Is Memory There When Somebody Looks? Poster
2024.
Tags: Poster session Monday
@Poster{P24_55,
title = {Hidden Quantum Memory: Is Memory There When Somebody Looks?},
author = {Philip Taranto and Thomas Elliot and Simon Milz},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
174.
Petr Ivashkov, Gideon Uchehara, Liang Jiang, Derek Wang, Alireza Seif
High-fidelity, multi-qubit generalized measurements with dynamic circuits Poster
2024.
Abstract | Tags: Poster session Monday | Links:
@Poster{P24_122,
title = {High-fidelity, multi-qubit generalized measurements with dynamic circuits},
author = {Petr Ivashkov and Gideon Uchehara and Liang Jiang and Derek Wang and Alireza Seif},
url = {https://arxiv.org/abs/2312.14087},
year = {2024},
date = {2024-01-01},
abstract = {Generalized measurements, also called positive operator-valued measures (POVMs), can offer advantages over projective measurements in various quantum information tasks. Here, we realize a generalized measurement of one and two superconducting qubits with high fidelity and in a single experimental setting. To do so, we propose a hybrid method, the "Naimark-terminated binary tree," based on a hybridization of Naimark's dilation and binary tree techniques that leverages emerging hardware capabilities for mid-circuit measurements and feed-forward control. Furthermore, we showcase a highly effective use of approximate compiling to enhance POVM fidelity in noisy conditions. We argue that our hybrid method scales better toward larger system sizes than its constituent methods and demonstrate its advantage by performing detector tomography of symmetric, informationally complete POVM (SIC-POVM). Detector fidelity is further improved through a composite error mitigation strategy that incorporates twirling and a newly devised conditional readout error mitigation. Looking forward, we expect improvements in approximate compilation and hardware noise for dynamic circuits to enable generalized measurements of larger multi-qubit POVMs on superconducting qubits.},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
Generalized measurements, also called positive operator-valued measures (POVMs), can offer advantages over projective measurements in various quantum information tasks. Here, we realize a generalized measurement of one and two superconducting qubits with high fidelity and in a single experimental setting. To do so, we propose a hybrid method, the "Naimark-terminated binary tree," based on a hybridization of Naimark's dilation and binary tree techniques that leverages emerging hardware capabilities for mid-circuit measurements and feed-forward control. Furthermore, we showcase a highly effective use of approximate compiling to enhance POVM fidelity in noisy conditions. We argue that our hybrid method scales better toward larger system sizes than its constituent methods and demonstrate its advantage by performing detector tomography of symmetric, informationally complete POVM (SIC-POVM). Detector fidelity is further improved through a composite error mitigation strategy that incorporates twirling and a newly devised conditional readout error mitigation. Looking forward, we expect improvements in approximate compilation and hardware noise for dynamic circuits to enable generalized measurements of larger multi-qubit POVMs on superconducting qubits.
175.
Mohammed Barhoush, Louis Salvail
How to Sign Quantum Messages Poster
2024.
Tags: Poster session Monday
@Poster{P24_193,
title = {How to Sign Quantum Messages},
author = {Mohammed Barhoush and Louis Salvail},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
176.
Nicholas Hunter-Jones, Scott Aaronson, Jonas Haferkamp
Ideal random quantum circuits pass the LXEB test Poster
2024.
Tags: Poster session Thursday
@Poster{P24_420,
title = {Ideal random quantum circuits pass the LXEB test},
author = {Nicholas Hunter-Jones and Scott Aaronson and Jonas Haferkamp},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
177.
Jaroslaw Pawlowski
Identification of quantum entanglement with supervised and unsupervised machine-learning models Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_396,
title = {Identification of quantum entanglement with supervised and unsupervised machine-learning models},
author = {Jaroslaw Pawlowski},
url = {https://arxiv.org/abs/2210.07410 https://arxiv.org/abs/2307.11091},
year = {2024},
date = {2024-01-01},
abstract = {Quantum entanglement is a fundamental property commonly used in various quantum information protocols and algorithms. Nonetheless, the problem of identifying entanglement has still not reached a general solution for systems larger than 2x3. Modern deep learning (DL) architectures, that use multilayer neural networks (NNs), have enabled unprecedented achievements in various domains like computer vision or natural language processing. Convolutional neural networks (CNNs) with many hidden layers and complex network structures are extremely powerful in feature learning: they easily outperform classical algorithms in image classification, object detection, or face recognition tasks. In quantum physics, one natural application of DL involves the study of quantum many-body systems, where the extreme complexity of many-body states often makes theoretical analysis intractable. Nonetheless, employment of machine learning in physics for entangled state representations is typically focused on more traditional architectures such as Boltzmann machines or fully connected NNs. However, there are recent signals that deep CNNs can better represent highly entangled quantum systems. I will present our recent research on entanglement detection using modern deep neural network architectures (CNNs, Siamese networks, autoencoders), closer to the state-of-the-art approaches in DL, trained in a supervised and unsupervised manner and compare them in terms of their suitability for building robust entanglement detectors.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Quantum entanglement is a fundamental property commonly used in various quantum information protocols and algorithms. Nonetheless, the problem of identifying entanglement has still not reached a general solution for systems larger than 2x3. Modern deep learning (DL) architectures, that use multilayer neural networks (NNs), have enabled unprecedented achievements in various domains like computer vision or natural language processing. Convolutional neural networks (CNNs) with many hidden layers and complex network structures are extremely powerful in feature learning: they easily outperform classical algorithms in image classification, object detection, or face recognition tasks. In quantum physics, one natural application of DL involves the study of quantum many-body systems, where the extreme complexity of many-body states often makes theoretical analysis intractable. Nonetheless, employment of machine learning in physics for entangled state representations is typically focused on more traditional architectures such as Boltzmann machines or fully connected NNs. However, there are recent signals that deep CNNs can better represent highly entangled quantum systems. I will present our recent research on entanglement detection using modern deep neural network architectures (CNNs, Siamese networks, autoencoders), closer to the state-of-the-art approaches in DL, trained in a supervised and unsupervised manner and compare them in terms of their suitability for building robust entanglement detectors.
178.
Hannes Leipold, Federico Spedalieri, Stuart Hadfield, Eleanor Rieffel
Imposing Constraints on Driver Hamiltonians and Mixing Operators: From Theory to Practical Implementation Poster
2024.
Abstract | Tags: Poster session Thursday
@Poster{P24_399,
title = {Imposing Constraints on Driver Hamiltonians and Mixing Operators: From Theory to Practical Implementation},
author = {Hannes Leipold and Federico Spedalieri and Stuart Hadfield and Eleanor Rieffel},
year = {2024},
date = {2024-01-01},
abstract = {Constructing Driver Hamiltonians and Mixing Operators such that they satisfy constraints is an important ansatz construction for many quantum algorithms. In this manuscript, we give general algebraic expressions for finding Hamiltonian terms and analogously unitary primitives, that satisfy constraint embeddings and use these to give complexity characterizations of the related problems. While finding operators with classical symmetries is proven to be NP-Complete in the general case, we also give an algorithmic procedure with worse-case polynomial runtime to find any operators with a constant locality bound; a useful result since many symmetries imposed admit local operators to enforce them in practice. We then give algorithmic procedures to turn these algebraic primitives into Hamiltonian drivers and unitary mixers that can be used for Constrained Quantum Annealing (CQA) and Quantum Alternating Operator Ansatz (QAOA) constructions by tackling practical problems related to finding an appropriate set of reduced generators and defining corresponding drivers and mixers accordingly. We then apply these concepts to the construction of ansaetze for 1-in-3 SAT instances. We consider the ordinary x-mixer QAOA, a novel QAOA approach based on the maximally disjoint subset, and a QAOA approach based on the disjoint subset as well as higher order constraint satisfaction terms. We empirically benchmark these approaches on instances sized between 12 and 22, showing the best relative performance for the tailored ansaetze and that exponential curve fits on the results are consistent with a quadratic speedup by utilizing alternative ansaetze to the x-mixer. We provide very general algorithmic prescriptions for finding driver or mixing terms that satisfy embedded constraints that can be utilized to probe quantum speedups for constraints problems with linear, quadratic, or even higher order polynomial constraints.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
Constructing Driver Hamiltonians and Mixing Operators such that they satisfy constraints is an important ansatz construction for many quantum algorithms. In this manuscript, we give general algebraic expressions for finding Hamiltonian terms and analogously unitary primitives, that satisfy constraint embeddings and use these to give complexity characterizations of the related problems. While finding operators with classical symmetries is proven to be NP-Complete in the general case, we also give an algorithmic procedure with worse-case polynomial runtime to find any operators with a constant locality bound; a useful result since many symmetries imposed admit local operators to enforce them in practice. We then give algorithmic procedures to turn these algebraic primitives into Hamiltonian drivers and unitary mixers that can be used for Constrained Quantum Annealing (CQA) and Quantum Alternating Operator Ansatz (QAOA) constructions by tackling practical problems related to finding an appropriate set of reduced generators and defining corresponding drivers and mixers accordingly. We then apply these concepts to the construction of ansaetze for 1-in-3 SAT instances. We consider the ordinary x-mixer QAOA, a novel QAOA approach based on the maximally disjoint subset, and a QAOA approach based on the disjoint subset as well as higher order constraint satisfaction terms. We empirically benchmark these approaches on instances sized between 12 and 22, showing the best relative performance for the tailored ansaetze and that exponential curve fits on the results are consistent with a quadratic speedup by utilizing alternative ansaetze to the x-mixer. We provide very general algorithmic prescriptions for finding driver or mixing terms that satisfy embedded constraints that can be utilized to probe quantum speedups for constraints problems with linear, quadratic, or even higher order polynomial constraints.
179.
Daniel Grier, Sihan Liu, Gaurav Mahajan
Improved classical shadows from local symmetries in the Schur basis Poster
2024.
Abstract | Tags: Poster session Thursday | Links:
@Poster{P24_519,
title = {Improved classical shadows from local symmetries in the Schur basis},
author = {Daniel Grier and Sihan Liu and Gaurav Mahajan},
url = {https://arxiv.org/pdf/2405.09525},
year = {2024},
date = {2024-01-01},
abstract = {We study the sample complexity of the classical shadows task: what is the fewest number of
copies of an unknown state you need to measure to predict expected values with respect to some
class of observables? Large joint measurements are likely required in order to minimize sample
complexity, but previous joint measurement protocols only work when the unknown state is pure.
We present the first joint measurement protocol for classical shadows whose sample complexity
scales with the rank of the unknown state. In particular we prove O( sqrt(rB) / eps^2 ) samples suffice,
where r is the rank of the state, B is a bound on the squared Frobenius norm of the observables,
and eps is the target accuracy. In the low-rank regime, this is a nearly quadratic advantage over
traditional approaches that use single-copy measurements.
We present several intermediate results that may be of independent interest: a solution to
a new formulation of classical shadows that captures functions of non-identical input states; a
generalization of a “nice” Schur basis used for optimal qubit purification and quantum majority
vote; and a measurement strategy that allows us to use local symmetries in the Schur basis to avoid intractable Weingarten calculations in the analysis.},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
We study the sample complexity of the classical shadows task: what is the fewest number of
copies of an unknown state you need to measure to predict expected values with respect to some
class of observables? Large joint measurements are likely required in order to minimize sample
complexity, but previous joint measurement protocols only work when the unknown state is pure.
We present the first joint measurement protocol for classical shadows whose sample complexity
scales with the rank of the unknown state. In particular we prove O( sqrt(rB) / eps^2 ) samples suffice,
where r is the rank of the state, B is a bound on the squared Frobenius norm of the observables,
and eps is the target accuracy. In the low-rank regime, this is a nearly quadratic advantage over
traditional approaches that use single-copy measurements.
We present several intermediate results that may be of independent interest: a solution to
a new formulation of classical shadows that captures functions of non-identical input states; a
generalization of a “nice” Schur basis used for optimal qubit purification and quantum majority
vote; and a measurement strategy that allows us to use local symmetries in the Schur basis to avoid intractable Weingarten calculations in the analysis.
copies of an unknown state you need to measure to predict expected values with respect to some
class of observables? Large joint measurements are likely required in order to minimize sample
complexity, but previous joint measurement protocols only work when the unknown state is pure.
We present the first joint measurement protocol for classical shadows whose sample complexity
scales with the rank of the unknown state. In particular we prove O( sqrt(rB) / eps^2 ) samples suffice,
where r is the rank of the state, B is a bound on the squared Frobenius norm of the observables,
and eps is the target accuracy. In the low-rank regime, this is a nearly quadratic advantage over
traditional approaches that use single-copy measurements.
We present several intermediate results that may be of independent interest: a solution to
a new formulation of classical shadows that captures functions of non-identical input states; a
generalization of a “nice” Schur basis used for optimal qubit purification and quantum majority
vote; and a measurement strategy that allows us to use local symmetries in the Schur basis to avoid intractable Weingarten calculations in the analysis.
180.
André Juan Ferreira-Martins, Natansh Mathur, Skander Kazdaghli, Sohum Thakkar, Iordanis Kerenidis, Samuraí Brito
Improved Financial Forecasting via Quantum Machine Learning Poster
2024.
Tags: Poster session Thursday
@Poster{P24_523,
title = {Improved Financial Forecasting via Quantum Machine Learning},
author = {André Juan Ferreira-Martins and Natansh Mathur and Skander Kazdaghli and Sohum Thakkar and Iordanis Kerenidis and Samuraí Brito},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Thursday},
pubstate = {published},
tppubtype = {Poster}
}
181.
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}
}
182.
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}
}
183.
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.
184.
Maria Flors Mor Ruiz, Wolfgang Dür
Influence of noise in entanglement-based quantum networks Poster
2024.
Tags: Poster session Monday
@Poster{P24_106,
title = {Influence of noise in entanglement-based quantum networks},
author = {Maria Flors Mor Ruiz and Wolfgang Dür},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
185.
Mariami Gachechiladze, Prabhav Jain, Nikolai Miklin
Information causality as a tool for bounding the set of quantum correlations Poster
2024.
Tags: Outstanding Poster, Poster session Monday
@Poster{P24_109,
title = {Information causality as a tool for bounding the set of quantum correlations},
author = {Mariami Gachechiladze and Prabhav Jain and Nikolai Miklin},
year = {2024},
date = {2024-01-01},
keywords = {Outstanding Poster, Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
186.
Lorenzo Giannelli, Giulio Chiribella
Information-theoretic derivation of energy and speed bounds Poster
2024.
Tags: Poster session Monday
@Poster{P24_160,
title = {Information-theoretic derivation of energy and speed bounds},
author = {Lorenzo Giannelli and Giulio Chiribella},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
187.
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}
}
188.
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}
}
189.
Saheli Mukherjee, Bivas Mallick, Sravani Yanamandra, Samyadeb Bhattacharya, Ananda Gopal Maity
Interplay between the Hilbert-space dimension of the control system and the memory induced by quantum Poster
2024.
Tags: Poster session Monday
@Poster{P24_169,
title = {Interplay between the Hilbert-space dimension of the control system and the memory induced by quantum},
author = {Saheli Mukherjee and Bivas Mallick and Sravani Yanamandra and Samyadeb Bhattacharya and Ananda Gopal Maity},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
190.
Lorcan Conlon, Falk Eilenberger, Jin Ming Koh, Biveen Shajilal, Jasminder Sidhu, Ping Koy Lam, Syed Assad
Investigations into the attainability of the ultimate limits in quantum state discrimination Poster
2024.
Abstract | Tags: Poster session Monday | Links:
@Poster{P24_103,
title = {Investigations into the attainability of the ultimate limits in quantum state discrimination},
author = {Lorcan Conlon and Falk Eilenberger and Jin Ming Koh and Biveen Shajilal and Jasminder Sidhu and Ping Koy Lam and Syed Assad},
url = {https://arxiv.org/abs/2302.08882},
year = {2024},
date = {2024-01-01},
abstract = {One of the fundamental tenets of quantum mechanics is that non-orthogonal states cannot be distinguished perfectly. When distinguishing multiple copies of a mixed quantum state, a collective measurement, which generates entanglement between the different copies of the unknown state, can achieve a lower error probability than non-entangling measurements. The error probability that can be attained using a collective measurement on M copies of the unknown state is given by the M-copy Helstrom bound. In the limit where we can perform a collective measurement on asymptotically many copies of the quantum state, the quantum Chernoff bound gives the error exponent. We first examine the conditions for when collective measurements offer an advantage over non-entangling measurements. Surprisingly, we find that whether collective measurements offer an advantage or not can depend on the prior probabilities of the different states. Using this, we implement on a superconducting quantum computer, the first case of a collective measurement surpassing the limits set by non-entangling measurements [1].
We then examine the attainability of the quantum Chernoff bound. Specifically we ask whether the asymptotic error exponent can be reached with a measurement on any finite number of copies and at what rate does the error tend to the asymptotic limit. We find analytic expressions for the Helstrom bound for arbitrary many copies of the unknown state in several simple qubit examples. Using these analytic expressions, we investigate how the attainable error exponent changes as we allow collective measurements on finite numbers of copies of the quantum state. Finally, using parameterised quantum circuits, we investigate the necessary conditions to saturate the M-copy Helstrom bound [1] Conlon, L. O., Eilenberger, F., Lam, P. K. & Assad, S. M. Discriminating mixed qubit states with collective measurements. Communications Physics 6, 337 (2023).},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
One of the fundamental tenets of quantum mechanics is that non-orthogonal states cannot be distinguished perfectly. When distinguishing multiple copies of a mixed quantum state, a collective measurement, which generates entanglement between the different copies of the unknown state, can achieve a lower error probability than non-entangling measurements. The error probability that can be attained using a collective measurement on M copies of the unknown state is given by the M-copy Helstrom bound. In the limit where we can perform a collective measurement on asymptotically many copies of the quantum state, the quantum Chernoff bound gives the error exponent. We first examine the conditions for when collective measurements offer an advantage over non-entangling measurements. Surprisingly, we find that whether collective measurements offer an advantage or not can depend on the prior probabilities of the different states. Using this, we implement on a superconducting quantum computer, the first case of a collective measurement surpassing the limits set by non-entangling measurements [1].
We then examine the attainability of the quantum Chernoff bound. Specifically we ask whether the asymptotic error exponent can be reached with a measurement on any finite number of copies and at what rate does the error tend to the asymptotic limit. We find analytic expressions for the Helstrom bound for arbitrary many copies of the unknown state in several simple qubit examples. Using these analytic expressions, we investigate how the attainable error exponent changes as we allow collective measurements on finite numbers of copies of the quantum state. Finally, using parameterised quantum circuits, we investigate the necessary conditions to saturate the M-copy Helstrom bound [1] Conlon, L. O., Eilenberger, F., Lam, P. K. & Assad, S. M. Discriminating mixed qubit states with collective measurements. Communications Physics 6, 337 (2023).
We then examine the attainability of the quantum Chernoff bound. Specifically we ask whether the asymptotic error exponent can be reached with a measurement on any finite number of copies and at what rate does the error tend to the asymptotic limit. We find analytic expressions for the Helstrom bound for arbitrary many copies of the unknown state in several simple qubit examples. Using these analytic expressions, we investigate how the attainable error exponent changes as we allow collective measurements on finite numbers of copies of the quantum state. Finally, using parameterised quantum circuits, we investigate the necessary conditions to saturate the M-copy Helstrom bound [1] Conlon, L. O., Eilenberger, F., Lam, P. K. & Assad, S. M. Discriminating mixed qubit states with collective measurements. Communications Physics 6, 337 (2023).
191.
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.
192.
Timo Eckstein, Refik Mansuroglu, Piotr Czarnik, Jian-Xin Zhu, Michael Hartmann, Lukasz Cincio, Andrew Sornborger, Zoe Holmes
Large-scale simulations of Floquet physics on near-term quantum computers Poster
2024.
Tags: Poster session Monday
@Poster{P24_270,
title = {Large-scale simulations of Floquet physics on near-term quantum computers},
author = {Timo Eckstein and Refik Mansuroglu and Piotr Czarnik and Jian-Xin Zhu and Michael Hartmann and Lukasz Cincio and Andrew Sornborger and Zoe Holmes},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
193.
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.
194.
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.
195.
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.
196.
Chirag Wadhwa, Mina Doosti
Learning Quantum Processes with Quantum Statistical Queries Poster
2024.
Tags: Poster session Monday
@Poster{P24_24,
title = {Learning Quantum Processes with Quantum Statistical Queries},
author = {Chirag Wadhwa and Mina Doosti},
year = {2024},
date = {2024-01-01},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
197.
Haimeng Zhao, Laura Lewis, Ishaan Kannan, Yihui Quek, Hsin-Yuan Huang, Matthias Caro
Learning quantum states and unitaries of bounded gate complexity Poster
2024.
Abstract | Tags: Poster session Monday | Links:
@Poster{P24_239,
title = {Learning quantum states and unitaries of bounded gate complexity},
author = {Haimeng Zhao and Laura Lewis and Ishaan Kannan and Yihui Quek and Hsin-Yuan Huang and Matthias Caro},
url = {https://arxiv.org/abs/2310.19882},
year = {2024},
date = {2024-01-01},
abstract = {While quantum state tomography is notoriously hard, most states hold little interest to practically-minded tomographers. Given that states and unitaries appearing in Nature are of bounded gate complexity, it is natural to ask if efficient learning becomes possible. In this work, we prove that to learn a state generated by a quantum circuit with G two-qubit gates to a small trace distance, a sample complexity scaling linearly in G is necessary and sufficient. We also prove that the optimal query complexity to learn a unitary generated by G gates to a small average-case error scales linearly in G. While sample-efficient learning can be achieved, we show that under reasonable cryptographic conjectures, the computational complexity for learning states and unitaries of gate complexity G must scale exponentially in G. We illustrate how these results establish fundamental limitations on the expressivity of quantum machine learning models and provide new perspectives on no-free-lunch theorems in unitary learning. Together, our results answer how the complexity of learning quantum states and unitaries relate to the complexity of creating these states and unitaries.},
keywords = {Poster session Monday},
pubstate = {published},
tppubtype = {Poster}
}
While quantum state tomography is notoriously hard, most states hold little interest to practically-minded tomographers. Given that states and unitaries appearing in Nature are of bounded gate complexity, it is natural to ask if efficient learning becomes possible. In this work, we prove that to learn a state generated by a quantum circuit with G two-qubit gates to a small trace distance, a sample complexity scaling linearly in G is necessary and sufficient. We also prove that the optimal query complexity to learn a unitary generated by G gates to a small average-case error scales linearly in G. While sample-efficient learning can be achieved, we show that under reasonable cryptographic conjectures, the computational complexity for learning states and unitaries of gate complexity G must scale exponentially in G. We illustrate how these results establish fundamental limitations on the expressivity of quantum machine learning models and provide new perspectives on no-free-lunch theorems in unitary learning. Together, our results answer how the complexity of learning quantum states and unitaries relate to the complexity of creating these states and unitaries.
198.
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}
}
199.
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}
}
200.
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.
