The poster session will be on Tuesday afternoon (see schedule). The posters will stay up all week in the Department of Mathematics.
The online poster presentations will take place through dedicated Audio/Video channels on the TQC Discord server. You can present your poster during the poster session or at any other time during the conference; all instructions can be found on the Discord server.
Note that not all accepted posters will be presented at the conference due to author availability constraints. If you cannot present your poster, you don’t need to email us.
121.
Carl Miller, Yusuf Alnawakhtha, Atul Mantri, Daochen Wang
Lattice-Based Quantum Advantage from Rotated Measurements Poster
2023.
@Poster{P7482,
title = {Lattice-Based Quantum Advantage from Rotated Measurements},
author = {Carl Miller and Yusuf Alnawakhtha and Atul Mantri and Daochen Wang},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
122.
Janek Denzler, Ellen Derbyshire, Tommaso Guaita, Antonio A. Mele, Jens Eisert
Learning moments of interacting fermionic systems from translationally invariant randomized measurements Poster
2023.
@Poster{P3957,
title = {Learning moments of interacting fermionic systems from translationally invariant randomized measurements},
author = {Janek Denzler and Ellen Derbyshire and Tommaso Guaita and Antonio A. Mele and Jens Eisert},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
123.
Matthias C. Caro
Learning Quantum Processes and Hamiltonians via the Pauli Transfer Matrix Poster
2023.
@Poster{P4903,
title = {Learning Quantum Processes and Hamiltonians via the Pauli Transfer Matrix},
author = {Matthias C. Caro},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
124.
Dmytro Bondarenko, Robert Salzmann, Viktoria Schmiesing
Learning Quantum Processes with Memory - Quantum Recurrent Neural Networks Poster
2023.
@Poster{P1244,
title = {Learning Quantum Processes with Memory - Quantum Recurrent Neural Networks},
author = {Dmytro Bondarenko and Robert Salzmann and Viktoria Schmiesing},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
125.
Marco Fanizza, Yihui Quek, Matteo Rosati
Learning quantum processes without input control Poster
2023.
@Poster{P4060,
title = {Learning quantum processes without input control},
author = {Marco Fanizza and Yihui Quek and Matteo Rosati},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
126.
Arthur Strauss
Leveraging Deep Reinforcement Learning for real-time context-aware Gate Calibration Poster
2023.
@Poster{P1588,
title = {Leveraging Deep Reinforcement Learning for real-time context-aware Gate Calibration},
author = {Arthur Strauss},
year = {2023},
date = {2023-01-01},
abstract = {The advent of quantum computers in the near-term prospect induces the need of mitigating various sources of noise that corrupt quantum information, preventing the successful execution of quantum algorithms. While noise characterization in hardware has been the subject of many investigations [1], scaling up the size of quantum systems involves additional noise sources that go beyond what basic noise models can describe. To cope with this issue, many techniques relying on experimental feedback have been used to
build more accurate quantum gate operations [2-5]. However, the considered problems at hand are usually tackled in a static background, in the sense that each gate is calibrated independently of the context it is meant to be used in, such as an algorithm.
For instance, playing a two-qubit gate for two specific qubits of the processor while running other gates on neighboring qubits yields a different gate fidelity from the case where those latter are maintained idle, as a result of non-local crosstalk. To overcome this difficulty, we propose to use model-free reinforcement learning to calibrate gate operations in situ. Reinforcement Learning has proven to be a valuable tool in many quantum tasks [4-8]. We therefore employ this method to calibrate a two-qubit gate directly from experimental data, while ensuring low sampling overhead. We restrict the action space to pulse parameters that can be adjusted in real time, i.e. parameters that are tunable without having to load a new waveform in the control system and therefore without having to recompile the quantum circuit. That way, one can adapt the initial gate calibration based on where (on which qubits) and when (at which time stamp) it is applied in the circuit to mitigate noisy interactions that uniquely define our dynamical system. As the feature of real-time pulse parameter update is enabled by current state-of-the-art control systems [9], we envision our method to stand as a practical calibration subroutine that could lower the usual latency overhead induced
by the need of recompiling the entire adapted waveform which is a common drawback in feedback-based optimal control protocols. We believe this stochastic method would stand as a complementary tool to other optimal control and circuit compilation approaches
for pushing further noise mitigation strategies in a relevant context of quantum algorithms execution.
References:
[1] H.-P. Breuer, F. Petruccione, The Theory of Open Quantum Systems, en. Oxford University Press, 2002
[2] J. Kelly, et al., “Optimal quantum control using randomized
benchmarking”, Physical Review Letters, vol. 112, no. 24, p. 240 504, Jun. 2014
[3] N. Wittler, et al., “Integrated Tool Set for Control, Calibration, and Characterization of Quantum Devices Applied to Superconducting Qubits”, Physical Review Applied, vol.
15, no. 3, p. 034 080, Mar. 2021
[4] Y. Baum, et al., “Experimental Deep Reinforcement Learning for Error-Robust Gate-Set Design on a Superconducting Quantum Computer”, PRX Quantum, vol. 2, no. 4, p. 040 324, Nov. 2021
[5] V. V. Sivak, et al., “Model-Free
Quantum Control with Reinforcement Learning”, Physical Review X, vol. 12, no. 1, p. 011 059, Mar. 2022
[6] Sivak, et al. Real-time quantum error correction beyond break-even. Nature 616, 50–55 (2023)
[7] T. Fösel, P. Tighineanu, T. Weiss, and F. Marquardt,
“Reinforcement Learning with Neural Networks for Quantum Feedback”, Physical Review X, vol. 8, no. 3, p. 031 084, Sep. 2018
[8] K. Reuer, et al., Realizing a deep reinforcement learning agent discovering real-time feedback control strategies for a quantum
system, arXiv:2210.16715 [quant-ph], Oct. 2022 [9] Q. Machines, OPX+ - Universal Quantum Control Hardware, en-US. https://www.quantum-machines.co/opx+/},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
The advent of quantum computers in the near-term prospect induces the need of mitigating various sources of noise that corrupt quantum information, preventing the successful execution of quantum algorithms. While noise characterization in hardware has been the subject of many investigations [1], scaling up the size of quantum systems involves additional noise sources that go beyond what basic noise models can describe. To cope with this issue, many techniques relying on experimental feedback have been used to
build more accurate quantum gate operations [2-5]. However, the considered problems at hand are usually tackled in a static background, in the sense that each gate is calibrated independently of the context it is meant to be used in, such as an algorithm.
For instance, playing a two-qubit gate for two specific qubits of the processor while running other gates on neighboring qubits yields a different gate fidelity from the case where those latter are maintained idle, as a result of non-local crosstalk. To overcome this difficulty, we propose to use model-free reinforcement learning to calibrate gate operations in situ. Reinforcement Learning has proven to be a valuable tool in many quantum tasks [4-8]. We therefore employ this method to calibrate a two-qubit gate directly from experimental data, while ensuring low sampling overhead. We restrict the action space to pulse parameters that can be adjusted in real time, i.e. parameters that are tunable without having to load a new waveform in the control system and therefore without having to recompile the quantum circuit. That way, one can adapt the initial gate calibration based on where (on which qubits) and when (at which time stamp) it is applied in the circuit to mitigate noisy interactions that uniquely define our dynamical system. As the feature of real-time pulse parameter update is enabled by current state-of-the-art control systems [9], we envision our method to stand as a practical calibration subroutine that could lower the usual latency overhead induced
by the need of recompiling the entire adapted waveform which is a common drawback in feedback-based optimal control protocols. We believe this stochastic method would stand as a complementary tool to other optimal control and circuit compilation approaches
for pushing further noise mitigation strategies in a relevant context of quantum algorithms execution.
References:
[1] H.-P. Breuer, F. Petruccione, The Theory of Open Quantum Systems, en. Oxford University Press, 2002
[2] J. Kelly, et al., “Optimal quantum control using randomized
benchmarking”, Physical Review Letters, vol. 112, no. 24, p. 240 504, Jun. 2014
[3] N. Wittler, et al., “Integrated Tool Set for Control, Calibration, and Characterization of Quantum Devices Applied to Superconducting Qubits”, Physical Review Applied, vol.
15, no. 3, p. 034 080, Mar. 2021
[4] Y. Baum, et al., “Experimental Deep Reinforcement Learning for Error-Robust Gate-Set Design on a Superconducting Quantum Computer”, PRX Quantum, vol. 2, no. 4, p. 040 324, Nov. 2021
[5] V. V. Sivak, et al., “Model-Free
Quantum Control with Reinforcement Learning”, Physical Review X, vol. 12, no. 1, p. 011 059, Mar. 2022
[6] Sivak, et al. Real-time quantum error correction beyond break-even. Nature 616, 50–55 (2023)
[7] T. Fösel, P. Tighineanu, T. Weiss, and F. Marquardt,
“Reinforcement Learning with Neural Networks for Quantum Feedback”, Physical Review X, vol. 8, no. 3, p. 031 084, Sep. 2018
[8] K. Reuer, et al., Realizing a deep reinforcement learning agent discovering real-time feedback control strategies for a quantum
system, arXiv:2210.16715 [quant-ph], Oct. 2022 [9] Q. Machines, OPX+ - Universal Quantum Control Hardware, en-US. https://www.quantum-machines.co/opx+/
build more accurate quantum gate operations [2-5]. However, the considered problems at hand are usually tackled in a static background, in the sense that each gate is calibrated independently of the context it is meant to be used in, such as an algorithm.
For instance, playing a two-qubit gate for two specific qubits of the processor while running other gates on neighboring qubits yields a different gate fidelity from the case where those latter are maintained idle, as a result of non-local crosstalk. To overcome this difficulty, we propose to use model-free reinforcement learning to calibrate gate operations in situ. Reinforcement Learning has proven to be a valuable tool in many quantum tasks [4-8]. We therefore employ this method to calibrate a two-qubit gate directly from experimental data, while ensuring low sampling overhead. We restrict the action space to pulse parameters that can be adjusted in real time, i.e. parameters that are tunable without having to load a new waveform in the control system and therefore without having to recompile the quantum circuit. That way, one can adapt the initial gate calibration based on where (on which qubits) and when (at which time stamp) it is applied in the circuit to mitigate noisy interactions that uniquely define our dynamical system. As the feature of real-time pulse parameter update is enabled by current state-of-the-art control systems [9], we envision our method to stand as a practical calibration subroutine that could lower the usual latency overhead induced
by the need of recompiling the entire adapted waveform which is a common drawback in feedback-based optimal control protocols. We believe this stochastic method would stand as a complementary tool to other optimal control and circuit compilation approaches
for pushing further noise mitigation strategies in a relevant context of quantum algorithms execution.
References:
[1] H.-P. Breuer, F. Petruccione, The Theory of Open Quantum Systems, en. Oxford University Press, 2002
[2] J. Kelly, et al., “Optimal quantum control using randomized
benchmarking”, Physical Review Letters, vol. 112, no. 24, p. 240 504, Jun. 2014
[3] N. Wittler, et al., “Integrated Tool Set for Control, Calibration, and Characterization of Quantum Devices Applied to Superconducting Qubits”, Physical Review Applied, vol.
15, no. 3, p. 034 080, Mar. 2021
[4] Y. Baum, et al., “Experimental Deep Reinforcement Learning for Error-Robust Gate-Set Design on a Superconducting Quantum Computer”, PRX Quantum, vol. 2, no. 4, p. 040 324, Nov. 2021
[5] V. V. Sivak, et al., “Model-Free
Quantum Control with Reinforcement Learning”, Physical Review X, vol. 12, no. 1, p. 011 059, Mar. 2022
[6] Sivak, et al. Real-time quantum error correction beyond break-even. Nature 616, 50–55 (2023)
[7] T. Fösel, P. Tighineanu, T. Weiss, and F. Marquardt,
“Reinforcement Learning with Neural Networks for Quantum Feedback”, Physical Review X, vol. 8, no. 3, p. 031 084, Sep. 2018
[8] K. Reuer, et al., Realizing a deep reinforcement learning agent discovering real-time feedback control strategies for a quantum
system, arXiv:2210.16715 [quant-ph], Oct. 2022 [9] Q. Machines, OPX+ - Universal Quantum Control Hardware, en-US. https://www.quantum-machines.co/opx+/
127.
Michael Liaofan Liu, Florian Kanitschar, Amir Arqand, Ernest Y. -Z. Tan
Lipschitz continuity of quantum-classical conditional entropies with respect to angular distance and related properties Poster
2023.
@Poster{P7279,
title = {Lipschitz continuity of quantum-classical conditional entropies with respect to angular distance and related properties},
author = {Michael Liaofan Liu and Florian Kanitschar and Amir Arqand and Ernest Y. -Z. Tan},
year = {2023},
date = {2023-01-01},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
128.
Luke Coffman, Graeme Smith, Jacob Beckey
Local measurement strategies for multipartite entanglement quantification Poster
2023.
@Poster{P547,
title = {Local measurement strategies for multipartite entanglement quantification},
author = {Luke Coffman and Graeme Smith and Jacob Beckey},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
129.
Bruna Araújo, Márcio Taddei, Daniel Cavalcanti, Antonio Acín
Local quantum overlapping tomography Poster
2023.
Abstract | Links:
@Poster{P7291,
title = {Local quantum overlapping tomography},
author = {Bruna Araújo and Márcio Taddei and Daniel Cavalcanti and Antonio Acín},
url = {https://arxiv.org/abs/2112.03924},
year = {2023},
date = {2023-01-01},
abstract = {Reconstructing the full quantum state of a many-body system requires the estimation of a number of parameters that grows exponentially with system size. Nevertheless, there are situations in which one is only interested in a subset of these parameters and a full reconstruction is not needed. A paradigmatic example is a scenario where one aims at determining all the reduced states only up to a given size. Overlapping tomography provides constructions to address this problem with a number of product measurements much smaller than what is obtained when performing independent tomography of each reduced state. There are however many relevant physical systems with a natural notion of locality where one is mostly interested in the reduced states of neighboring particles. In this work, we study this form of local overlapping tomography. First of all, we show that, contrary to its full version, the number of product-measurement settings needed for local overlapping tomography does not grow with system size. Then, we present strategies for qubit and fermionic systems in selected lattice geometries. The developed methods find a natural application in the estimation of many-body systems prepared in current quantum simulators or quantum computing devices, where interactions are often local.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Reconstructing the full quantum state of a many-body system requires the estimation of a number of parameters that grows exponentially with system size. Nevertheless, there are situations in which one is only interested in a subset of these parameters and a full reconstruction is not needed. A paradigmatic example is a scenario where one aims at determining all the reduced states only up to a given size. Overlapping tomography provides constructions to address this problem with a number of product measurements much smaller than what is obtained when performing independent tomography of each reduced state. There are however many relevant physical systems with a natural notion of locality where one is mostly interested in the reduced states of neighboring particles. In this work, we study this form of local overlapping tomography. First of all, we show that, contrary to its full version, the number of product-measurement settings needed for local overlapping tomography does not grow with system size. Then, we present strategies for qubit and fermionic systems in selected lattice geometries. The developed methods find a natural application in the estimation of many-body systems prepared in current quantum simulators or quantum computing devices, where interactions are often local.
130.
Chun-Yu Chen, Gelo Noel Tabia, Kai-Siang Chen, Yeong-Cherng Liang
Local randomness from quantum correlations on the no-signaling-boundary Poster
2023.
Abstract | Links:
@Poster{P7150,
title = {Local randomness from quantum correlations on the no-signaling-boundary},
author = {Chun-Yu Chen and Gelo Noel Tabia and Kai-Siang Chen and Yeong-Cherng Liang},
url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688093416-poster-Poster-Improved_finite_size_local_randomness_from_NSBQC_v3.pdf https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688093416-video-2023TQC_poster_presentation.mp4},
year = {2023},
date = {2023-01-01},
abstract = {Device-independent randomness generation uses the violation of a Bell inequality to verify that the outputs of a nonlocal game are truly random. We focus on ``local'' randomness expansion protocols, where the extracted bits are random even to one of the involved parties. By incorporating zero-probability constraints into the Clauser-Horne-Shimony-Holt (CHSH) nonlocal game, we enhance the extractable rate in both asymptotic and finite-size regimes. Using the generalized entropy accumulation theorem and refining the second-order correction terms, we achieve a rate of up to 0.9 bit-per-round in our modified protocols, surpassing the standard CHSH game's maximum of 0.55 bits. Our results demonstrate some tolerance even without strictly enforcing the zero-probability constraints.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Device-independent randomness generation uses the violation of a Bell inequality to verify that the outputs of a nonlocal game are truly random. We focus on ``local'' randomness expansion protocols, where the extracted bits are random even to one of the involved parties. By incorporating zero-probability constraints into the Clauser-Horne-Shimony-Holt (CHSH) nonlocal game, we enhance the extractable rate in both asymptotic and finite-size regimes. Using the generalized entropy accumulation theorem and refining the second-order correction terms, we achieve a rate of up to 0.9 bit-per-round in our modified protocols, surpassing the standard CHSH game's maximum of 0.55 bits. Our results demonstrate some tolerance even without strictly enforcing the zero-probability constraints.
131.
Shin Ho Choe, Robert Koenig
Long-range data transmission in a fault-tolerant quantum bus architecture Poster
2023.
@Poster{P6760,
title = {Long-range data transmission in a fault-tolerant quantum bus architecture},
author = {Shin Ho Choe and Robert Koenig},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
132.
Touheed Anwar Atif, Mohammed Aamir Sohail, S. Sandeep Pradhan
Lossy Quantum Source Coding with a Global Error Criterion based on a Posterior Reference Map Poster
2023.
@Poster{P718,
title = {Lossy Quantum Source Coding with a Global Error Criterion based on a Posterior Reference Map},
author = {Touheed Anwar Atif and Mohammed Aamir Sohail and S. Sandeep Pradhan},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
133.
Áron Rozgonyi, Tamás Kiss, Orsolya Kálmán, Gábor Széchenyi, Zoltán Udvarnoki
Machine learning assisted tripartite entanglement distillation Poster
2023.
@Poster{P8297,
title = {Machine learning assisted tripartite entanglement distillation},
author = {Áron Rozgonyi and Tamás Kiss and Orsolya Kálmán and Gábor Széchenyi and Zoltán Udvarnoki},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
134.
Andreas Klingler, Mirte Eyden, Sebastian Stengele, Tobias Reinhart, Gemma De Las Cuevas
Many bounded versions of undecidable problems are NP-hard Poster
2023.
Abstract | Links:
@Poster{P3656,
title = {Many bounded versions of undecidable problems are NP-hard},
author = {Andreas Klingler and Mirte Eyden and Sebastian Stengele and Tobias Reinhart and Gemma De Las Cuevas},
url = {https://arxiv.org/abs/2211.13532 https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688048245-poster-3656.pdf https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688048245-video-3656.mp4},
year = {2023},
date = {2023-01-01},
abstract = {Several physically inspired problems have been proven undecidable; examples are the spectral gap problem and the membership problem for quantum correlations. Most of these results rely on reductions from a handful of undecidable problems, such as the halting problem, the tiling problem, the Post correspondence problem or the matrix mortality problem. All these problems have a common property: they have an NP-hard bounded version. This work establishes a relation between undecidable unbounded problems and their bounded NP-hard versions. Specifically, we show that NP-hardness of a bounded version follows easily from the reduction of the unbounded problems. This leads to new and simpler proofs of the NP-hardness of bounded version of the Post correspondence problem, the matrix mortality problem, the positivity of matrix product operators, the reachability problem, the tiling problem, and the ground state energy problem. This work sheds light on the intractability of problems in theoretical physics and on the computational consequences of bounding a parameter.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Several physically inspired problems have been proven undecidable; examples are the spectral gap problem and the membership problem for quantum correlations. Most of these results rely on reductions from a handful of undecidable problems, such as the halting problem, the tiling problem, the Post correspondence problem or the matrix mortality problem. All these problems have a common property: they have an NP-hard bounded version. This work establishes a relation between undecidable unbounded problems and their bounded NP-hard versions. Specifically, we show that NP-hardness of a bounded version follows easily from the reduction of the unbounded problems. This leads to new and simpler proofs of the NP-hardness of bounded version of the Post correspondence problem, the matrix mortality problem, the positivity of matrix product operators, the reachability problem, the tiling problem, and the ground state energy problem. This work sheds light on the intractability of problems in theoretical physics and on the computational consequences of bounding a parameter.
135.
Andris Ambainis, Harry Buhrman, Koen Leijnse, Subhasree Patro, Florian Speelman
Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture Poster
2023.
@Poster{P8247,
title = {Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture},
author = {Andris Ambainis and Harry Buhrman and Koen Leijnse and Subhasree Patro and Florian Speelman},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
136.
Rahul Jain, Georgios Piliouras, Ryann Sim
Matrix Multiplicative Weights Updates in Quantum Zero-Sum Games: Conservation Laws & Recurrence Poster
2023.
@Poster{P7043,
title = {Matrix Multiplicative Weights Updates in Quantum Zero-Sum Games: Conservation Laws & Recurrence},
author = {Rahul Jain and Georgios Piliouras and Ryann Sim},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
137.
John Martin, Eduardo Serrano-Ensástiga
Maximum entanglement of mixed symmetric states under unitary transformations Poster
2023.
@Poster{P2449,
title = {Maximum entanglement of mixed symmetric states under unitary transformations},
author = {John Martin and Eduardo Serrano-Ensástiga},
url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688712541-poster-poster_SAS.pdf},
year = {2023},
date = {2023-01-01},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
138.
Faedi Loulidi, Ion Nechita
Measurement incompatibility vs. Bell non-locality: an approach via tensor norms Poster
2023.
@Poster{P1835,
title = {Measurement incompatibility vs. Bell non-locality: an approach via tensor norms},
author = {Faedi Loulidi and Ion Nechita},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
139.
Cihan Okay, Ho Yiu Chung, Selman Ipek
Mermin polytopes in quantum computation and foundations Poster
2023.
@Poster{P9989,
title = {Mermin polytopes in quantum computation and foundations},
author = {Cihan Okay and Ho Yiu Chung and Selman Ipek},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
140.
Palash Pandya, Marcin Wieśniak
Minimum Hilbert-Schmidt Distance and Optimal Entanglement Witnesses Poster
2023.
@Poster{P9076,
title = {Minimum Hilbert-Schmidt Distance and Optimal Entanglement Witnesses},
author = {Palash Pandya and Marcin Wieśniak},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
141.
Jan Ole Ernst, Felix Tennie
Mode entanglement in fermionic and bosonic Harmonium Poster
2023.
@Poster{P4687,
title = {Mode entanglement in fermionic and bosonic Harmonium},
author = {Jan Ole Ernst and Felix Tennie},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
142.
Margarida Pereira, Guillermo Currás-Lorenzo, Álvaro Navarrete, Akihiro Mizutani, Go Kato, Marcos Curty, Kiyoshi Tamaki
Modified BB84 quantum key distribution protocol robust to source imperfections Poster
2023.
@Poster{P3522,
title = {Modified BB84 quantum key distribution protocol robust to source imperfections},
author = {Margarida Pereira and Guillermo Currás-Lorenzo and Álvaro Navarrete and Akihiro Mizutani and Go Kato and Marcos Curty and Kiyoshi Tamaki},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
143.
Siyuan Niu, Aida Todri-Sanial
Multi-programming Benchmarking for Quantum Computing on Trapped-Ion and Superconducting Devices Poster
2023.
@Poster{P2687,
title = {Multi-programming Benchmarking for Quantum Computing on Trapped-Ion and Superconducting Devices},
author = {Siyuan Niu and Aida Todri-Sanial},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
144.
Stefano Chessa, Vittorio Giovannetti
Multilevel amplitude damping channels: models, capacities, perspectives Poster
2023.
@Poster{P4288,
title = {Multilevel amplitude damping channels: models, capacities, perspectives},
author = {Stefano Chessa and Vittorio Giovannetti},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
145.
Yihui Quek, Eneet Kaur, Mark Wilde
Multivariate trace estimation in constant quantum depth Poster
2023.
@Poster{P8218,
title = {Multivariate trace estimation in constant quantum depth},
author = {Yihui Quek and Eneet Kaur and Mark Wilde},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
146.
Kai Lin Ong
Near-idempotents of quaternary group algebras and their applications in designing quantum code Poster
2023.
Abstract | Links:
@Poster{P5738,
title = {Near-idempotents of quaternary group algebras and their applications in designing quantum code},
author = {Kai Lin Ong},
url = {https://link.springer.com/article/10.1007/s11128-023-03904-7 https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688280711-poster-5738.pdf https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688280711-video-5738.mp4},
year = {2023},
date = {2023-01-01},
abstract = {Define near-idempotents of a group algebra $mathbbF_qG$ as its elements $fınmathbbF_qG$ such that $f^n=e$ for some idempotent $e$ and $nınmathbbZ^+$. The smallest such $n$ is termed the degree of $f$. Near-idempotents can be viewed as a generalisation of idempotents, as the latter is just near-idempotents of degree 1. While theories of near-idempotents were well-established in ring theory, general frameworks of constructing codes using near-idempotents remain rather unexplored. Therefore, this session is devoted to exploring classes of quantum stabilizer codes and their properties, which near-idempotents are served as the generator of their underlying additive codes over $mathbbF_4$. This is primarily done by adopting a perspective of viewing codes over $mathbbF_4$ isomorphically as group algebras over the same finite field. Via the lens of group algebras, we characterize conditions on near-idempotents that enables their additive codes to sufficiently satisfies the inner product criterion for stabilizer formalism, then characterizes the constructed codes and some of their properties. Our results shows that a number of quantum codes generated by near-idempotents coincide with the best known parameters.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Define near-idempotents of a group algebra $mathbbF_qG$ as its elements $fınmathbbF_qG$ such that $f^n=e$ for some idempotent $e$ and $nınmathbbZ^+$. The smallest such $n$ is termed the degree of $f$. Near-idempotents can be viewed as a generalisation of idempotents, as the latter is just near-idempotents of degree 1. While theories of near-idempotents were well-established in ring theory, general frameworks of constructing codes using near-idempotents remain rather unexplored. Therefore, this session is devoted to exploring classes of quantum stabilizer codes and their properties, which near-idempotents are served as the generator of their underlying additive codes over $mathbbF_4$. This is primarily done by adopting a perspective of viewing codes over $mathbbF_4$ isomorphically as group algebras over the same finite field. Via the lens of group algebras, we characterize conditions on near-idempotents that enables their additive codes to sufficiently satisfies the inner product criterion for stabilizer formalism, then characterizes the constructed codes and some of their properties. Our results shows that a number of quantum codes generated by near-idempotents coincide with the best known parameters.
147.
Zongbo Bao, Penghui Yao
Nearly Optimal Algorithms for Testing and Learning Quantum Junta Channels Poster
2023.
@Poster{P2705,
title = {Nearly Optimal Algorithms for Testing and Learning Quantum Junta Channels},
author = {Zongbo Bao and Penghui Yao},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
148.
Swapnil Bhowmick, Abhay Srivastav, Arun Kumar Pati
No-Masking Theorem for Observables and No-Bit Commitment Poster
2023.
@Poster{P7859,
title = {No-Masking Theorem for Observables and No-Bit Commitment},
author = {Swapnil Bhowmick and Abhay Srivastav and Arun Kumar Pati},
year = {2023},
date = {2023-01-01},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
149.
Marco Fellous Asiani, Moein Naseri, Alexander Streltsov, Michał Oszmaniec
Noise-resilient quantum circuits for qubits admitting a noise bias Poster
2023.
@Poster{P214,
title = {Noise-resilient quantum circuits for qubits admitting a noise bias},
author = {Marco Fellous Asiani and Moein Naseri and Alexander Streltsov and Michał Oszmaniec},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
150.
Sarah Hagen, Eric Chitambar
Non-Classical Zero Communication Reductions Poster
2023.
@Poster{P8908,
title = {Non-Classical Zero Communication Reductions},
author = {Sarah Hagen and Eric Chitambar},
url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688135349-poster-8908.pdf https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688135349-video-8908.mp4},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
151.
Chandan Mahto, Vijay Pathak, Ardra K. S, Anil Shaji
Nonclassical correlations in subsystems of globally entangled quantum states Poster
2023.
@Poster{P3586,
title = {Nonclassical correlations in subsystems of globally entangled quantum states},
author = {Chandan Mahto and Vijay Pathak and Ardra K. S and Anil Shaji},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
152.
Sayantan Chakraborty, Upendra Kapshikar
Novel chain rules for one-shot entropic quantities via operational methods Poster
2023.
@Poster{P2552,
title = {Novel chain rules for one-shot entropic quantities via operational methods},
author = {Sayantan Chakraborty and Upendra Kapshikar},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
153.
Yinan Li, Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang
On linear-algebraic notions of expansion Poster
2023.
Abstract | Links:
@Poster{P2299,
title = {On linear-algebraic notions of expansion},
author = {Yinan Li and Youming Qiao and Avi Wigderson and Yuval Wigderson and Chuanqi Zhang},
url = {https://arxiv.org/pdf/2212.13154.pdf https://arxiv.org/pdf/2206.04815.pdf https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1685063955-poster-2299.pdf},
year = {2023},
date = {2023-01-01},
abstract = {A fundamental fact about bounded-degree graph expanders is that three notions of expansion—vertex expansion, edge expansion, and spectral expansion—are all equivalent. In this paper, we study to what extent such a statement is true for linear-algebraic notions of expansion. There are two well-studied notions of linear-algebraic expansion, namely dimension expansion [1] (defined in analogy to graph vertex expansion) and quantum expansion [2, 3] (defined in analogy to graph spectral expansion). Lubotzky and Zelmanov [4] proved that the latter implies the former. We prove that the converse is false: there are dimension expanders which are not quantum expanders. Moreover, this asymmetry is explained by the fact that there are two distinct linear-algebraic analogues of graph edge expansion. The first of these is quantum edge expansion, which was introduced by Hastings [5], and which he proved to be equivalent to quantum expansion. We introduce a new notion, termed dimension edge expansion, which we prove is equivalent to dimension expansion and which is implied by quantum edge expansion. Thus, the separation above is implied by a finer one: dimension edge expansion is strictly weaker than quantum edge expansion. This new notion also leads to a new, more modular proof of the Lubotzky-Zelmanov result [4] that quantum expanders are dimension expanders.
[1] Boaz Barak, Russell Impagliazzo, Amir Shpilka, and Avi Wigderson. Definition and existence of dimension expanders. Discussion (no written record), 2004.
[2] Avraham Ben-Aroya and Amnon Ta-Shma. Quantum expanders and the quantum entropy difference problem. ArXiv:quant-ph/0702129, 2007.
[3] M. B. Hastings. Entropy and entanglement in quantum ground states. Phys. Rev. B, 76:035114, Jul 2007.
[4] Alexander Lubotzky and Efim Zelmanov. Dimension expanders. Journal of Algebra, 319(2):730–738, 2008. [5] M. B. Hastings. Random unitaries give quantum expanders. Physical Review A, 76:032315, Sep 2007.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
A fundamental fact about bounded-degree graph expanders is that three notions of expansion—vertex expansion, edge expansion, and spectral expansion—are all equivalent. In this paper, we study to what extent such a statement is true for linear-algebraic notions of expansion. There are two well-studied notions of linear-algebraic expansion, namely dimension expansion [1] (defined in analogy to graph vertex expansion) and quantum expansion [2, 3] (defined in analogy to graph spectral expansion). Lubotzky and Zelmanov [4] proved that the latter implies the former. We prove that the converse is false: there are dimension expanders which are not quantum expanders. Moreover, this asymmetry is explained by the fact that there are two distinct linear-algebraic analogues of graph edge expansion. The first of these is quantum edge expansion, which was introduced by Hastings [5], and which he proved to be equivalent to quantum expansion. We introduce a new notion, termed dimension edge expansion, which we prove is equivalent to dimension expansion and which is implied by quantum edge expansion. Thus, the separation above is implied by a finer one: dimension edge expansion is strictly weaker than quantum edge expansion. This new notion also leads to a new, more modular proof of the Lubotzky-Zelmanov result [4] that quantum expanders are dimension expanders.
[1] Boaz Barak, Russell Impagliazzo, Amir Shpilka, and Avi Wigderson. Definition and existence of dimension expanders. Discussion (no written record), 2004.
[2] Avraham Ben-Aroya and Amnon Ta-Shma. Quantum expanders and the quantum entropy difference problem. ArXiv:quant-ph/0702129, 2007.
[3] M. B. Hastings. Entropy and entanglement in quantum ground states. Phys. Rev. B, 76:035114, Jul 2007.
[4] Alexander Lubotzky and Efim Zelmanov. Dimension expanders. Journal of Algebra, 319(2):730–738, 2008. [5] M. B. Hastings. Random unitaries give quantum expanders. Physical Review A, 76:032315, Sep 2007.
[1] Boaz Barak, Russell Impagliazzo, Amir Shpilka, and Avi Wigderson. Definition and existence of dimension expanders. Discussion (no written record), 2004.
[2] Avraham Ben-Aroya and Amnon Ta-Shma. Quantum expanders and the quantum entropy difference problem. ArXiv:quant-ph/0702129, 2007.
[3] M. B. Hastings. Entropy and entanglement in quantum ground states. Phys. Rev. B, 76:035114, Jul 2007.
[4] Alexander Lubotzky and Efim Zelmanov. Dimension expanders. Journal of Algebra, 319(2):730–738, 2008. [5] M. B. Hastings. Random unitaries give quantum expanders. Physical Review A, 76:032315, Sep 2007.
154.
Nico Piatkowski, Christa Zoufal
On Quantum Circuits for Discrete Graphical Models Poster
2023.
@Poster{P1902,
title = {On Quantum Circuits for Discrete Graphical Models},
author = {Nico Piatkowski and Christa Zoufal},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
155.
Duarte Magano, João Moutinho, Bruno Coutinho
On the quantum simulation of complex networks Poster
2023.
Abstract | Links:
@Poster{P681,
title = {On the quantum simulation of complex networks},
author = {Duarte Magano and João Moutinho and Bruno Coutinho},
url = {https://arxiv.org/abs/2212.06126},
year = {2023},
date = {2023-01-01},
abstract = {Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links. Continuous-time quantum walk algorithms assume that we can simulate the dynamics of quantum systems where the Hamiltonian is given by the adjacency matrix of the graph. It is known that such can be simulated efficiently if the underlying graph is row-sparse and efficiently row-computable. While this is sufficient for many applications, it limits the applicability for this class of algorithms to study real world complex networks, which, among other properties, are characterized by the existence of a few densely connected nodes, called hubs. In other words, complex networks are typically not row-sparse, even though the average connectivity over all nodes can be very small. In this work, we extend the state-of-the-art results on quantum simulation to graphs that contain a small number of hubs, but that are otherwise sparse. Hopefully, our results may lead to new applications of quantum computing to network science},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links. Continuous-time quantum walk algorithms assume that we can simulate the dynamics of quantum systems where the Hamiltonian is given by the adjacency matrix of the graph. It is known that such can be simulated efficiently if the underlying graph is row-sparse and efficiently row-computable. While this is sufficient for many applications, it limits the applicability for this class of algorithms to study real world complex networks, which, among other properties, are characterized by the existence of a few densely connected nodes, called hubs. In other words, complex networks are typically not row-sparse, even though the average connectivity over all nodes can be very small. In this work, we extend the state-of-the-art results on quantum simulation to graphs that contain a small number of hubs, but that are otherwise sparse. Hopefully, our results may lead to new applications of quantum computing to network science
156.
Gorjan Alagic, Chen Bai, Alexander Poremba, Kaiyan Shi
On the Two-sided Permutation Inversion Problem Poster
2023.
@Poster{P8587,
title = {On the Two-sided Permutation Inversion Problem},
author = {Gorjan Alagic and Chen Bai and Alexander Poremba and Kaiyan Shi},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
157.
Sisi Zhou, Spyridon Michalakis, Tuvia Gefen
Optimal protocols for quantum metrology with noisy measurements Poster
2023.
Abstract | Links:
@Poster{P2348,
title = {Optimal protocols for quantum metrology with noisy measurements},
author = {Sisi Zhou and Spyridon Michalakis and Tuvia Gefen},
url = {https://arxiv.org/abs/2210.11393 https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1687809411-poster-2348.pdf https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1687809411-video-2348.mp4},
year = {2023},
date = {2023-01-01},
abstract = {Quantum Fisher information (QFI) characterizes the amount of information a quantum state carries about an unknown parameter, assuming arbitrary measurements on the quantum state. However, in practice, quantum measurements are noisy, preventing most metrological protocols from achieving parameter estimation in line with the QFI of a given quantum state. Here, we study protocols that allow preprocessing of quantum states using quantum controls before measurement. We introduce the concept of error observables and formulate the problem of identifying the optimal quantum controls in this setting as a biconvex optimization. Based on this formulation, we prove that unitary channels are optimal for pure states and derive analytical solutions for the optimal controls in cases of practical relevance. In the context of commuting measurement operators and classically mixed states (i.e., states for which the unknown parameter is encoded in the eigenvalues), we prove that coarse-graining channels are optimal and provide a counterexample to the optimality of unitary controls. For general quantum states and measurements, we provide useful upper and lower bounds on the Fisher information optimized over preprocessing controls. Finally, we consider quantum states in a multipartite system with local noisy measurements acting independently on each subsystem and prove that in the asymptotic limit, the QFI is attainable using global optimal controls for a generic class of quantum states.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Quantum Fisher information (QFI) characterizes the amount of information a quantum state carries about an unknown parameter, assuming arbitrary measurements on the quantum state. However, in practice, quantum measurements are noisy, preventing most metrological protocols from achieving parameter estimation in line with the QFI of a given quantum state. Here, we study protocols that allow preprocessing of quantum states using quantum controls before measurement. We introduce the concept of error observables and formulate the problem of identifying the optimal quantum controls in this setting as a biconvex optimization. Based on this formulation, we prove that unitary channels are optimal for pure states and derive analytical solutions for the optimal controls in cases of practical relevance. In the context of commuting measurement operators and classically mixed states (i.e., states for which the unknown parameter is encoded in the eigenvalues), we prove that coarse-graining channels are optimal and provide a counterexample to the optimality of unitary controls. For general quantum states and measurements, we provide useful upper and lower bounds on the Fisher information optimized over preprocessing controls. Finally, we consider quantum states in a multipartite system with local noisy measurements acting independently on each subsystem and prove that in the asymptotic limit, the QFI is attainable using global optimal controls for a generic class of quantum states.
158.
Sophie Decoppet
Optimal Quantum Algorithm for Vector Interpolation Poster
2023.
@Poster{P8133,
title = {Optimal Quantum Algorithm for Vector Interpolation},
author = {Sophie Decoppet},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
159.
Lukas Brenner, Christophe Piveteau, David Sutter
Optimal wire cutting with classical communication Poster
2023.
@Poster{P8398,
title = {Optimal wire cutting with classical communication},
author = {Lukas Brenner and Christophe Piveteau and David Sutter},
year = {2023},
date = {2023-01-01},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
160.
Mirjam Weilenmann, Costantino Budroni, Miguel Navascues
Optimisation of time-ordered processes in the finite and asymptotic regime Poster
2023.
@Poster{P7372,
title = {Optimisation of time-ordered processes in the finite and asymptotic regime},
author = {Mirjam Weilenmann and Costantino Budroni and Miguel Navascues},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
161.
Marco Fellous Asiani, Jing Hao Chai, Yvain Thonnart, Hui Khoon Ng, Robert Whitney, Alexia Auffèves
Optimizing resource efficiencies for scalable full-stack quantum computers Poster
2023.
@Poster{P3790,
title = {Optimizing resource efficiencies for scalable full-stack quantum computers},
author = {Marco Fellous Asiani and Jing Hao Chai and Yvain Thonnart and Hui Khoon Ng and Robert Whitney and Alexia Auffèves},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
162.
Stefano Polla, Gian-Luca R. Anselmetti, Thomas E. O'Brien
Optimizing the information extracted by a single qubit measurement Poster
2023.
@Poster{P9718,
title = {Optimizing the information extracted by a single qubit measurement},
author = {Stefano Polla and Gian-Luca R. Anselmetti and Thomas E. O'Brien},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
163.
Noah Berthusen, Daniel Gottesman
Partial syndrome measurement for quantum LDPC codes Poster
2023.
@Poster{P8322,
title = {Partial syndrome measurement for quantum LDPC codes},
author = {Noah Berthusen and Daniel Gottesman},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
164.
L. Sunil Chandran, Rishikesh Gajjala
Perfect matchings and Quantum physics: Bounding the dimension of GHZ states Poster
2023.
@Poster{P7249,
title = {Perfect matchings and Quantum physics: Bounding the dimension of GHZ states},
author = {L. Sunil Chandran and Rishikesh Gajjala},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
165.
Deepa Thangavelu, Kaizin Bhesania, Eslam G. Abdallah
Performance Analysis of Classical and Post-Quantum Cryptographic Algorithms Poster
2023.
Abstract | Links:
@Poster{P3303,
title = {Performance Analysis of Classical and Post-Quantum Cryptographic Algorithms},
author = {Deepa Thangavelu and Kaizin Bhesania and Eslam G. Abdallah},
url = {https://drive.google.com/file/d/1HJALXkyMZFJsa39MVB3Fdp3FoBl5xfGN/view?usp=sharing},
year = {2023},
date = {2023-01-01},
abstract = {Cyber-attacks are increasingly seeking access to private information held by individuals or corporations. Cryptography is used to protect data by including methods to prevent attackers from acquiring it. However, the inevitable arrival of large-scale quantum computers in the upcoming years is expected to impact the security offered by today’s
various cryptosystems. Several suggestions have been presented to the NIST-initiated procedure, which focuses on the evaluation and standardization of one, or perhaps more quantum-resistant public-key cryptography algorithms in order to mitigate the hazards associated with quantum computing. This paper examines the impact of quantum
technologies on several of these proposals and explores a number of post-quantum cryptography techniques. A full examination of cryptosystems is also provided in order to propose a secure, quantum-resistant solution that might be used in a variety of sectors, including online banking. Based on various parameters, this study compares multiple traditional and CRYSTALS-Kyber post-quantum cryptography approaches.},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Cyber-attacks are increasingly seeking access to private information held by individuals or corporations. Cryptography is used to protect data by including methods to prevent attackers from acquiring it. However, the inevitable arrival of large-scale quantum computers in the upcoming years is expected to impact the security offered by today’s
various cryptosystems. Several suggestions have been presented to the NIST-initiated procedure, which focuses on the evaluation and standardization of one, or perhaps more quantum-resistant public-key cryptography algorithms in order to mitigate the hazards associated with quantum computing. This paper examines the impact of quantum
technologies on several of these proposals and explores a number of post-quantum cryptography techniques. A full examination of cryptosystems is also provided in order to propose a secure, quantum-resistant solution that might be used in a variety of sectors, including online banking. Based on various parameters, this study compares multiple traditional and CRYSTALS-Kyber post-quantum cryptography approaches.
various cryptosystems. Several suggestions have been presented to the NIST-initiated procedure, which focuses on the evaluation and standardization of one, or perhaps more quantum-resistant public-key cryptography algorithms in order to mitigate the hazards associated with quantum computing. This paper examines the impact of quantum
technologies on several of these proposals and explores a number of post-quantum cryptography techniques. A full examination of cryptosystems is also provided in order to propose a secure, quantum-resistant solution that might be used in a variety of sectors, including online banking. Based on various parameters, this study compares multiple traditional and CRYSTALS-Kyber post-quantum cryptography approaches.
166.
Deepa Thangavelu, Kaizin Bhesania, Eslam G. Abdallah
Performance Analysis of CRYSTALS-Kyber Post-Quantum Cryptographic System Poster
2023.
@Poster{P3151,
title = {Performance Analysis of CRYSTALS-Kyber Post-Quantum Cryptographic System},
author = {Deepa Thangavelu and Kaizin Bhesania and Eslam G. Abdallah},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
167.
You Zhou, Qing Liu
Performance analysis of multi-shot shadow estimation Poster
2023.
@Poster{P5639,
title = {Performance analysis of multi-shot shadow estimation},
author = {You Zhou and Qing Liu},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
168.
Abdelhak Bendjeffal
Photon-added nonlinear coherent states associated with Tsallis q-exponential and their nonclassical properties Poster
2023.
@Poster{P5641,
title = {Photon-added nonlinear coherent states associated with Tsallis q-exponential and their nonclassical properties},
author = {Abdelhak Bendjeffal},
year = {2023},
date = {2023-01-01},
abstract = {We construct deformed photon-added nonlinear coherent states (DPANCSs) corresponding to Tsallis nonlinearity function. We evaluate, numerically, some statistical properties of the constructed states, like the Mandel parameter and the second-order correlation function. It has been found that this class of DPANCSs obeys a sub-Poissonian statistics and exhibits an anti bunching behavior.},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
We construct deformed photon-added nonlinear coherent states (DPANCSs) corresponding to Tsallis nonlinearity function. We evaluate, numerically, some statistical properties of the constructed states, like the Mandel parameter and the second-order correlation function. It has been found that this class of DPANCSs obeys a sub-Poissonian statistics and exhibits an anti bunching behavior.
169.
John Martin, Jérome Denis, Jack Davis, Robert B. Mann
Polytopes of Absolutely Wigner Bounded Spin States Poster
2023.
@Poster{P8515,
title = {Polytopes of Absolutely Wigner Bounded Spin States},
author = {John Martin and Jérome Denis and Jack Davis and Robert B. Mann},
url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688720307-poster-Poster_polytope.pdf},
year = {2023},
date = {2023-01-01},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
170.
Ram Patra, Sahil Gopalkrishna Naik, Edwin Peter Lobo, Samrat Sen, Govind Lal Sidhardh, Mir Allimuddin, Manik Banik
Principle of information causality rationalizes quantum composition Poster
2023.
@Poster{P6805,
title = {Principle of information causality rationalizes quantum composition},
author = {Ram Patra and Sahil Gopalkrishna Naik and Edwin Peter Lobo and Samrat Sen and Govind Lal Sidhardh and Mir Allimuddin and Manik Banik},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
171.
Seiseki Akibue, Go Kato, Seiichiro Tani
Probabilistic state synthesis based on optimal convex approximation. Poster
2023.
Abstract | Links:
@Poster{P3088,
title = {Probabilistic state synthesis based on optimal convex approximation.},
author = {Seiseki Akibue and Go Kato and Seiichiro Tani},
url = {https://arxiv.org/abs/2303.10860 https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1687849424-poster-3088.pdf},
year = {2023},
date = {2023-01-01},
abstract = {When preparing a pure state with a quantum circuit, there is an inevitable coherent error since each unitary gate suffers from the discretized coherent error due to fault-tolerant implementation. A recently proposed approach called probabilistic state synthesis, where the circuit is probabilistically sampled to turn such coherent errors into incoherent ones, is able to reduce the order of the approximation error compared to conventional deterministic synthesis. In this paper, we demonstrate that the optimal probabilistic synthesis quadratically reduces the approximation error with respect to the trace distance. We also show that a deterministic synthesis algorithm can be efficiently converted into a probabilistic one to achieve quadratic error reduction. To estimate how the error reduction reduces the circuit size, we show that probabilistic encoding asymptotically halves the length of the classical bit string, which provides a general lower bound on the circuit size, required to approximately encode a pure state. To derive these results, we prove general theorems about the optimal convex approximation of a quantum state by using a restricted subset of quantum states. As another application of our theorem, we provide exact formulas for the minimum trace distance between an entangled state and the set of separable states and alternate proof about a recently identified coincidence between an entanglement measure and a coherence measure.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
When preparing a pure state with a quantum circuit, there is an inevitable coherent error since each unitary gate suffers from the discretized coherent error due to fault-tolerant implementation. A recently proposed approach called probabilistic state synthesis, where the circuit is probabilistically sampled to turn such coherent errors into incoherent ones, is able to reduce the order of the approximation error compared to conventional deterministic synthesis. In this paper, we demonstrate that the optimal probabilistic synthesis quadratically reduces the approximation error with respect to the trace distance. We also show that a deterministic synthesis algorithm can be efficiently converted into a probabilistic one to achieve quadratic error reduction. To estimate how the error reduction reduces the circuit size, we show that probabilistic encoding asymptotically halves the length of the classical bit string, which provides a general lower bound on the circuit size, required to approximately encode a pure state. To derive these results, we prove general theorems about the optimal convex approximation of a quantum state by using a restricted subset of quantum states. As another application of our theorem, we provide exact formulas for the minimum trace distance between an entangled state and the set of separable states and alternate proof about a recently identified coincidence between an entanglement measure and a coherence measure.
172.
Gregory A. Hamilton, Felix Leditzky
Probing Multipartite Entanglement through Persistent Homology Poster
2023.
@Poster{P901,
title = {Probing Multipartite Entanglement through Persistent Homology},
author = {Gregory A. Hamilton and Felix Leditzky},
year = {2023},
date = {2023-01-01},
abstract = {We propose a study of multipartite entanglement through persistent homology, a tool
used in topological data analysis. In persistent homology, a 1-parameter filtration of simplicial
complexes called a persistence complex is used to reveal persistent topological features
of the underlying data set. This is achieved via the computation of homological invariants
that can be visualized as a persistence barcode encoding all relevant topological information.
In this work, we apply this technique to study multipartite quantum systems by interpreting
the individual systems as vertices of a simplicial complex. To construct a persistence
complex from a given multipartite quantum state, we use a generalization of the bipartite
mutual information called the deformed total correlation as the defining functional. This
correlation measure is monotonic with respect to tracing out systems, and thus defines a
valid filtration of simplicial complexes. Computing the persistence barcodes of this complex
yields a visualization or ‘topological fingerprint’ of the multipartite entanglement in the
quantum state. The barcodes can also be used to compute a topological summary called
the integrated Euler characteristic of a persistence complex. We show that for the persistence
complex defined in terms of the total correlation, this integrated Euler characteristic
is equal to the deformed interaction information, another multipartite version of mutual
information. In particular, when choosing the linear entropy as the underlying entropy, this
deformed interaction information coincides with the n-tangle, a well-known entanglement
monotone. The persistence barcodes therefore provide more fine-grained information about
the entanglement structure than its topological summary, the n-tangle, alone, which we
illustrate with examples of pairs of states with identical n-tangle but different barcodes.
Furthermore, a variant of persistent homology computed relative to a fixed subset yields an
interesting connection to strong subadditivity and entropy inequalities. Finally, we discuss
how our approach can be generalized to arbitrary resource theories by choosing suitable functionals such as generalized divergences.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
We propose a study of multipartite entanglement through persistent homology, a tool
used in topological data analysis. In persistent homology, a 1-parameter filtration of simplicial
complexes called a persistence complex is used to reveal persistent topological features
of the underlying data set. This is achieved via the computation of homological invariants
that can be visualized as a persistence barcode encoding all relevant topological information.
In this work, we apply this technique to study multipartite quantum systems by interpreting
the individual systems as vertices of a simplicial complex. To construct a persistence
complex from a given multipartite quantum state, we use a generalization of the bipartite
mutual information called the deformed total correlation as the defining functional. This
correlation measure is monotonic with respect to tracing out systems, and thus defines a
valid filtration of simplicial complexes. Computing the persistence barcodes of this complex
yields a visualization or ‘topological fingerprint’ of the multipartite entanglement in the
quantum state. The barcodes can also be used to compute a topological summary called
the integrated Euler characteristic of a persistence complex. We show that for the persistence
complex defined in terms of the total correlation, this integrated Euler characteristic
is equal to the deformed interaction information, another multipartite version of mutual
information. In particular, when choosing the linear entropy as the underlying entropy, this
deformed interaction information coincides with the n-tangle, a well-known entanglement
monotone. The persistence barcodes therefore provide more fine-grained information about
the entanglement structure than its topological summary, the n-tangle, alone, which we
illustrate with examples of pairs of states with identical n-tangle but different barcodes.
Furthermore, a variant of persistent homology computed relative to a fixed subset yields an
interesting connection to strong subadditivity and entropy inequalities. Finally, we discuss
how our approach can be generalized to arbitrary resource theories by choosing suitable functionals such as generalized divergences.
used in topological data analysis. In persistent homology, a 1-parameter filtration of simplicial
complexes called a persistence complex is used to reveal persistent topological features
of the underlying data set. This is achieved via the computation of homological invariants
that can be visualized as a persistence barcode encoding all relevant topological information.
In this work, we apply this technique to study multipartite quantum systems by interpreting
the individual systems as vertices of a simplicial complex. To construct a persistence
complex from a given multipartite quantum state, we use a generalization of the bipartite
mutual information called the deformed total correlation as the defining functional. This
correlation measure is monotonic with respect to tracing out systems, and thus defines a
valid filtration of simplicial complexes. Computing the persistence barcodes of this complex
yields a visualization or ‘topological fingerprint’ of the multipartite entanglement in the
quantum state. The barcodes can also be used to compute a topological summary called
the integrated Euler characteristic of a persistence complex. We show that for the persistence
complex defined in terms of the total correlation, this integrated Euler characteristic
is equal to the deformed interaction information, another multipartite version of mutual
information. In particular, when choosing the linear entropy as the underlying entropy, this
deformed interaction information coincides with the n-tangle, a well-known entanglement
monotone. The persistence barcodes therefore provide more fine-grained information about
the entanglement structure than its topological summary, the n-tangle, alone, which we
illustrate with examples of pairs of states with identical n-tangle but different barcodes.
Furthermore, a variant of persistent homology computed relative to a fixed subset yields an
interesting connection to strong subadditivity and entropy inequalities. Finally, we discuss
how our approach can be generalized to arbitrary resource theories by choosing suitable functionals such as generalized divergences.
173.
Guillem Müller-Rigat, Maciej Lewenstein, Irénée Frérot
Probing quantum entanglement from magnetic-sublevels populations: beyond spin squeezing inequalities Poster
2023.
@Poster{P7074,
title = {Probing quantum entanglement from magnetic-sublevels populations: beyond spin squeezing inequalities},
author = {Guillem Müller-Rigat and Maciej Lewenstein and Irénée Frérot},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
174.
Zeqiao Zhou, Yuxuan Du, Xinmei Tian, Dacheng Tao
QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum machines Poster
2023.
@Poster{P7032,
title = {QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum machines},
author = {Zeqiao Zhou and Yuxuan Du and Xinmei Tian and Dacheng Tao},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
175.
Jiannis Pachos, Chrysoula Vlachou
Quantifying fermionic interactions from the violation of Wick's theorem Poster
2023.
@Poster{P8643,
title = {Quantifying fermionic interactions from the violation of Wick's theorem},
author = {Jiannis Pachos and Chrysoula Vlachou},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
176.
Shigeo Hakkaku, Yuichiro Tashima, Kosuke Mitarai, Wataru Mizukami, Keisuke Fujii
Quantifying fermionic nonlinearity of quantum circuits Poster
2023.
Abstract | Links:
@Poster{P1467,
title = {Quantifying fermionic nonlinearity of quantum circuits},
author = {Shigeo Hakkaku and Yuichiro Tashima and Kosuke Mitarai and Wataru Mizukami and Keisuke Fujii},
url = {https://doi.org/10.1103/PhysRevResearch.4.043100 https://arxiv.org/abs/2111.14599},
year = {2023},
date = {2023-01-01},
abstract = {Variational quantum algorithms (VQAs) have been proposed as one of the most promising approaches to demonstrate quantum advantage on noisy intermediate-scale quantum (NISQ) devices. However, it has been unclear whether VQAs can maintain quantum advantage under the intrinsic noise of the NISQ devices, which deteriorates the quantumness. Here we propose a measure, called $textitfermionic nonlinearity$, to quantify the classical simulatability of quantum circuits designed for simulating fermionic Hamiltonians. Specifically, we construct a Monte Carlo type classical algorithm based on the classical simulatability of fermionic linear optics, whose sampling overhead is characterized by the fermionic nonlinearity. As a demonstration of these techniques, we calculate the upper bound of the fermionic nonlinearity of a rotation gate generated by four fermionic modes under the dephasing noise. Moreover, we estimate the sampling costs of the unitary coupled cluster singles and doubles quantum circuits for hydrogen chains subject to the dephasing noise. We find that, depending on the error probability and atomic spacing, there are regions where the fermionic nonlinearity becomes very small or unity, and hence the circuits are classically simulatable. We also study the overhead of a quantum error mitigation method when applying it to noisy parametrized quantum circuits and compare the overheads with the sampling costs of simulating error-free parametrized quantum circuits by our proposed method. We believe that our method and results help to design quantum circuits for fermionic systems with potential quantum advantages.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Variational quantum algorithms (VQAs) have been proposed as one of the most promising approaches to demonstrate quantum advantage on noisy intermediate-scale quantum (NISQ) devices. However, it has been unclear whether VQAs can maintain quantum advantage under the intrinsic noise of the NISQ devices, which deteriorates the quantumness. Here we propose a measure, called $textitfermionic nonlinearity$, to quantify the classical simulatability of quantum circuits designed for simulating fermionic Hamiltonians. Specifically, we construct a Monte Carlo type classical algorithm based on the classical simulatability of fermionic linear optics, whose sampling overhead is characterized by the fermionic nonlinearity. As a demonstration of these techniques, we calculate the upper bound of the fermionic nonlinearity of a rotation gate generated by four fermionic modes under the dephasing noise. Moreover, we estimate the sampling costs of the unitary coupled cluster singles and doubles quantum circuits for hydrogen chains subject to the dephasing noise. We find that, depending on the error probability and atomic spacing, there are regions where the fermionic nonlinearity becomes very small or unity, and hence the circuits are classically simulatable. We also study the overhead of a quantum error mitigation method when applying it to noisy parametrized quantum circuits and compare the overheads with the sampling costs of simulating error-free parametrized quantum circuits by our proposed method. We believe that our method and results help to design quantum circuits for fermionic systems with potential quantum advantages.
177.
Lucas Hutter, Rafael Chaves, Ranieri Vieira Nery, George Moreno, Daniel Jost Brod
Quantifying Quantum Causal Influences Poster
2023.
@Poster{P7718,
title = {Quantifying Quantum Causal Influences},
author = {Lucas Hutter and Rafael Chaves and Ranieri Vieira Nery and George Moreno and Daniel Jost Brod},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
178.
Thomas Elliott, Mile Gu, Andrew Garner, Jayne Thompson
Quantum Adaptive Agents with Efficient Long-Term Memories Poster
2023.
@Poster{P8418,
title = {Quantum Adaptive Agents with Efficient Long-Term Memories},
author = {Thomas Elliott and Mile Gu and Andrew Garner and Jayne Thompson},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
179.
Michael Oliveira, Luis Soares Barbosa, Ernesto F. Galvão
Quantum advantage in temporally flat measurement-based quantum computation Poster
2023.
Abstract | Links:
@Poster{P863,
title = {Quantum advantage in temporally flat measurement-based quantum computation},
author = {Michael Oliveira and Luis Soares Barbosa and Ernesto F. Galvão},
url = {https://arxiv.org/abs/2212.03668},
year = {2023},
date = {2023-01-01},
abstract = {Several classes of quantum circuits have been shown to provide a quantum computational advantage under certain assumptions. The study of ever more restricted classes of quantum circuits capable of quantum advantage is motivated by possible simplifications in experimental demonstrations. In this paper we study the efficiency of measurement-based quantum computation with a completely flat temporal ordering of measurements. We propose new constructions for the deterministic computation of arbitrary Boolean functions, drawing on correlations present in multi-qubit Greenberger, Horne, and Zeilinger (GHZ) states. We characterize the necessary measurement complexity using the Clifford hierarchy, and also generally decrease the number of qubits needed with respect to previous constructions. In particular, we identify a family of Boolean functions for which deterministic evaluation using non-adaptive MBQC is possible, featuring quantum advantage in width and number of gates with respect to classical circuits.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Several classes of quantum circuits have been shown to provide a quantum computational advantage under certain assumptions. The study of ever more restricted classes of quantum circuits capable of quantum advantage is motivated by possible simplifications in experimental demonstrations. In this paper we study the efficiency of measurement-based quantum computation with a completely flat temporal ordering of measurements. We propose new constructions for the deterministic computation of arbitrary Boolean functions, drawing on correlations present in multi-qubit Greenberger, Horne, and Zeilinger (GHZ) states. We characterize the necessary measurement complexity using the Clifford hierarchy, and also generally decrease the number of qubits needed with respect to previous constructions. In particular, we identify a family of Boolean functions for which deterministic evaluation using non-adaptive MBQC is possible, featuring quantum advantage in width and number of gates with respect to classical circuits.
180.
Sean Hallgren, Jianqiang Li
Quantum algorithms for the path-finding problem via the quantum electrical flow Poster
2023.
@Poster{P9451,
title = {Quantum algorithms for the path-finding problem via the quantum electrical flow},
author = {Sean Hallgren and Jianqiang Li},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
