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.

Simon Apers, Stacey Jeffery, Galina Pass, Michael Walter

(No) Quantum space-time tradeoff for USTCON Poster

2023.

@Poster{P735,

title = {(No) Quantum space-time tradeoff for USTCON},

author = {Simon Apers and Stacey Jeffery and Galina Pass and Michael Walter},

year = {2023},

date = {2023-01-01},

urldate = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Kuo-Chin Chen, Simon Apers, Min-Hsiu Hsieh

(Quantum) complexity of testing signed graph clusterability Talk

2024.

@Talk{T24_234,

title = {(Quantum) complexity of testing signed graph clusterability},

author = {Kuo-Chin Chen and Simon Apers and Min-Hsiu Hsieh},

year = {2024},

date = {2024-01-01},

abstract = {This study examines clusterability testing for a signed graph in the bounded-degree model. Our contributions are two-fold. First, we provide a quantum algorithm with query complexity $tildeO(N^1/3)$ for testing clusterability, which yields a polynomial speedup over the best classical clusterability tester known [Florian Adriaens and Simon Apers. Testing cluster properties of signed graphs.]. Second, we prove an $tildeØmega(sqrtN)$ classical query lower bound for testing clusterability, which nearly matches the upper bound from citeadriaens2021testing. This settles the classical query complexity of clusterability testing, and it shows that our quantum algorithm has an advantage over any classical algorithm.},

keywords = {},

pubstate = {published},

tppubtype = {Talk}

}

Mark Webster, Armanda Quintavalle, Stephen Bartlett

8 Algorithms for Transversal Diagonal Logical Operators of Stabiliser Codes Workshop

2023.

Abstract | Links:

@Workshop{T1119,

title = {8 Algorithms for Transversal Diagonal Logical Operators of Stabiliser Codes},

author = {Mark Webster and Armanda Quintavalle and Stephen Bartlett},

url = {https://arxiv.org/abs/2303.15615},

year = {2023},

date = {2023-01-01},

urldate = {2023-01-01},

abstract = {Storing quantum information in a quantum error correction code can protect it from errors, but the ability to transform the stored quantum information in a fault tolerant way is equally important.

Logical Pauli group operators can be implemented on Calderbank-Shor-Steane (CSS) codes, a commonly-studied category of codes, by applying a series of physical Pauli X and Z gates. Logical operators of this form are fault-tolerant because each qubit is acted upon by at most one gate, limiting the spread of errors, and are referred to as transversal logical operators. Identifying transversal logical operators outside the Pauli group is less well understood. Pauli operators are the first level of the Clifford hierarchy which is deeply connected to fault-tolerance and universality.

In this work, we study transversal logical operators composed of single- and multi-qubit diagonal Clifford hierarchy gates. We demonstrate algorithms for identifying all transversal diagonal logical operators on a CSS code that are more general or have lower computational complexity than previous methods. We also show a method for constructing CSS codes that have a desired diagonal logical Clifford hierarchy operator implemented using single qubit phase gates. Our methods rely on representing operators composed of diagonal Clifford hierarchy gates as diagonal XP operators and this technique may have broader applications.},

howpublished = {Talk},

keywords = {},

pubstate = {published},

tppubtype = {Workshop}

}

Logical Pauli group operators can be implemented on Calderbank-Shor-Steane (CSS) codes, a commonly-studied category of codes, by applying a series of physical Pauli X and Z gates. Logical operators of this form are fault-tolerant because each qubit is acted upon by at most one gate, limiting the spread of errors, and are referred to as transversal logical operators. Identifying transversal logical operators outside the Pauli group is less well understood. Pauli operators are the first level of the Clifford hierarchy which is deeply connected to fault-tolerance and universality.

In this work, we study transversal logical operators composed of single- and multi-qubit diagonal Clifford hierarchy gates. We demonstrate algorithms for identifying all transversal diagonal logical operators on a CSS code that are more general or have lower computational complexity than previous methods. We also show a method for constructing CSS codes that have a desired diagonal logical Clifford hierarchy operator implemented using single qubit phase gates. Our methods rely on representing operators composed of diagonal Clifford hierarchy gates as diagonal XP operators and this technique may have broader applications.

Minseong Kim

A bulk-wise unitary theory of measurement in holographic gravity based on quantum error correction Poster

2023.

@Poster{P7737,

title = {A bulk-wise unitary theory of measurement in holographic gravity based on quantum error correction},

author = {Minseong Kim},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Mário Silva, Ricardo Faleiro, Paulo Mateus, Emmanuel Zambrini Cruzeiro

A coherence-based game and applications to semi-device-independent quantum key distribution Poster

2023.

Abstract | Links:

@Poster{P3680,

title = {A coherence-based game and applications to semi-device-independent quantum key distribution},

author = {Mário Silva and Ricardo Faleiro and Paulo Mateus and Emmanuel Zambrini Cruzeiro},

url = {https://arxiv.org/abs/2103.06829},

year = {2023},

date = {2023-01-01},

abstract = {Semi-device-independent quantum key distribution aims at reaching a compromise between the highest level of untrustness, device-independence, and experimental feasibility. Semi-quantum key distribution is an interesting approach whose purpose is to reduce the quantum technological requirements of users, whilst still guaranteeing security, in order to develop simple and hardware fault-tolerant quantum key distribution protocols. In this work, we introduce a coherence-based semi-quantum, semi-device-independent, quantum key distribution protocol where users only need to implement classical operations i.e. fixed basis detections, and prove its security in the bounded quantum storage model. The protocol is based on the noise-robust version of a coherence equality game that witnesses different types of coherence.},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Libor Caha, Xavier Coiteux-Roy, Robert Koenig

A colossal advantage: 3D-local noisy shallow quantum circuits defeat unbounded fan-in classical circuits Talk

2024.

@Talk{T24_208,

title = {A colossal advantage: 3D-local noisy shallow quantum circuits defeat unbounded fan-in classical circuits},

author = {Libor Caha and Xavier Coiteux-Roy and Robert Koenig},

year = {2024},

date = {2024-01-01},

abstract = {We present a computational problem with the following properties: (i) Every instance can be solved with near-certainty by a constant-depth quantum circuit using only nearest-neighbor gates in 3D, even when its implementation is corrupted by noise. (ii) Any constant-depth classical circuit composed of unbounded fan-in AND, OR, as well as NOT gates, i.e., an AC0-circuit, of size smaller than a certain subexponential, fails to solve a uniformly random instance with probability greater than a certain constant. Such an advantage against unbounded fan-in classical circuits was previously only known in the noise-free case or when ignoring locality constraints. By overcoming these limitations, we are thus proposing the strongest unconditional, fault-tolerant quantum-advantage demonstration to date. Subexponential circuit-complexity lower bounds have traditionally been referred to as exponential. We use the term colossal since our fault-tolerant 3D architecture resembles a certain Roman monument.},

keywords = {},

pubstate = {published},

tppubtype = {Talk}

}

Alexandre Clément, Nicolas Heurtel, Shane Mansfield, Simon Perdrix, Benoît Valiron

A Complete Equational Theory for Quantum Circuits Workshop

2023.

@Workshop{T4856,

title = {A Complete Equational Theory for Quantum Circuits},

author = {Alexandre Clément and Nicolas Heurtel and Shane Mansfield and Simon Perdrix and Benoît Valiron},

year = {2023},

date = {2023-01-01},

abstract = {We introduce the first complete equational theory for quantum circuits. More precisely, we introduce a set of circuit equations that we prove to be sound and complete: two circuits represent the same quantum evolution if and only if they can be transformed one into the other using the equations. The proof is based on the properties of multi-controlled gates – that are defined using elementary gates – together with an encoding of quantum circuits into linear optical circuits, for which we introduce a complete axiomatisation. This completeness result lays the formal foundation for the development of compiling tasks like circuit optimisation, hardware constraint satisfaction, and circuit verification.},

howpublished = {Talk},

keywords = {},

pubstate = {published},

tppubtype = {Workshop}

}

David Cui, Giulio Malavolta, Arthur Mehta, Anand Natarajan, Connor Paddock, Simon Schmidt, Michael Walter, Tina Zhang

A Computational Tsirelson's Theorem for the Value of Compiled XOR Games Talk

2024.

@Talk{T24_235,

title = {A Computational Tsirelson's Theorem for the Value of Compiled XOR Games},

author = {David Cui and Giulio Malavolta and Arthur Mehta and Anand Natarajan and Connor Paddock and Simon Schmidt and Michael Walter and Tina Zhang},

year = {2024},

date = {2024-01-01},

abstract = {Nonlocal games are a foundational tool for understanding entanglement and constructing quantum protocols in settings with multiple spatially separated quantum devices. In this work, we continue the study initiated by Kalai et al. (STOC '23) of compiled nonlocal games, played between a classical verifier and a single cryptographically limited quantum device. Our main result is that the compiler proposed by Kalai et al. is sound for any two-player XOR game. A celebrated theorem of Tsirelson shows that for XOR games, the quantum value is exactly given by a semidefinite program, and we obtain our result by showing that the SDP upper bound holds for the compiled game up to a negligible error arising from the compilation. This answers a question raised by Natarajan and Zhang (FOCS '23), who showed soundness for the specific case of the CHSH game. Using our techniques, we obtain several additional results, including (1) tight bounds on the compiled value of parallel-repeated XOR games, (2) operator self-testing statements for any compiled XOR game, and (3) a "nice" sum-of-squares certificate for any XOR game, from which operator rigidity is manifest.},

keywords = {},

pubstate = {published},

tppubtype = {Talk}

}

Anurag Anshu, Nikolas Breuckmann

A construction of Combinatorial NLTS Poster

2023.

@Poster{P2307,

title = {A construction of Combinatorial NLTS},

author = {Anurag Anshu and Nikolas Breuckmann},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Aleksandrs Belovs

A Direct Reduction from the Polynomial to the Adversary Method Talk

2024.

@Talk{T24_288,

title = {A Direct Reduction from the Polynomial to the Adversary Method},

author = {Aleksandrs Belovs},

year = {2024},

date = {2024-01-01},

abstract = {The polynomial and the adversary methods are the two main tools for proving lower bounds on query complexity of quantum algorithms. Both methods have found a large number of applications, some problems more suitable for one method, some for the other. It is known though that the adversary method, in its general negative-weighted version, is tight for bounded-error quantum algorithms, whereas the polynomial method is not. By the tightness of the former, for any polynomial lower bound, there ought to exist a corresponding adversary lower bound. However, direct reduction was not known. In this paper, we give a simple and direct reduction from the polynomial method (in the form of a dual polynomial) to the adversary method. This shows that any lower bound in the form of a dual polynomial is actually an adversary lower bound of a specific form.},

keywords = {},

pubstate = {published},

tppubtype = {Talk}

}

V. Vilasini, Mischa Woods

A general quantum circuit framework for consistent logical reasoning in Wigner's friend scenarios Poster

2023.

@Poster{P2333,

title = {A general quantum circuit framework for consistent logical reasoning in Wigner's friend scenarios},

author = {V. Vilasini and Mischa Woods},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Shalev Ben-David, Rory Soiffer

A Generalized Adversary Method for Quantum Query Complexity Poster

2023.

@Poster{P693,

title = {A Generalized Adversary Method for Quantum Query Complexity},

author = {Shalev Ben-David and Rory Soiffer},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Yifan Jia, Ángela Capel

A generic quantum Wielandt's inequality Poster

2023.

@Poster{P3563,

title = {A generic quantum Wielandt's inequality},

author = {Yifan Jia and Ángela Capel},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Tuomas Laakkonen, Konstantinos Meichanetzidis, John Wetering

A Graphical #SAT Algorithm for Formulae with Small Clause Density Workshop

2023.

@Workshop{T157,

title = {A Graphical #SAT Algorithm for Formulae with Small Clause Density},

author = {Tuomas Laakkonen and Konstantinos Meichanetzidis and John Wetering},

year = {2023},

date = {2023-01-01},

abstract = {We study the counting version of the Boolean satisfiability problem sSAT using the ZH-calculus, a graphical language originally introduced to reason about quantum circuits. Using this we find a natural extension of #SAT which we call #SAT_±, where variables are additionally labelled by phases, which is GapP-complete. Using graphical reasoning, we find a reduction from #SAT to #2SAT_± in the ZH-calculus. We observe that the DPLL algorithm for #2SAT can be adapted to #2SAT_± directly and hence that Wahlstrom's $O^*(1.2377^n)$ upper bound applies to #2SAT_± as well. Combining this with our reduction from #SAT to #2SAT_± gives us novel upper bounds in terms of clauses and variables that are better than $O^*(2^n)$ for small clause densities of $fracmn < 2.25$. This is to our knowledge the first non-trivial upper bound for #SAT that is independent of clause size. Our algorithm improves on Dubois' upper bound for #kSAT whenever $fracmn < 1.85$ and $k geq 4$, and the Williams' average-case analysis whenever $fracmn < 1.21$ and $k geq 6$. We also obtain an upper bound of $O^*(1.1740^L)$ for $sSAT$ in terms of the length of the formula, and find an improved bound on $#textbf3SAT$ for $1.2577 < fracmn łeq frac73$. Our results demonstrate that graphical reasoning can lead to new algorithmic insights, even outside the domain of quantum computing that the calculus was intended for. In addition, using the connection to counting problems, we find a new classical simulation algorithm for quantum computations that runs in $O(1.38^g)$ where g is the number of gates.},

howpublished = {Talk},

keywords = {},

pubstate = {published},

tppubtype = {Workshop}

}

Louis Schatzki, Guangkuo Liu, Marco Cerezo, Eric Chitambar

A Hierarchy of Multipartite Correlations Based on Concentratable Entanglement Poster

2023.

@Poster{P7780,

title = {A Hierarchy of Multipartite Correlations Based on Concentratable Entanglement},

author = {Louis Schatzki and Guangkuo Liu and Marco Cerezo and Eric Chitambar},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Peter Bierhorst, Jitendra Prakash

A Hierarchy of Multipartite Nonlocality and Device-Independent Effect Witnesses Poster

2023.

@Poster{P6997,

title = {A Hierarchy of Multipartite Nonlocality and Device-Independent Effect Witnesses},

author = {Peter Bierhorst and Jitendra Prakash},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Francesco Buscemi, Kodai Kobayashi, Shintaro Minagawa, Paolo Perinotti, Alessandro Tosini

A hierarchy of resource theories of quantum incompatibility Poster

2023.

@Poster{P3455,

title = {A hierarchy of resource theories of quantum incompatibility},

author = {Francesco Buscemi and Kodai Kobayashi and Shintaro Minagawa and Paolo Perinotti and Alessandro Tosini},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

You Zhou, Zhenhuan Liu

A hybrid framework for estimating nonlinear functions of quantum states Poster

2023.

@Poster{P1173,

title = {A hybrid framework for estimating nonlinear functions of quantum states},

author = {You Zhou and Zhenhuan Liu},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Emiel Koridon, Joana Fraxanet, Alexandre Dauphin, Lucas Visscher, Thomas E. O'Brien, Stefano Polla

A hybrid quantum algorithm to detect conical intersections Poster

2023.

@Poster{P1199,

title = {A hybrid quantum algorithm to detect conical intersections},

author = {Emiel Koridon and Joana Fraxanet and Alexandre Dauphin and Lucas Visscher and Thomas E. O'Brien and Stefano Polla},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Matteo Rosati

A learning theory for quantum photonic processors and beyond Poster

2023.

@Poster{P2095,

title = {A learning theory for quantum photonic processors and beyond},

author = {Matteo Rosati},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Harriet Apel, Toby Cubitt

A mathematical framework for quantum Hamiltonian simulation and duality Poster

2023.

@Poster{P6723,

title = {A mathematical framework for quantum Hamiltonian simulation and duality},

author = {Harriet Apel and Toby Cubitt},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Yao-Ting Lin

A Note on Quantum Phase Estimation Poster

2023.

@Poster{P9716,

title = {A Note on Quantum Phase Estimation},

author = {Yao-Ting Lin},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Michele Grossi, Giovanni Di Bartolomeo, Michele Vischi, Francesco Cesa, Roman Wixinger, Sandro Donadi, Angelo Bassi

A novel approach to noisy gates for simulating quantum computers Poster

2023.

@Poster{P2157,

title = {A novel approach to noisy gates for simulating quantum computers},

author = {Michele Grossi and Giovanni Di Bartolomeo and Michele Vischi and Francesco Cesa and Roman Wixinger and Sandro Donadi and Angelo Bassi},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

James Sud, Stuart Hadfield, Eleanor Rieffel, Norm Tubman, Tad Hogg

A Parameter Setting Heuristic for the Quantum Alternating Operator Ansatz Poster

2023.

@Poster{P1925,

title = {A Parameter Setting Heuristic for the Quantum Alternating Operator Ansatz},

author = {James Sud and Stuart Hadfield and Eleanor Rieffel and Norm Tubman and Tad Hogg},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Raul Santos, Lorenzo Buffoni, Yasser Omar

A path towards distributed quantum annealing Poster

2023.

@Poster{P3594,

title = {A path towards distributed quantum annealing},

author = {Raul Santos and Lorenzo Buffoni and Yasser Omar},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Giancarlo Camilo, Thais Lima Silva, Lucas Borges, Leandro Aolita

A quantum algorithm for Metropolis sampling via fragmented matrix monomials Poster

2023.

@Poster{P3230,

title = {A quantum algorithm for Metropolis sampling via fragmented matrix monomials},

author = {Giancarlo Camilo and Thais Lima Silva and Lucas Borges and Leandro Aolita},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Debbie Huey Chih Lim, Patrick Rebentrost

A Quantum Online Portfolio Optimization Algorithm Poster

2023.

@Poster{P2283,

title = {A Quantum Online Portfolio Optimization Algorithm},

author = {Debbie Huey Chih Lim and Patrick Rebentrost},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Adam Sawicki, Piotr Dulian

A random matrix model for random approximate t-designs Poster

2023.

@Poster{P3646,

title = {A random matrix model for random approximate t-designs},

author = {Adam Sawicki and Piotr Dulian},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Alexander Dalzell

A shortcut to a near-optimal quantum linear system solver Talk

2024.

@Talk{T24_325,

title = {A shortcut to a near-optimal quantum linear system solver},

author = {Alexander Dalzell},

year = {2024},

date = {2024-01-01},

abstract = {Given a linear system of equations Ax = b, quantum linear system solvers (QLSSs) approximately prepare a quantum state |x⟩ for which the amplitudes are proportional to the solution vector x. Asymptotically optimal QLSSs have query complexity O(κlog(1/ε)), where κ is the condition number of A, and ε is the approximation error. However, runtime guarantees for existing optimal and near-optimal QLSSs do not have favorable constant factors, in part because they rely on complex or difficult-to-analyze techniques like variable-time amplitude amplification and adiabatic path-following. Here, we give a conceptually simple, near-optimal QLSS that does not use these techniques. If the solution norm ∥x∥∥A∥/∥b∥ is known exactly, our QLSS requires only a single application of kernel reflection (an extension of eigenstate filtering), and has query complexity (1 + O(ε))κ ln(2√2/ε). If the norm is not known, it can be estimated up to a constant factor using O(log log(κ)) applications of kernel projection (a slight generalization of eigenstate filtering), yielding a QLSS with near-optimal total complexity O(κ log log(κ) log log log(κ) + κ log(1/ε)). Preliminary constant-factor analysis suggests that for practical values of κ, ε our QLSS provides rigorous guarantees that are at least an order of magnitude better than previous guarantees.},

keywords = {},

pubstate = {published},

tppubtype = {Talk}

}

Dong An, Jin-Peng Liu, Daochen Wang, Qi Zhao

A theory of quantum differential equation solvers: limitations and fast-forwarding Poster

2023.

@Poster{P2911,

title = {A theory of quantum differential equation solvers: limitations and fast-forwarding},

author = {Dong An and Jin-Peng Liu and Daochen Wang and Qi Zhao},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Adrian Chapman, Samuel Elman, Ryan Mann

A Unified Graph-Theoretic Framework for Free-Fermion Solvability Workshop

2023.

Abstract | Links:

@Workshop{T6118,

title = {A Unified Graph-Theoretic Framework for Free-Fermion Solvability},

author = {Adrian Chapman and Samuel Elman and Ryan Mann},

url = {https://arxiv.org/pdf/2305.15625.pdf},

year = {2023},

date = {2023-01-01},

abstract = {We show that a quantum spin system has an exact description by noninteracting fermions if its frustration graph is claw-free and contains a simplicial clique. The frustration graph of a spin model captures the pairwise anticommutation relations between Pauli terms of its Hamiltonian in a given basis. This result captures a vast family of known free-fermion solutions. In previous work, it was shown that a free-fermion solution exists if the frustration graph is either a line graph, or (even-hole, claw)-free. The former case generalizes the celebrated Jordan-Wigner transformation and includes the exact solution to the Kitaev honeycomb model. The latter case generalizes a nonlocal solution to the four-fermion model given by Fendley. Our characterization unifies these two approaches, extending generalized Jordan-Wigner solutions to the nonlocal setting and generalizing the four-fermion solution to models of arbitrary spatial dimension. Our key technical insight is the identification of a class of cycle symmetries for all models with claw-free frustration graphs. We prove that these symmetries commute, and this allows us to apply Fendley's solution method to each symmetric subspace independently. Finally, we give a physical description of the fermion modes in terms of operators generated by repeated commutation with the Hamiltonian. This connects our framework to the developing body of work on operator Krylov subspaces. Our results deepen the existing connection between many-body physics and the mathematical theory of claw-free graphs.},

howpublished = {Talk},

keywords = {},

pubstate = {published},

tppubtype = {Workshop}

}

William J. Huggins, Jarrod R. McClean

Accelerating Quantum Algorithms with Precomputation Poster

2023.

@Poster{P5286,

title = {Accelerating Quantum Algorithms with Precomputation},

author = {William J. Huggins and Jarrod R. McClean},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Mafalda Ramôa, Raffaele Santagati, Ernesto Galvão

ADAPT-VQE: Impact of Noise, Importance of Symmetries, and Circuit Depth Reduction via Operator Removal Poster

2023.

Abstract | Links:

@Poster{P5664,

title = {ADAPT-VQE: Impact of Noise, Importance of Symmetries, and Circuit Depth Reduction via Operator Removal},

author = {Mafalda Ramôa and Raffaele Santagati and Ernesto Galvão},

url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688166002-poster-5664.pdf https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688166002-video-5664.mp4},

year = {2023},

date = {2023-01-01},

abstract = {VQE is a popular contender for a chance at quantum advantage with NISQ computers. ADAPT-VQE, an adaptive and problem-tailored variant, is a promising option for building accurate and compact ansätze. In this work, we use the $latex H_2$ molecule to assess the impact of noise on the error and shot requirements of this algorithm relative to UCCSD-VQE, a static alternative. Additionally, we introduce three novel operator pools that allow us to analyze the importance of symmetry preservation in ADAPT-VQE. Finally, we propose a strategy for reducing the depth of the ADAPT ansatz by removing operators on the fly. Our conclusions are three-fold: (i) a shot count reduction stemming from the compactness of the ADAPT ansatz alleviates the measurement overhead predicted from a noise-free analysis, (ii) symmetry preservation is the key aspect promoting convergence in fermion-inspired pools and (iii) a frugal operator removal protocol often allows us to obtain shallower circuits in exchange for a small cost overhead.},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Jef Pauwels, Stefano Pironio, Emmanuel Zambrini Cruzeiro, Armin Tavakoli

Adaptive advantage in entanglement-assisted communications Poster

2023.

@Poster{P1241,

title = {Adaptive advantage in entanglement-assisted communications},

author = {Jef Pauwels and Stefano Pironio and Emmanuel Zambrini Cruzeiro and Armin Tavakoli},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Grégoire Gliniasty, Rawad Mezher, Damian Markham

Adaptivity as a key ingredient for fault-tolerant non-Clifford gates Poster

2023.

@Poster{P7454,

title = {Adaptivity as a key ingredient for fault-tolerant non-Clifford gates},

author = {Grégoire Gliniasty and Rawad Mezher and Damian Markham},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Ioannis Kolotouros, Ioannis Petrongonas, Milos Prokop, Petros Wallden

Adiabatic quantum computing with parameterized quantum circuits Poster

2023.

@Poster{P4516,

title = {Adiabatic quantum computing with parameterized quantum circuits},

author = {Ioannis Kolotouros and Ioannis Petrongonas and Milos Prokop and Petros Wallden},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Dyon Vreumingen, Kareljan Schoutens

Adiabatic state preparation of fermionic many-body systems through tensor eigendecomposition Poster

2023.

Abstract | Links:

@Poster{P1613,

title = {Adiabatic state preparation of fermionic many-body systems through tensor eigendecomposition},

author = {Dyon Vreumingen and Kareljan Schoutens},

url = {https://arxiv.org/abs/2305.01284},

year = {2023},

date = {2023-01-01},

abstract = {A well-known method to prepare ground states of fermionic many-body hamiltonians is adiabatic state preparation, in which an easy to prepare state is time-evolved towards an approximate ground state under a specific time-dependent hamiltonian. However, which path to take in the evolution is often unclear, and a direct linear interpolation, which is the most common method, may not be optimal. In this work, we explore new types of adiabatic paths based on an eigendecomposition of the coefficient tensor in the second quantised representation of the difference between the final and initial hamiltonian (the residual hamiltonian). Since there is an equivalence between this tensor and a projection of the residual hamiltonian onto the subspace of two particles, this approach is essentially a two-body spectral decomposition. We show how for general hamiltonians, the adiabatic time complexity may be upper bounded in terms of the number of one-body modes $latex L$ and a minimal gap $latex Delta$ along the path. Our finding is that the complexity is determined primarily by the degree of pairing in the two-body states. As a result, systems whose two-body eigenstates are uniform superpositions of distinct fermion pairs tend to exhibit maximal complexity, which scales as $latex O(L^4/Delta^3)$ in direct interpolation and $latex O(L^6/Delta^3)$ in an evolution that follows a path along the corners of a hypercube in parameter space. The usefulness of our method is demonstrated through a few examples involving Fermi-Hubbard models where, due to symmetries, level crossings occur in direct interpolation. We show that our method of decomposing the residual hamiltonian and thereby deviating from a direct path appropriately breaks the relevant symmetries, thus avoiding level crossings and enabling an adiabatic passage.},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Ranyiliu Chen, Laura Mančinska, Jurij Volčič

All Projective Measurements Can be Self-tested Workshop

2023.

Abstract | Links:

@Workshop{T1712,

title = {All Projective Measurements Can be Self-tested},

author = {Ranyiliu Chen and Laura Mančinska and Jurij Volčič},

url = {https://arxiv.org/abs/2302.00974},

year = {2023},

date = {2023-01-01},

abstract = {We show that every real-valued projective measurement can be self-tested from correlations. To achieve this, we develop the theory of post-hoc self-testing, which extends existing self-tested strategies to incorporate new measurements. A sufficient and computationally feasible condition for a projective measurement to be post-hoc self-tested by a given strategy is proven. Recent work by Mančinska et al. [arXiv:2103.01729] showed that a strategy containing $d+1$ two-output projective measurements and the maximally entangled state with the local dimension d is self-tested. Applying the post-hoc self-testing technique to this work results in an extended strategy that can incorporate any real-valued projective measurement. We further study the general theory of iterative post-hoc self-testing whenever the state in the initial strategy is maximally entangled and characterize the iteratively post-hoc self-tested measurements in terms of a Jordan algebra generated by the initial strategy.},

howpublished = {Talk},

keywords = {},

pubstate = {published},

tppubtype = {Workshop}

}

Jef Pauwels, Stefano Pironio, Erik Woodhead, Armin Tavakoli

Almost qudits in the prepare-and-measure scenario Workshop

2023.

Abstract | Links:

@Workshop{T1960,

title = {Almost qudits in the prepare-and-measure scenario},

author = {Jef Pauwels and Stefano Pironio and Erik Woodhead and Armin Tavakoli},

url = {https://arxiv.org/abs/2208.07887},

year = {2023},

date = {2023-01-01},

abstract = {Quantum communication is often investigated in scenarios where only the dimension of Hilbert space is known. However, assigning a precise dimension is often an approximation of what is actually a higher-dimensional process. Here, we introduce and investigate quantum information encoded in carriers that nearly, but not entirely, correspond to standard qudits. We demonstrate the relevance of this concept for semi-device-independent quantum information by showing how small higher-dimensional components can significantly compromise the conclusions of established protocols. Then we provide a general method, based on semidefinite relaxations, for bounding the set of almost qudit correlations, and apply it to remedy the demonstrated issues. This method also offers a novel systematic approach to the well-known task of device-independent tests of classical and quantum dimensions with unentangled devices. Finally, we also consider viewing almost qubit systems as a physical resource available to the experimenter and determine the optimal quantum protocol for the well-known Random Access Code.},

howpublished = {Talk},

keywords = {},

pubstate = {published},

tppubtype = {Workshop}

}

Afrad Muhamed Basheer, Yuan Feng, Christopher Ferrie, Sanjiang Li

Alternating Layered Variational Quantum Circuits Can Be Classically Optimized Efficiently Using Classical Shadows Poster

2023.

@Poster{P4948,

title = {Alternating Layered Variational Quantum Circuits Can Be Classically Optimized Efficiently Using Classical Shadows},

author = {Afrad Muhamed Basheer and Yuan Feng and Christopher Ferrie and Sanjiang Li},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Itai Arad, Raz Firanko, Rahul Jain

An area law for the maximally-mixed ground state in arbitrarily degenerate systems with good AGSP Talk

2024.

@Talk{T24_417,

title = {An area law for the maximally-mixed ground state in arbitrarily degenerate systems with good AGSP},

author = {Itai Arad and Raz Firanko and Rahul Jain},

year = {2024},

date = {2024-01-01},

abstract = {We show an area law in the mutual information for the maximally-mixed state Ω in the ground space of general Hamiltonians, which is independent of the underlying ground space degeneracy. Our result assumes the existence of a `good' approximation to the ground state projector (a good AGSP), a crucial ingredient in former area-law proofs. Such approximations have been explicitly derived for 1D gapped local Hamiltonians and 2D frustration-free and locally-gapped local Hamiltonians. As a corollary, we show that in 1D gapped local Hamiltonians, for any $eps>0$ and any bi-partition $Lcup L^c$ of the system, beginalign* I^eps_max(L:L^c)_Ømega łe bigO łog (|L|) + łog(1/eps), endalign* where $|L|$ represents the number of sites in $L$ and $I^eps_max(L:L^c)_Ømega$ represents the $eps$-emphsmoothed maximum mutual information with respect to the $L:L^c$ partition in Ω. From this bound we then conclude $I(L:L^c)_Ømega łe bigOłog(|L|)$ – an area law for the mutual information in 1D systems with a logarithmic correction. In addition, we show that Ω can be approximated up to an $eps$ in trace norm with a state of Schmidt rank of at most $poly(|L|/eps)$. Similar corollaries are derived for the mutual information of 2D frustration-free locally-gapped local Hamiltonians.},

keywords = {},

pubstate = {published},

tppubtype = {Talk}

}

Yfke Dulek, Garazi Muguruza, Florian Speelman

An efficient combination of quantum error correction and authentication Poster

2023.

@Poster{P5978,

title = {An efficient combination of quantum error correction and authentication},

author = {Yfke Dulek and Garazi Muguruza and Florian Speelman},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Ekta Panwar, Marcin Wiesniak

An elegant scheme of self-testing for multipartite Bell inequalities Poster

2023.

@Poster{P5709,

title = {An elegant scheme of self-testing for multipartite Bell inequalities},

author = {Ekta Panwar and Marcin Wiesniak},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

William Munizzi, Cynthia Keeler, Jason Pollack

An Entropic Lens on Stabilizer States Poster

2023.

@Poster{P1656,

title = {An Entropic Lens on Stabilizer States},

author = {William Munizzi and Cynthia Keeler and Jason Pollack},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Changpeng Shao

An improved quantum algorithm for low-rank rigid linear regressions with vector solution outputs Poster

2023.

@Poster{P1126,

title = {An improved quantum algorithm for low-rank rigid linear regressions with vector solution outputs},

author = {Changpeng Shao},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Eunou Lee, Ojas Parekh

An improved Quantum Max Cut approximation via Maximum Matching Talk

2024.

@Talk{T24_62,

title = {An improved Quantum Max Cut approximation via Maximum Matching},

author = {Eunou Lee and Ojas Parekh},

year = {2024},

date = {2024-01-01},

abstract = {Finding a high (or low) energy state of a given quantum Hamiltonian is a potential area to gain a provable and practical quantum advantage. A line of recent studies focuses on Quantum Max Cut, where one is asked to find a high energy state of a given antiferromagnetic Heisenberg Hamiltonian. In this work, we present a classical approximation algorithm for Quantum Max Cut that achieves an approximation ratio of 0.595, outperforming the previous best algorithms of Lee (0.562, generic input graph) and King (0.582, triangle-free input graph). The algorithm is based on finding the maximum weighted matching of an input graph and outputs a product of at most 2-qubit states, which is simpler than the fully entangled output states of the previous best algorithms},

keywords = {},

pubstate = {published},

tppubtype = {Talk}

}

Leonardo Vaglini, Paolo Perinotti, Alessandro Tosini

An operational definition of entropy for post-quantum theories Workshop

2023.

Abstract | Links:

@Workshop{T6164,

title = {An operational definition of entropy for post-quantum theories},

author = {Leonardo Vaglini and Paolo Perinotti and Alessandro Tosini},

url = {https://doi.org/10.48550/arXiv.2112.12689 https://doi.org/10.48550/arXiv.2302.01651},

year = {2023},

date = {2023-01-01},

abstract = {The information content of a classical source is defined in terms of the number of bits per symbol that are needed to store the output of the source. An analogous definition is given for a quantum source, where the qubit replaces the bit. Here we show how to extend this definition to operational probabilistic theories. We also discuss some of its properties, such as subadditivity, and to what extent it can be interpreted as a measure of state purity. We also show that none of the proposed generalisations of entropy satisfies a generalised noiseless coding theorem, by means of a toy-theory, consisting of a bilocal version of standard classical theory.},

howpublished = {Talk},

keywords = {},

pubstate = {published},

tppubtype = {Workshop}

}

Jun Takahashi, Chaithanya Rayudu, Cunlu Zhou, Robbie King, Kevin Thompson, Ojas Parekh

An SU(2)-symmetric Semidefinite Programming Hierarchy for Quantum Max Cut Talk

2024.

@Talk{T24_437,

title = {An SU(2)-symmetric Semidefinite Programming Hierarchy for Quantum Max Cut},

author = {Jun Takahashi and Chaithanya Rayudu and Cunlu Zhou and Robbie King and Kevin Thompson and Ojas Parekh},

year = {2024},

date = {2024-01-01},

abstract = {Understanding and approximating extremal energy states of local Hamiltonians is a central problem in quantum physics and complexity theory. Recent work has focused on developing approximation algorithms for local Hamiltonians, and in particular the ``Quantum Max Cut'' (QMaxCut) problem, which is closely related to the antiferromagnetic Heisenberg model. In this work, we introduce a family of semidefinite programming (SDP) relaxations based on the Navascues-Pironio-Acin (NPA) hierarchy which is tailored for QMaxCut by taking into account its SU(2) symmetry. We show that the hierarchy converges to the optimal QMaxCut value at a finite level, which is based on a characterization of the algebra of SWAP operators. We give several analytic proofs and computational results showing exactness/inexactness of our hierarchy at the lowest level on several important families of graphs. We also discuss relationships between SDP approaches for QMaxCut and frustration-freeness in condensed matter physics and numerically demonstrate that the SDP-solvability practically becomes an efficiently-computable generalization of frustration-freeness. Furthermore, by numerical demonstration we show the potential of SDP algorithms to perform as an approximate method to compute physical quantities and capture physical features of some Heisenberg-type statistical mechanics models even away from the frustration-free regions.},

keywords = {},

pubstate = {published},

tppubtype = {Talk}

}

Mark Bun, Nadezhda Voronova

Approximate degree lower bounds for oracle identification problems Conference

2023.

Abstract | Links:

@Conference{T1116,

title = {Approximate degree lower bounds for oracle identification problems},

author = {Mark Bun and Nadezhda Voronova},

url = {https://arxiv.org/abs/2303.03921 https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688780878-poster-1116.pdf https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688780878-video-1116.mp4},

year = {2023},

date = {2023-01-01},

urldate = {2023-01-01},

abstract = {The approximate degree of a Boolean function is the minimum degree of real polynomial that approximates it pointwise. For any Boolean function, its approximate degree serves as a lower bound on its quantum query complexity, and generically lifts to a quantum communication lower bound for a related function.

We introduce a framework for proving approximate degree lower bounds for certain oracle identification problems, where the goal is to recover a hidden binary string $latex x ın 0, 1^n$ given possibly non-standard oracle access to it. Our lower bounds apply to decision versions of these problems, where the goal is to compute the parity of $latex x$.

We apply our framework to the ordered search and hidden string problems, proving nearly tight approximate degree lower bounds of $latex Ømega(n/łog^2 n)$ for each. These lower bounds generalize to the weakly unbounded error setting, giving a new quantum query lower bound for the hidden string problem in this regime. Our lower bounds are driven by randomized communication upper bounds for the greater-than and equality functions.},

howpublished = {Talk and Proceedings},

keywords = {},

pubstate = {published},

tppubtype = {Conference}

}

We introduce a framework for proving approximate degree lower bounds for certain oracle identification problems, where the goal is to recover a hidden binary string $latex x ın 0, 1^n$ given possibly non-standard oracle access to it. Our lower bounds apply to decision versions of these problems, where the goal is to compute the parity of $latex x$.

We apply our framework to the ordered search and hidden string problems, proving nearly tight approximate degree lower bounds of $latex Ømega(n/łog^2 n)$ for each. These lower bounds generalize to the weakly unbounded error setting, giving a new quantum query lower bound for the hidden string problem in this regime. Our lower bounds are driven by randomized communication upper bounds for the greater-than and equality functions.

Theodoros Kapourniotis, Elham Kashefi, Dominik Leichtle, Luka Music, Harold Ollivier

Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority Poster

2023.

@Poster{P5140,

title = {Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority},

author = {Theodoros Kapourniotis and Elham Kashefi and Dominik Leichtle and Luka Music and Harold Ollivier},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

André Sequeira, Luis Paulo Santos, Luis Soares Barbosa

Barren plateaus in quantum policy gradients Poster

2023.

@Poster{P9114,

title = {Barren plateaus in quantum policy gradients},

author = {André Sequeira and Luis Paulo Santos and Luis Soares Barbosa},

year = {2023},

date = {2023-01-01},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Joran Apeldoorn, Sander Gribling, Harold Nieuwboer

Basic quantum subroutines: finding multiple marked elements and summing numbers Poster

2023.

@Poster{P6522,

title = {Basic quantum subroutines: finding multiple marked elements and summing numbers},

author = {Joran Apeldoorn and Sander Gribling and Harold Nieuwboer},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Moisés Bermejo Morán, Alejandro Pozas-Kerstjens, Felix Huber

Bell inequalities with overlapping measurements Poster

2023.

@Poster{P7070,

title = {Bell inequalities with overlapping measurements},

author = {Moisés Bermejo Morán and Alejandro Pozas-Kerstjens and Felix Huber},

year = {2023},

date = {2023-01-01},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Christoph Hirche

Benefits and Detriments of Noise in Quantum Classification Poster

2023.

@Poster{P621,

title = {Benefits and Detriments of Noise in Quantum Classification},

author = {Christoph Hirche},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Murphy Yuezhen Niu, Yulong Dong, Jonathan Gross

Beyond Heisenberg Limit Quantum Metrology through Quantum Signal Processing Poster

2023.

@Poster{P1920,

title = {Beyond Heisenberg Limit Quantum Metrology through Quantum Signal Processing},

author = {Murphy Yuezhen Niu and Yulong Dong and Jonathan Gross},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Gabriel Alves, Nicolas Gigena, Jędrzej Kaniewski

Biased Random Access Codes Poster

2023.

@Poster{P2298,

title = {Biased Random Access Codes},

author = {Gabriel Alves and Nicolas Gigena and Jędrzej Kaniewski},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Maximilian Schumacher, Gernot Alber

Bipartite entanglement and its detection by local generalized measurements Poster

2023.

@Poster{P8996,

title = {Bipartite entanglement and its detection by local generalized measurements},

author = {Maximilian Schumacher and Gernot Alber},

url = {https://tqc-conference.org/wp-content/uploads/cfdb7_uploads/1688126723-poster-8996.pdf},

year = {2023},

date = {2023-01-01},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Christoph Sünderhauf, Earl Campbell, Joan Camps

Block-encoding structured matrices for data input in quantum computing Poster

2023.

@Poster{P1190,

title = {Block-encoding structured matrices for data input in quantum computing},

author = {Christoph Sünderhauf and Earl Campbell and Joan Camps},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Akshay Bansal, Jamie Sikora

Breaking barriers in two-party quantum cryptography via stochastic semidefinite programming Poster

2023.

@Poster{P3657,

title = {Breaking barriers in two-party quantum cryptography via stochastic semidefinite programming},

author = {Akshay Bansal and Jamie Sikora},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}

Paolo Perinotti, Alessandro Tosini, Leonardo Vaglini

Causal influence and signalling in networks of processes Poster

2023.

@Poster{P4027,

title = {Causal influence and signalling in networks of processes},

author = {Paolo Perinotti and Alessandro Tosini and Leonardo Vaglini},

year = {2023},

date = {2023-01-01},

howpublished = {Poster},

keywords = {},

pubstate = {published},

tppubtype = {Poster}

}