Non-Supersymmetric, Multi-Center Solutions with Topological Flux

We find an infinite class of non-supersymmetric multi-center solutions to the STU model in five-dimensional ungauged supergravity coupled to two vector multiplets. The solutions are obtained by solving a system of linear equations on a class of Ricci-scalar-flat K\"ahler manifolds studied by LeBrun. After imposing an additional U(1) isometry in the base, we solve the axisymmetric $SU(\infty)$ Toda equation and obtain explicit supergravity solutions containing arbitrary numbers of 2-cycles with cohomological fluxes of all three flavors. This improves upon a previous result where only two of the three fluxes were topologically non-trivial. Imposing regularity and absence of closed timelike curves, we obtain "bubble equations" highly reminiscent of those known in the supersymmetric case. Thus we extend much of the analysis done for BPS bubbling solutions to this new family of non-supersymmetric bubbling solutions.Comment: 51 pages, 8 figures, substantial changes made to improve analysis of orbifold groups in sections 4,

Doubly-Fluctuating BPS Solutions in Six Dimensions

We analyze the BPS solutions of minimal supergravity coupled to an anti-self-dual tensor multiplet in six dimensions and find solutions that fluctuate non-trivially as a function of two variables. We consider families of solutions coming from KKM monopoles fibered over Gibbons-Hawking metrics or, equivalently, non-trivial T^2 fibrations over an R3 base. We find smooth microstate geometries that depend upon many functions of one variable, but each such function depends upon a different direction inside the T^2 so that the complete solution depends non-trivially upon the whole T^2 . We comment on the implications of our results for the construction of a general superstratum.Comment: 24 page

Uplifting GPPZ: A Ten-dimensional Dual of N=1∗\mathcal{N}=1^{*}

We find a new supersymmetric solution of type IIB supergravity which is the uplift of the GPPZ solution of maximal SO$(6)$ gauged supergravity in five dimensions. This background is expected to be holographically dual to an $\mathcal{N}=1^{*}$ supersymmetric mass deformation of four-dimensional $\mathcal{N}=4$ SYM. The ten-dimensional solution is singular in the region corresponding to the IR regime of the dual gauge theory and we discuss the physics of the singularity in some detail.Comment: 23 pages, no figures. v4: Minor corrections, published versio

Low-depth Circuit Implementation of Parity Constraints for Quantum Optimization

We present a construction for circuits with low gate count and depth, implementing three- and four-body Pauli-Z product operators as they appear in the form of plaquette-shaped constraints in QAOA when using the parity mapping. The circuits can be implemented on any quantum device with nearest-neighbor connectivity on a square-lattice, using only one gate type and one orientation of two-qubit gates at a time. We find an upper bound for the circuit depth which is independent of the system size. The procedure is readily adjustable to hardware-specific restrictions, such as a minimum required spatial distance between simultaneously executed gates, or gates only being simultaneously executable within a subset of all the qubits, for example a single line.Comment: 9 pages, 6 figure

Constructive plaquette compilation for the parity architecture

Parity compilation is the challenge of laying out the required constraints for the parity mapping in a local way. We present the first constructive compilation algorithm for the parity architecture using plaquettes for arbitrary higher-order optimization problems. This enables adiabatic protocols, where the plaquette layout can natively be implemented, as well as fully parallelized digital circuits. The algorithm builds a rectangular layout of plaquettes, where in each layer of the rectangle at least one constraint is added. The core idea is that each constraint, consisting of any qubits on the boundary of the rectangle and some new qubits, can be decomposed into plaquettes with a deterministic procedure using ancillas. We show how to pick a valid set of constraints and how this decomposition works. We further give ways to optimize the ancilla count and show how to implement optimization problems with additional constraints.Comment: 8 pages, 5 figure