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.
61.
Scott Aaronson, Jason Pollack
Discrete Bulk Reconstruction Poster
2023.
@Poster{P4645,
title = {Discrete Bulk Reconstruction},
author = {Scott Aaronson and Jason Pollack},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
62.
Shradhanjali Sahu
Discrete Modulation Continuous Variable Quantum Key Distribution in Multiple-Input Multiple-Output Settings Poster
2023.
@Poster{P8386,
title = {Discrete Modulation Continuous Variable Quantum Key Distribution in Multiple-Input Multiple-Output Settings},
author = {Shradhanjali Sahu},
year = {2023},
date = {2023-01-01},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
63.
Farzin Salek, Andreas Winter
Distillation of Secret Key and GHZ States from Multipartite Mixed States Poster
2023.
Abstract | Links:
@Poster{P1171,
title = {Distillation of Secret Key and GHZ States from Multipartite Mixed States},
author = {Farzin Salek and Andreas Winter},
url = {https://ieeexplore.ieee.org/document/9834630},
year = {2023},
date = {2023-01-01},
abstract = {We consider two related problems of extracting correlation from a given multipartite mixed quantum state: the first is the distillation of a conference key when the state is shared between a number of legal players and an eavesdropper; the eavesdropper, apart from starting off with this quantum side information, also observes the public communication between the players. The second is the distillation of Greenberger-Horne-Zeilinger (GHZ) states by means of LOCC from the given mixed state. These problem settings extend our previous paper [FS & AW, IEEE Trans. Inf. Theory 68(2):976-988, 2022], and we generalise its results: using a quantum version of the task of communication for omniscience, we derive a novel lower bound on the distillable secret key from any multipartite quantum state by means of a so-called non-interacting communication protocol. Secondly, by making the secret key distillation protocol coherent, we derive novel lower bounds on the distillation rate of GHZ states.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
We consider two related problems of extracting correlation from a given multipartite mixed quantum state: the first is the distillation of a conference key when the state is shared between a number of legal players and an eavesdropper; the eavesdropper, apart from starting off with this quantum side information, also observes the public communication between the players. The second is the distillation of Greenberger-Horne-Zeilinger (GHZ) states by means of LOCC from the given mixed state. These problem settings extend our previous paper [FS & AW, IEEE Trans. Inf. Theory 68(2):976-988, 2022], and we generalise its results: using a quantum version of the task of communication for omniscience, we derive a novel lower bound on the distillable secret key from any multipartite quantum state by means of a so-called non-interacting communication protocol. Secondly, by making the secret key distillation protocol coherent, we derive novel lower bounds on the distillation rate of GHZ states.
64.
Marco Erba, Paolo Perinotti, Davide Rolino, Alessandro Tosini
Disturbance does not imply complementarity Poster
2023.
Abstract | Links:
@Poster{P2358,
title = {Disturbance does not imply complementarity},
author = {Marco Erba and Paolo Perinotti and Davide Rolino and Alessandro Tosini},
url = {https://arxiv.org/abs/2305.16931 https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688121953-poster-2358.pdf},
year = {2023},
date = {2023-01-01},
abstract = {Among the strangest properties of quantum mechanics there is certainly the fact that acting on a quantum system disturbs it. This phenomenon has always been at the center of an extremely active line of research, and only recently, thanks to quantum information analysis tools, we have begun to understand it more deeply. In our work we continued the characterization of this property by demonstrating that this disturbance action is logically independent from the property of complementarity, i.e. the existence of couples of observables that is impossible to measure simultaneously. To do this we have built two different toy theories, called Minimal Classical Theory and Minimal Strongly-causal Bilocal Classical Theory within the framework of operational probabilistic theories, which posses the former property, but not the latter.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Among the strangest properties of quantum mechanics there is certainly the fact that acting on a quantum system disturbs it. This phenomenon has always been at the center of an extremely active line of research, and only recently, thanks to quantum information analysis tools, we have begun to understand it more deeply. In our work we continued the characterization of this property by demonstrating that this disturbance action is logically independent from the property of complementarity, i.e. the existence of couples of observables that is impossible to measure simultaneously. To do this we have built two different toy theories, called Minimal Classical Theory and Minimal Strongly-causal Bilocal Classical Theory within the framework of operational probabilistic theories, which posses the former property, but not the latter.
65.
Xiaogang Li, Chao Zheng, Jiancun Gao, Guilu Long
Dynamics simulation and numerical analysis of arbitrary time-dependent PT -symmetric system based on density operators Poster
2023.
@Poster{P6688,
title = {Dynamics simulation and numerical analysis of arbitrary time-dependent PT -symmetric system based on density operators},
author = {Xiaogang Li and Chao Zheng and Jiancun Gao and Guilu Long},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
66.
Giuseppe Catalano, Giacomo De Palma, Marco Fanizza, Vittorio Giovannetti
Efficiency Analysis of Continuous Variable Quantum Communication Lines in the Presence of Fluctuating Parameters Poster
2023.
Abstract | Links:
@Poster{P1954,
title = {Efficiency Analysis of Continuous Variable Quantum Communication Lines in the Presence of Fluctuating Parameters},
author = {Giuseppe Catalano and Giacomo De Palma and Marco Fanizza and Vittorio Giovannetti},
url = {https://arxiv.org/pdf/quant-ph/0304020.pdf https://arxiv.org/pdf/quant-ph/9912067.pdf},
year = {2023},
date = {2023-01-01},
abstract = {In the context of Quantum Communication theory, a lossy channel is a quantum channel that can describe a wide variety of scenarios that cause an attenuation of the input signal, such as the transmission in an optical fiber or free-space communication. From the mathematical point of view, a lossy channel is described as an interaction, mediated by a beam-splitter with fixed transmissivity, between the input state and the environment state, which is the vacuum state.
In some realistic situations, as the transmission of photons through the atmosphere, the noise that affects the quantum carrier cannot be described by a single lossy channel, because of the fluctuations in the loss parameter. Therefore, it is better to model these scenarios considering an ensemble of lossy channels.
The classical capacity of a quantum channel is the asymptotic rate of transmission of classical information, sent from a sender to a receiver, when the quantum system that carries the information is subject to the noise described by the quantum channel. If sender and receiver share an unlimited amount of entanglement that can be used to improve the communication, one can define the entanglement-assisted classical capacity. In this work, we studied some families of channels, that are convex combinations of two different lossy channels and, in order to describe such a convex combination, we used an ancillary qubit that selects one or the other channel. We found that, for those channels, there exist quantum states with a better communication performance with respect to the thermal state with the same energy; this is surprising because it is known that a thermal state is the best choice for a single lossy channel. However, using the methods developed in this work, it is possible to model even more general scenarios, in order to improve the quantum communication performance of more realistic noises.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
In the context of Quantum Communication theory, a lossy channel is a quantum channel that can describe a wide variety of scenarios that cause an attenuation of the input signal, such as the transmission in an optical fiber or free-space communication. From the mathematical point of view, a lossy channel is described as an interaction, mediated by a beam-splitter with fixed transmissivity, between the input state and the environment state, which is the vacuum state.
In some realistic situations, as the transmission of photons through the atmosphere, the noise that affects the quantum carrier cannot be described by a single lossy channel, because of the fluctuations in the loss parameter. Therefore, it is better to model these scenarios considering an ensemble of lossy channels.
The classical capacity of a quantum channel is the asymptotic rate of transmission of classical information, sent from a sender to a receiver, when the quantum system that carries the information is subject to the noise described by the quantum channel. If sender and receiver share an unlimited amount of entanglement that can be used to improve the communication, one can define the entanglement-assisted classical capacity. In this work, we studied some families of channels, that are convex combinations of two different lossy channels and, in order to describe such a convex combination, we used an ancillary qubit that selects one or the other channel. We found that, for those channels, there exist quantum states with a better communication performance with respect to the thermal state with the same energy; this is surprising because it is known that a thermal state is the best choice for a single lossy channel. However, using the methods developed in this work, it is possible to model even more general scenarios, in order to improve the quantum communication performance of more realistic noises.
In some realistic situations, as the transmission of photons through the atmosphere, the noise that affects the quantum carrier cannot be described by a single lossy channel, because of the fluctuations in the loss parameter. Therefore, it is better to model these scenarios considering an ensemble of lossy channels.
The classical capacity of a quantum channel is the asymptotic rate of transmission of classical information, sent from a sender to a receiver, when the quantum system that carries the information is subject to the noise described by the quantum channel. If sender and receiver share an unlimited amount of entanglement that can be used to improve the communication, one can define the entanglement-assisted classical capacity. In this work, we studied some families of channels, that are convex combinations of two different lossy channels and, in order to describe such a convex combination, we used an ancillary qubit that selects one or the other channel. We found that, for those channels, there exist quantum states with a better communication performance with respect to the thermal state with the same energy; this is surprising because it is known that a thermal state is the best choice for a single lossy channel. However, using the methods developed in this work, it is possible to model even more general scenarios, in order to improve the quantum communication performance of more realistic noises.
67.
Yusuke Kimura, Hidetoshi Nishimori
Efficiency-guaranteed protocol of simulated quantum annealing Poster
2023.
@Poster{P7842,
title = {Efficiency-guaranteed protocol of simulated quantum annealing},
author = {Yusuke Kimura and Hidetoshi Nishimori},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
68.
Masahito Hayashi, Yuxiang Yang
Efficient algorithms for quantum information bottleneck Poster
2023.
@Poster{P2657,
title = {Efficient algorithms for quantum information bottleneck},
author = {Masahito Hayashi and Yuxiang Yang},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
69.
Qi-Ming Ding
Efficient estimation of multipartite quantum coherence Poster
2023.
@Poster{P112,
title = {Efficient estimation of multipartite quantum coherence},
author = {Qi-Ming Ding},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
70.
Daniel McNulty, Filip Maciejewski, Susane Calegari, Joanna Majsak, Michał Oszmaniec
Efficient Joint Measurement Schemes for Estimating Non-Commuting Observables in Quantum Systems Poster
2023.
@Poster{P1151,
title = {Efficient Joint Measurement Schemes for Estimating Non-Commuting Observables in Quantum Systems},
author = {Daniel McNulty and Filip Maciejewski and Susane Calegari and Joanna Majsak and Michał Oszmaniec},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
71.
Xiantao Li, Chunhao Wang
Efficient Quantum Algorithms for Quantum Optimal Control Poster
2023.
@Poster{P3928,
title = {Efficient Quantum Algorithms for Quantum Optimal Control},
author = {Xiantao Li and Chunhao Wang},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
72.
Quynh Nguyen
Efficient qudit circuits for the mixed Schur transform and applications Poster
2023.
@Poster{P3587,
title = {Efficient qudit circuits for the mixed Schur transform and applications},
author = {Quynh Nguyen},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
73.
Benoit Seron, Leonardo Novo, Alex Arkhipov, Nicolas Cerf
Efficient validation of Boson Sampling from binned photon-number distributions Poster
2023.
@Poster{P3284,
title = {Efficient validation of Boson Sampling from binned photon-number distributions},
author = {Benoit Seron and Leonardo Novo and Alex Arkhipov and Nicolas Cerf},
year = {2023},
date = {2023-01-01},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
74.
V. Vilasini, Renato Renner
Embedding cyclic causal structures in acyclic spacetimes: no-go results for process matrices Poster
2023.
@Poster{P3482,
title = {Embedding cyclic causal structures in acyclic spacetimes: no-go results for process matrices},
author = {V. Vilasini and Renato Renner},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
75.
Alexander Dalzell, B. David Clader, Grant Salton, Mario Berta, Cedric Yen-Yu Lin, David Bader, Nikitas Stamatopoulos, Martin Schuetz, Fernando Brandao, Helmut Katzgraber, William Zeng
End-to-end analysis for quantum interior point methods with improved block-encodings Poster
2023.
@Poster{P5394,
title = {End-to-end analysis for quantum interior point methods with improved block-encodings},
author = {Alexander Dalzell and B. David Clader and Grant Salton and Mario Berta and Cedric Yen-Yu Lin and David Bader and Nikitas Stamatopoulos and Martin Schuetz and Fernando Brandao and Helmut Katzgraber and William Zeng},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
76.
Gerard Anglès Munné, Valentin Kasper, Felix Huber
Engineering holography with stabilizer graph codes Poster
2023.
@Poster{P4664,
title = {Engineering holography with stabilizer graph codes},
author = {Gerard Anglès Munné and Valentin Kasper and Felix Huber},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
77.
Albert Rico, Felix Huber
Entanglement detection with trace polynomials Poster
2023.
@Poster{P746,
title = {Entanglement detection with trace polynomials},
author = {Albert Rico and Felix Huber},
year = {2023},
date = {2023-01-01},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
78.
Som Kanjilal, Vivek Pandey, Arun Kumar Pati
Entanglement meter: estimation of entanglement with single copy in interferometer Poster
2023.
@Poster{P3798,
title = {Entanglement meter: estimation of entanglement with single copy in interferometer},
author = {Som Kanjilal and Vivek Pandey and Arun Kumar Pati},
url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688117290-poster-Estimation_of_entanglement_with_single_copy_inerferometer.pdf},
year = {2023},
date = {2023-01-01},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
79.
Yidong Chen, Marius Junge
Entropy Decay Estimates for Collective Noise Models Poster
2023.
@Poster{P4396,
title = {Entropy Decay Estimates for Collective Noise Models},
author = {Yidong Chen and Marius Junge},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
80.
William Kirby, Mario Motta, Antonio Mezzacapo
Exact and efficient Lanczos method on a quantum computer Poster
2023.
@Poster{P138,
title = {Exact and efficient Lanczos method on a quantum computer},
author = {William Kirby and Mario Motta and Antonio Mezzacapo},
url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688141647-poster-138.pdf},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
81.
Anita Camillini, Ernesto Galvão, Fabio Sciarrino
Experimental use of coherence and dimension in a programmable integrated interferometer Poster
2023.
@Poster{P760,
title = {Experimental use of coherence and dimension in a programmable integrated interferometer},
author = {Anita Camillini and Ernesto Galvão and Fabio Sciarrino},
url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688123255-poster-0760.pdf},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
82.
Victor Montenegro, Sougato Bose, Abolfazl Bayat
Exploiting Sequential Measurements for Quantum Sensing Beyond the Standard Limit Poster
2023.
@Poster{P1243,
title = {Exploiting Sequential Measurements for Quantum Sensing Beyond the Standard Limit},
author = {Victor Montenegro and Sougato Bose and Abolfazl Bayat},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
83.
Dávid Jakab, Adrian Solymos, Zoltán Zimboras
Extendibility of Werner States Poster
2023.
Abstract | Links:
@Poster{P815,
title = {Extendibility of Werner States},
author = {Dávid Jakab and Adrian Solymos and Zoltán Zimboras},
url = {https://arxiv.org/abs/2208.13743},
year = {2023},
date = {2023-01-01},
abstract = {We investigate the two-sided symmetric extendibility problem of Werner states. The interplay of the unitary symmetry of these states and the inherent bipartite permutation symmetry of the extendibility scenario allows us to map this problem into the ground state problem of a highly symmetric spin-model Hamiltonian. We solve this ground state problem analytically by utilizing the representation theory of SU(d), in particular a result related to the dominance order of Young diagrams in Littlewood-Richarson decompositions. As a result, we obtain necessary and sufficient conditions for the extendibility of Werner states for arbitrary extension size and local dimension. Interestingly, the range of extendible states has a non-trivial trade-off between the extension sizes on the two sides. We compare our result with the two-sided extendibility problem of isotropic states, where there is no such trade-off.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
We investigate the two-sided symmetric extendibility problem of Werner states. The interplay of the unitary symmetry of these states and the inherent bipartite permutation symmetry of the extendibility scenario allows us to map this problem into the ground state problem of a highly symmetric spin-model Hamiltonian. We solve this ground state problem analytically by utilizing the representation theory of SU(d), in particular a result related to the dominance order of Young diagrams in Littlewood-Richarson decompositions. As a result, we obtain necessary and sufficient conditions for the extendibility of Werner states for arbitrary extension size and local dimension. Interestingly, the range of extendible states has a non-trivial trade-off between the extension sizes on the two sides. We compare our result with the two-sided extendibility problem of isotropic states, where there is no such trade-off.
84.
Anubhav Chaturvedi
Extending loophole-free nonlocal correlations to arbitrarily large distances Poster
2023.
@Poster{P6850,
title = {Extending loophole-free nonlocal correlations to arbitrarily large distances},
author = {Anubhav Chaturvedi},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
85.
Marcin Kotowski, Michał Oszmaniec, Michał Horodecki
Extremal jumps of circuit complexity of unitary evolutions generated by random Hamiltonians Poster
2023.
@Poster{P1223,
title = {Extremal jumps of circuit complexity of unitary evolutions generated by random Hamiltonians},
author = {Marcin Kotowski and Michał Oszmaniec and Michał Horodecki},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
86.
Alexis Schotte, Lander Burgelman, Guanyu Zhu
Fault-tolerant error correction for a universal non-Abelian topological quantum computer at finite temperature Poster
2023.
@Poster{P4907,
title = {Fault-tolerant error correction for a universal non-Abelian topological quantum computer at finite temperature},
author = {Alexis Schotte and Lander Burgelman and Guanyu Zhu},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
87.
Shradhanjali Sahu
Finite-key Analysis for Continuous Variable Quantum Key Distribution in Multiple-Input Multiple-Output Settings Poster
2023.
@Poster{P9192,
title = {Finite-key Analysis for Continuous Variable Quantum Key Distribution in Multiple-Input Multiple-Output Settings},
author = {Shradhanjali Sahu},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
88.
Thais Lima Silva, Lucas Borges, Leandro Aolita
Fourier-based quantum signal processing Poster
2023.
@Poster{P5525,
title = {Fourier-based quantum signal processing},
author = {Thais Lima Silva and Lucas Borges and Leandro Aolita},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
89.
Víctor Zapatero, Wenyuan Wang, Li Qian, Bing Qi, Hoi-Kwong Lo, Marcos Curty
Fully passive state preparation in quantum cryptography Poster
2023.
Abstract | Links:
@Poster{P1096,
title = {Fully passive state preparation in quantum cryptography},
author = {Víctor Zapatero and Wenyuan Wang and Li Qian and Bing Qi and Hoi-Kwong Lo and Marcos Curty},
url = {https://iopscience.iop.org/article/10.1088/2058-9565/acbc46 https://journals.aps.org/prl/accepted/2e07cY2eLe01fc7aa8969d71cad7efd2d3eb34432},
year = {2023},
date = {2023-01-01},
abstract = {We present the first linear optics setup suitable for fully passive QKD, in so solving a ten-year-old problem in the field. Our proposal carefully merges two previously known ideas. Namely, a scheme that passively generates random photon polarizations in a plane, and a scheme that passively generates random intensity laser pulses. While the former is required for passive polarization encoding, the latter is necessary to tightly estimate the secret key rate in the absence of perfect single-photon sources. In addition, we provide a novel parameter estimation technique and non-asymptotic bounds on the secret key length.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
We present the first linear optics setup suitable for fully passive QKD, in so solving a ten-year-old problem in the field. Our proposal carefully merges two previously known ideas. Namely, a scheme that passively generates random photon polarizations in a plane, and a scheme that passively generates random intensity laser pulses. While the former is required for passive polarization encoding, the latter is necessary to tightly estimate the secret key rate in the absence of perfect single-photon sources. In addition, we provide a novel parameter estimation technique and non-asymptotic bounds on the secret key length.
90.
Shinichiro Yamano, Takaya Matsuura, Yui Kuramochi, Toshihiko Sasaki, Masato Koashi
General treatment of trusted receiver noise in continuous variable quantum key distribution Poster
2023.
Abstract | Links:
@Poster{P3447,
title = {General treatment of trusted receiver noise in continuous variable quantum key distribution},
author = {Shinichiro Yamano and Takaya Matsuura and Yui Kuramochi and Toshihiko Sasaki and Masato Koashi},
url = {https://arxiv.org/abs/2305.17684},
year = {2023},
date = {2023-01-01},
abstract = {Continuous Variable (CV) quantum key distribution (QKD) is a promising candidate for practical implementations due to its compatibility with the existing communication technology. A trusted device scenario assuming that an adversary has no access to imperfections such as electronic noises in the detector is expected to provide significant improvement in the key rate, but such an endeavor so far was made separately for specific protocols and for specific proof techniques. Here, we develop a simple and general treatment that can incorporate the effects of Gaussian trusted noises for any protocol that uses homodyne/heterodyne measurements. In our method, a rescaling of the outcome of a noisy homodyne/heterodyne detector renders it equivalent to the outcome of a noiseless detector with a tiny additional loss, thanks to a noise-loss equivalence well-known in quantum optics. Since this method is independent of protocols and security proofs, it is applicable to Gaussian-modulation and discrete-modulation protocols, to the finite-size regime, and to any proof techniques developed so far and yet to be discovered as well.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Continuous Variable (CV) quantum key distribution (QKD) is a promising candidate for practical implementations due to its compatibility with the existing communication technology. A trusted device scenario assuming that an adversary has no access to imperfections such as electronic noises in the detector is expected to provide significant improvement in the key rate, but such an endeavor so far was made separately for specific protocols and for specific proof techniques. Here, we develop a simple and general treatment that can incorporate the effects of Gaussian trusted noises for any protocol that uses homodyne/heterodyne measurements. In our method, a rescaling of the outcome of a noisy homodyne/heterodyne detector renders it equivalent to the outcome of a noiseless detector with a tiny additional loss, thanks to a noise-loss equivalence well-known in quantum optics. Since this method is independent of protocols and security proofs, it is applicable to Gaussian-modulation and discrete-modulation protocols, to the finite-size regime, and to any proof techniques developed so far and yet to be discovered as well.
91.
James Moran
Generalised Susskind-Glogower coherent states Poster
2023.
@Poster{P7339,
title = {Generalised Susskind-Glogower coherent states},
author = {James Moran},
year = {2023},
date = {2023-01-01},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
92.
Pablo Arrighi, Amelia Durbec, Matt Wilson
Generalised tensors and traces Poster
2023.
@Poster{P4754,
title = {Generalised tensors and traces},
author = {Pablo Arrighi and Amelia Durbec and Matt Wilson},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
93.
Hamid Tebyanian
Generation Rate of Homodyne-base Quantum Random Number Generator Vs. Input States’ Phase Poster
2023.
@Poster{P9895,
title = {Generation Rate of Homodyne-base Quantum Random Number Generator Vs. Input States’ Phase},
author = {Hamid Tebyanian},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
94.
Lorenzo Maccone, Vittorio Giovannetti, Seth Lloyd
Geometric Event-Based Quantum Mechanics Poster
2023.
@Poster{P8790,
title = {Geometric Event-Based Quantum Mechanics},
author = {Lorenzo Maccone and Vittorio Giovannetti and Seth Lloyd},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
95.
Louis Schatzki, Quynh Nguyen, Paolo Braccia, Michael Ragone, Patrick Coles, Martin Larocca, Frederic Sauvage, Marco Cerezo
Geometric Quantum Machine Learning Theory and Guarantees Poster
2023.
@Poster{P3103,
title = {Geometric Quantum Machine Learning Theory and Guarantees},
author = {Louis Schatzki and Quynh Nguyen and Paolo Braccia and Michael Ragone and Patrick Coles and Martin Larocca and Frederic Sauvage and Marco Cerezo},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
96.
Jan Střeleček
Geometry of quantum state manifolds Poster
2023.
Abstract | Links:
@Poster{P6758,
title = {Geometry of quantum state manifolds},
author = {Jan Střeleček},
url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688134313-poster-6758.pdf},
year = {2023},
date = {2023-01-01},
abstract = {We explore the geometrical structure of Quantum State Manifolds for parametric driven Hamiltonian systems, derived from the Fubini-Study metric. Such a structure has applications in areas such as quantum phase transitions theory, decohering quantum state driving, or quantum anneling. We conduct a geometrical analysis of a single-qubit and fully-connected multi-qubit model, with a special interest in diabolic points and the ground state manifold geodesics.},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
We explore the geometrical structure of Quantum State Manifolds for parametric driven Hamiltonian systems, derived from the Fubini-Study metric. Such a structure has applications in areas such as quantum phase transitions theory, decohering quantum state driving, or quantum anneling. We conduct a geometrical analysis of a single-qubit and fully-connected multi-qubit model, with a special interest in diabolic points and the ground state manifold geodesics.
97.
Arsalan Motamedi, Pooya Ronagh
Gibbs Sampling of Periodic Potentials on a Quantum Computer Poster
2023.
@Poster{P1845,
title = {Gibbs Sampling of Periodic Potentials on a Quantum Computer},
author = {Arsalan Motamedi and Pooya Ronagh},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
98.
Jonathan Conrad, Jens Eisert, Jean-Pierre Seifert
Good Gottesman-Kitaev-Preskill codes from the NTRU cryptosystem Poster
2023.
@Poster{P4148,
title = {Good Gottesman-Kitaev-Preskill codes from the NTRU cryptosystem},
author = {Jonathan Conrad and Jens Eisert and Jean-Pierre Seifert},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
99.
Jop Briet, Francisco Escudero Gutiérrez, Sander Gribling
Grothendieck inequalities characterize converses to the polynomial method Poster
2023.
Abstract | Links:
@Poster{P272,
title = {Grothendieck inequalities characterize converses to the polynomial method},
author = {Jop Briet and Francisco Escudero Gutiérrez and Sander Gribling},
url = {https://arxiv.org/abs/2212.08559},
year = {2023},
date = {2023-01-01},
abstract = {A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the famous Grothendieck constant. Here we show that such a result does not generalize to quartic polynomials and 2-query algorithms, even when we allow for additive approximations. We also show that the additive approximation implied by their result is tight for bounded bilinear forms, which gives a new characterization of the Grothendieck constant in terms of 1-query quantum algorithms. Along the way we provide reformulations of the completely bounded norm of a form, and its dual norm.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the famous Grothendieck constant. Here we show that such a result does not generalize to quartic polynomials and 2-query algorithms, even when we allow for additive approximations. We also show that the additive approximation implied by their result is tight for bounded bilinear forms, which gives a new characterization of the Grothendieck constant in terms of 1-query quantum algorithms. Along the way we provide reformulations of the completely bounded norm of a form, and its dual norm.
100.
Youle Wang, Chenghong Zhu, Mingrui Jing, Xin Wang
Ground state preparation with shallow variational warm-start Poster
2023.
@Poster{P1967,
title = {Ground state preparation with shallow variational warm-start},
author = {Youle Wang and Chenghong Zhu and Mingrui Jing and Xin Wang},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
101.
Jordi Weggemans, Marten Folkertsma, Chris Cade
Guidable Local Hamiltonian Problems with Implications to Heuristic Ansatze State Preparation and the Quantum PCP Conjecture Poster
2023.
@Poster{P2790,
title = {Guidable Local Hamiltonian Problems with Implications to Heuristic Ansatze State Preparation and the Quantum PCP Conjecture},
author = {Jordi Weggemans and Marten Folkertsma and Chris Cade},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
102.
Zoltán Udvarnoki, Gábor Fáth, Norbert Fogarasi
Hardware requirements of option pricing with the quantum Monte Carlo method Poster
2023.
Abstract | Links:
@Poster{P3797,
title = {Hardware requirements of option pricing with the quantum Monte Carlo method},
author = {Zoltán Udvarnoki and Gábor Fáth and Norbert Fogarasi},
url = {https://doi.org/10.48550/arXiv.2209.15592 https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688117290-poster-Estimation_of_entanglement_with_single_copy_inerferometer.pdf},
year = {2023},
date = {2023-01-01},
abstract = {Efficient certification and quantification of high dimensional entanglement of composite systems are challenging both theoretically as well as experimentally. Here, we demonstrate how to measure the linear entropy, negativity and the Schmidt number of bipartite systems from the visibility of Mach–Zehnder interferometer using single copies of the quantum state. Our result shows that for any two qubit pure bipartite state, the interference visibility is a direct measure of entanglement. We also propose how to measure the mutual predictability experimentally from the intensity patterns of the interferometric set-up without having to resort to local measurements of mutually unbiased bases. Furthermore, we show that the entanglement witness operator can be measured in a interference setup and the phase shift is sensitive to the separable or entangled nature of the state. Our proposal bring out the power of Interferometric set-up in entanglement detection of pure and several mixed states which paves the way towards design of entanglement meter.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Efficient certification and quantification of high dimensional entanglement of composite systems are challenging both theoretically as well as experimentally. Here, we demonstrate how to measure the linear entropy, negativity and the Schmidt number of bipartite systems from the visibility of Mach–Zehnder interferometer using single copies of the quantum state. Our result shows that for any two qubit pure bipartite state, the interference visibility is a direct measure of entanglement. We also propose how to measure the mutual predictability experimentally from the intensity patterns of the interferometric set-up without having to resort to local measurements of mutually unbiased bases. Furthermore, we show that the entanglement witness operator can be measured in a interference setup and the phase shift is sensitive to the separable or entangled nature of the state. Our proposal bring out the power of Interferometric set-up in entanglement detection of pure and several mixed states which paves the way towards design of entanglement meter.
103.
Luciano Iván Pereira Valenzuela
Hardware-efficient entangled measurements for variational quantum algorithms Poster
2023.
@Poster{P9692,
title = {Hardware-efficient entangled measurements for variational quantum algorithms},
author = {Luciano Iván Pereira Valenzuela},
year = {2023},
date = {2023-01-01},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
104.
Kfir Dolev, Sam Cree
Holography as a resource for non-local quantum computation Poster
2023.
@Poster{P5459,
title = {Holography as a resource for non-local quantum computation},
author = {Kfir Dolev and Sam Cree},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
105.
Khashayar Barooti, Grzegorz Gluch, Marc-Olivier Renou
How hard is it to fake entanglement? A complexity theoretic view of nonlocality and its applications to delegating quantum computation Poster
2023.
@Poster{P6098,
title = {How hard is it to fake entanglement? A complexity theoretic view of nonlocality and its applications to delegating quantum computation},
author = {Khashayar Barooti and Grzegorz Gluch and Marc-Olivier Renou},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
106.
Francesco Mazzoncini, Balthazar Bauer, Peter Brown, Romain Alléaume
Hybrid Quantum Cryptography from Communication Complexity Poster
2023.
@Poster{P3901,
title = {Hybrid Quantum Cryptography from Communication Complexity},
author = {Francesco Mazzoncini and Balthazar Bauer and Peter Brown and Romain Alléaume},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
107.
Thais Lima Silva, Márcio Taddei, Stefano Carrazza, Leandro Aolita
Imaginary-time evolution algorithms for intermediate-scale quantum signal processors Poster
2023.
Abstract | Links:
@Poster{P6436,
title = {Imaginary-time evolution algorithms for intermediate-scale quantum signal processors},
author = {Thais Lima Silva and Márcio Taddei and Stefano Carrazza and Leandro Aolita},
url = {https://arxiv.org/abs/2110.13180},
year = {2023},
date = {2023-01-01},
abstract = {Simulating quantum imaginary-time evolution (QITE) is a major promise of quantum computation. However, the known algorithms are either probabilistic (repeat until success) with unpractically small success probabilities
or coherent (quantum amplitude amplification) but with circuit depths and ancillary-qubit numbers unrealistically large in the mid-term. Our main contribution is a new generation of deterministic, high-precision QITE algorithms that are significantly more amenable experimentally. These are based on a surprisingly simple idea: partitioning the evolution into several fragments that are sequentially run probabilistically. This causes a huge reduction in wasted circuit depth every time a run fails. Indeed, the resulting overall runtime is asymptotically better than in coherent approaches, and the hardware requirements are comparable to probabilistic ones. Our findings are especially relevant for the early fault-tolerance stages of quantum hardware.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Simulating quantum imaginary-time evolution (QITE) is a major promise of quantum computation. However, the known algorithms are either probabilistic (repeat until success) with unpractically small success probabilities
or coherent (quantum amplitude amplification) but with circuit depths and ancillary-qubit numbers unrealistically large in the mid-term. Our main contribution is a new generation of deterministic, high-precision QITE algorithms that are significantly more amenable experimentally. These are based on a surprisingly simple idea: partitioning the evolution into several fragments that are sequentially run probabilistically. This causes a huge reduction in wasted circuit depth every time a run fails. Indeed, the resulting overall runtime is asymptotically better than in coherent approaches, and the hardware requirements are comparable to probabilistic ones. Our findings are especially relevant for the early fault-tolerance stages of quantum hardware.
or coherent (quantum amplitude amplification) but with circuit depths and ancillary-qubit numbers unrealistically large in the mid-term. Our main contribution is a new generation of deterministic, high-precision QITE algorithms that are significantly more amenable experimentally. These are based on a surprisingly simple idea: partitioning the evolution into several fragments that are sequentially run probabilistically. This causes a huge reduction in wasted circuit depth every time a run fails. Indeed, the resulting overall runtime is asymptotically better than in coherent approaches, and the hardware requirements are comparable to probabilistic ones. Our findings are especially relevant for the early fault-tolerance stages of quantum hardware.
108.
Ark Modi, Alonso Viladomat Jasso, Roberto Ferrara, Christian Deppe, Janis Noetzel, Fred Fung, Maximilian Schaedler
Implementation and Realisation of Stereographic Quantum and Quantum-Inspired K Nearest-Neighbour Clustering Poster
2023.
@Poster{P9928,
title = {Implementation and Realisation of Stereographic Quantum and Quantum-Inspired K Nearest-Neighbour Clustering},
author = {Ark Modi and Alonso Viladomat Jasso and Roberto Ferrara and Christian Deppe and Janis Noetzel and Fred Fung and Maximilian Schaedler},
year = {2023},
date = {2023-01-01},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
109.
Oriel Kiss, Michele Grossi, Alessandro Roggero
Importance sampling for stochastic quantum simulation Poster
2023.
@Poster{P2848,
title = {Importance sampling for stochastic quantum simulation},
author = {Oriel Kiss and Michele Grossi and Alessandro Roggero},
url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688421124-poster-2848.pdf https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688421124-video-2848_TQC_Kiss.mp4},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
110.
Xoel Sixto, Guillermo Currás-Lorenzo, Kiyoshi Tamaki, Marcos Curty
Improved security bounds for quantum key distribution with non-uniform phase randomization Poster
2023.
Abstract | Links:
@Poster{P6287,
title = {Improved security bounds for quantum key distribution with non-uniform phase randomization},
author = {Xoel Sixto and Guillermo Currás-Lorenzo and Kiyoshi Tamaki and Marcos Curty},
url = {https://arxiv.org/pdf/2304.03562.pdf},
year = {2023},
date = {2023-01-01},
abstract = {Decoy-state quantum key distribution (QKD) is undoubtedly the most efficient solution to han- dle multi-photon signals emitted by laser sources, and provides the same secret key rate scaling as ideal single-photon sources. It requires, however, that the phase of each emitted pulse is uniformly random. This might be difficult to guarantee in practice, due to inevitable device imperfections and/or the use of an external phase modulator for phase randomization, which limits the possible selected phases to a finite set. Here, we investigate the security of decoy-state QKD with arbitrary, continuous or discrete, non-uniform phase randomization, and show that this technique is quite robust to deviations from the ideal uniformly random scenario. For this, we combine a novel param- eter estimation technique based on semi-definite programming, with the use of basis mismatched events, to tightly estimate the parameters that determine the achievable secret key rate. In doing so, we demonstrate that our analysis can significantly outperform previous results that address more restricted scenarios.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
Decoy-state quantum key distribution (QKD) is undoubtedly the most efficient solution to han- dle multi-photon signals emitted by laser sources, and provides the same secret key rate scaling as ideal single-photon sources. It requires, however, that the phase of each emitted pulse is uniformly random. This might be difficult to guarantee in practice, due to inevitable device imperfections and/or the use of an external phase modulator for phase randomization, which limits the possible selected phases to a finite set. Here, we investigate the security of decoy-state QKD with arbitrary, continuous or discrete, non-uniform phase randomization, and show that this technique is quite robust to deviations from the ideal uniformly random scenario. For this, we combine a novel param- eter estimation technique based on semi-definite programming, with the use of basis mismatched events, to tightly estimate the parameters that determine the achievable secret key rate. In doing so, we demonstrate that our analysis can significantly outperform previous results that address more restricted scenarios.
111.
Willers Yang, Patrick Rall
Improved Synthesis of Clifford Circuits using Long-Range CAT States Poster
2023.
Abstract | Links:
@Poster{P2827,
title = {Improved Synthesis of Clifford Circuits using Long-Range CAT States},
author = {Willers Yang and Patrick Rall},
url = {https://arxiv.org/abs/2302.06537},
year = {2023},
date = {2023-01-01},
abstract = {In superconducting architectures, limited connectivity remains a significant challenge for the synthesis and compilation of quantum circuits. We consider models of entanglement-assisted computation where long-range operations are achieved through injections of entangled CAT states. These are prepared using ancillary qubits acting as an "entanglement bus," unlocking global operation primitives such as multi-qubit Pauli rotations and fan out gates. We derive bounds on the circuit size for several well-studied problems, such as CZ circuit, CX circuit, and Clifford circuit synthesis. In particular, in an architecture using one such entanglement bus, we show that Clifford operations require at most $2n+1$ layers of entangled-state-injections, significantly improving upon the best known SWAP-based approaches which achieve an entangling-gate-depth of $7n−4$. In a square-lattice architecture with two entanglement buses, we show that a graph state can be synthesized using at most $łceil n/2 rceil +1$ layers of CAT state injections, and Clifford operations require only $łceil 3n/2 rceil +O(sqrtn)$ layers of CAT state injections.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
In superconducting architectures, limited connectivity remains a significant challenge for the synthesis and compilation of quantum circuits. We consider models of entanglement-assisted computation where long-range operations are achieved through injections of entangled CAT states. These are prepared using ancillary qubits acting as an "entanglement bus," unlocking global operation primitives such as multi-qubit Pauli rotations and fan out gates. We derive bounds on the circuit size for several well-studied problems, such as CZ circuit, CX circuit, and Clifford circuit synthesis. In particular, in an architecture using one such entanglement bus, we show that Clifford operations require at most $2n+1$ layers of entangled-state-injections, significantly improving upon the best known SWAP-based approaches which achieve an entangling-gate-depth of $7n−4$. In a square-lattice architecture with two entanglement buses, we show that a graph state can be synthesized using at most $łceil n/2 rceil +1$ layers of CAT state injections, and Clifford operations require only $łceil 3n/2 rceil +O(sqrtn)$ layers of CAT state injections.
112.
Alastair Abbott, Mehdi Mhalla, Pierre Pocreau
Improving social welfare in non-cooperative games with different types of quantum resources Poster
2023.
@Poster{P8919,
title = {Improving social welfare in non-cooperative games with different types of quantum resources},
author = {Alastair Abbott and Mehdi Mhalla and Pierre Pocreau},
url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688648288-poster-8919.pdf},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
113.
Nikola Paunković, Marko Vojinović, Ricardo Faleiro
Indefinite causal orders in optical and gravitational switches and quantum mechanical closed timelike curves Poster
2023.
Abstract | Links:
@Poster{P1130,
title = {Indefinite causal orders in optical and gravitational switches and quantum mechanical closed timelike curves},
author = {Nikola Paunković and Marko Vojinović and Ricardo Faleiro},
url = {https://arxiv.org/abs/1905.09682 https://arxiv.org/abs/2010.16042},
year = {2023},
date = {2023-01-01},
abstract = {We analyse optical realisations of the quantum switch using 4 and 3 spacetime events in classical spacetimes with fixed causal orders, and the realisation of a gravitational switch with only 2 spacetime events that features superpositions of different gravitational field
configurations and their respective causal orders. We construct an observable that can
distinguish between the quantum switch realisations in classical spacetimes, and
gravitational switch implementations in superposed spacetimes. Also, we analyse the
single-particle two-way communication protocol recently introduced by del Santo and
Dakić, showing that the interaction with the vacuum should be treated as an operation, on
equal footing with all other interactions. This way, precisely from the operational point of view, we argue in favour of the spacetime causal description. Finally, we present a protocol that features quantum-mechanical closed timelike curves in the presence of superposed gravitational fields, which do not require exotic spacetime topology.},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
We analyse optical realisations of the quantum switch using 4 and 3 spacetime events in classical spacetimes with fixed causal orders, and the realisation of a gravitational switch with only 2 spacetime events that features superpositions of different gravitational field
configurations and their respective causal orders. We construct an observable that can
distinguish between the quantum switch realisations in classical spacetimes, and
gravitational switch implementations in superposed spacetimes. Also, we analyse the
single-particle two-way communication protocol recently introduced by del Santo and
Dakić, showing that the interaction with the vacuum should be treated as an operation, on
equal footing with all other interactions. This way, precisely from the operational point of view, we argue in favour of the spacetime causal description. Finally, we present a protocol that features quantum-mechanical closed timelike curves in the presence of superposed gravitational fields, which do not require exotic spacetime topology.
configurations and their respective causal orders. We construct an observable that can
distinguish between the quantum switch realisations in classical spacetimes, and
gravitational switch implementations in superposed spacetimes. Also, we analyse the
single-particle two-way communication protocol recently introduced by del Santo and
Dakić, showing that the interaction with the vacuum should be treated as an operation, on
equal footing with all other interactions. This way, precisely from the operational point of view, we argue in favour of the spacetime causal description. Finally, we present a protocol that features quantum-mechanical closed timelike curves in the presence of superposed gravitational fields, which do not require exotic spacetime topology.
114.
Rafael Wagner, Rui Soares Barbosa, Ernesto Galvao
Inequalities witnessing coherence, nonlocality, and contextuality Poster
2023.
@Poster{P9629,
title = {Inequalities witnessing coherence, nonlocality, and contextuality},
author = {Rafael Wagner and Rui Soares Barbosa and Ernesto Galvao},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
115.
Lucas Pollyceno, Rafael Chaves, Rafael Rabelo
Information causality in multipartite scenarios Poster
2023.
@Poster{P9232,
title = {Information causality in multipartite scenarios},
author = {Lucas Pollyceno and Rafael Chaves and Rafael Rabelo},
url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688143466-poster-9232.pdf},
year = {2023},
date = {2023-01-01},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
116.
Islam Faisal
Interactive Oracle Arguments in the QROM and Applications to Succinct Verification of Quantum Computation Poster
2023.
@Poster{P2568,
title = {Interactive Oracle Arguments in the QROM and Applications to Succinct Verification of Quantum Computation},
author = {Islam Faisal},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
117.
Swati Kumari, Javid Naikoo, Sibasish Ghosh, Alok Pan
Interplay of nonlocality and incompatibility breaking qubit channels Poster
2023.
@Poster{P8808,
title = {Interplay of nonlocality and incompatibility breaking qubit channels},
author = {Swati Kumari and Javid Naikoo and Sibasish Ghosh and Alok Pan},
url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688272331-poster-8808.pdf},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
118.
Getahun Fikadu, Amit Pandey
Investigating The Effects of Hyperparameters in Quantum Enhanced Deep Reinforcement Learning Poster
2023.
@Poster{P2069,
title = {Investigating The Effects of Hyperparameters in Quantum Enhanced Deep Reinforcement Learning},
author = {Getahun Fikadu and Amit Pandey},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
119.
Michael Bremner, Bin Cheng, Zhengfeng Ji
IQP Sampling and Verifiable Quantum Advantage: Stabilizer Constructions and Classical Security Poster
2023.
@Poster{P2321,
title = {IQP Sampling and Verifiable Quantum Advantage: Stabilizer Constructions and Classical Security},
author = {Michael Bremner and Bin Cheng and Zhengfeng Ji},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
120.
Angela Karanjai, Stephen Bartlett
Kochen-Spekker contextuality as a statistical property that requires non-Markovian modelling Poster
2023.
@Poster{P2503,
title = {Kochen-Spekker contextuality as a statistical property that requires non-Markovian modelling},
author = {Angela Karanjai and Stephen Bartlett},
year = {2023},
date = {2023-01-01},
howpublished = {Poster},
keywords = {},
pubstate = {published},
tppubtype = {Poster}
}
