Finite-element methods are industry standards for finding numerical solutions to partial differential equations. However, the application scale remains pivotal to the practical use of these methods, even for modern-day supercomputers. Large, multi-scale applications, for example, can be limited by their requirement of prohibitively large linear system solutions. It is therefore worthwhile to investigate whether near-term quantum algorithms have the potential for offering any kind of advantage over classical linear solvers. In this study, we investigate the recently proposed variational quantum linear solver (VQLS) for discrete solutions to partial differential equations. This method was found to scale polylogarithmically with the linear system size, and the method can be implemented using shallow quantum circuits on noisy intermediate-scale quantum (NISQ) computers. Herein, we utilize the hybrid VQLS to solve both the steady Poisson equation and the time-dependent heat and wave equations.
Quantum key distribution (QKD) is a popular introduction to quantum technologies used in education and public outreach, as very little background in quantum theory is needed and the practical applications are easily understood. There is considerably less exposure to the many real-world considerations of practical QKD, as access to the necessary hardware is quite limited. Here we describe a simple, simulation-based QKD project that can be implemented with only a minimal background in quantum concepts and programming. Students are assembled in small groups to develop an ``Alice and Bob'' protocol for securely distributing symmetric keys in a simulated noisy channel. Their protocol is then shared anonymously with another group who plays the role of Eve and attempts to steal as much secret key as possible. The adversarial aspect is popular with students, and the project itself provides a deeper understanding and appreciation for practical QKD.
We introduce a decoder for the 3D color code with boundaries, which is a variation of the restriction decoder introduced by Kubicka and Delfosse. Specifically, we adapt the lift procedure to efficiently find a correction on qubits adjacent to a boundary. We numerically estimate a threshold of $4\% - 8\%$ for Pauli $X$ errors and a threshold of $0.7\% - 0.8\%$ for Pauli $Z$ errors. Our work is a first step towards characterizing the performance of Bomb\'{i}n's recently proposed "colorful quantum computing."