Lead pollution and its sources along the Turkish coast of the Black Sea

Lead pollution and its sources have been investigated in the south-eastern and south-western Black Sea. Surficial sediments and mussels were collected in different seasons of the year from the south-eastern and south-western Black Sea and analysed for their lead contents.In the south-eastern Black Sea sediments from the easternmost and from the central stations contained the highest lead concentrations. Sediments contained 8 to 10 times the lead concentrations of sediments from the south-west. Samples taken from rivers, streams and effluents had especially high lead concentrations. The highest lead concentrations were found in sediments collected in October and December.Lead concentrations in mussels from the south-eastern coast were comparatively lower compared to those from the south-western coast. The highest average values occurred in December and in October.In the south-western Black Sea, the highest lead concentrations in sediments were obtained in those from Inebolu, followed by those from around Zonguldak. The concentrations increased from the middle to the west of the southern Black Sea coast, possibly due to the effect of the Danube River. Sediments taken in September had the highest lead concentrations, followed by samples taken in December.Very high lead concentrations (> 10 μ g g-1) were observed in mussels from those stations where the sediments also contained high concentrations. Mussels had their highest lead concentrations in January and April

Twisted Supersymmetric Gauge Theories and Orbifold Lattices

We examine the relation between twisted versions of the extended supersymmetric gauge theories and supersymmetric orbifold lattices. In particular, for the $\mathcal{N}=4$ SYM in $d=4$, we show that the continuum limit of orbifold lattice reproduces the twist introduced by Marcus, and the examples at lower dimensions are usually Blau-Thompson type. The orbifold lattice point group symmetry is a subgroup of the twisted Lorentz group, and the exact supersymmetry of the lattice is indeed the nilpotent scalar supersymmetry of the twisted versions. We also introduce twisting in terms of spin groups of finite point subgroups of $R$-symmetry and spacetime symmetry.Comment: 32 page

On the Complexity of Generalized Discrete Logarithm Problem

Generalized Discrete Logarithm Problem (GDLP) is an extension of the Discrete Logarithm Problem where the goal is to find $x\in\mathbb{Z}_s$ such $g^x\mod s=y$ for a given $g,y\in\mathbb{Z}_s$. Generalized discrete logarithm is similar but instead of a single base element, uses a number of base elements which does not necessarily commute with each other. In this paper, we prove that GDLP is NP-hard for symmetric groups. Furthermore, we prove that GDLP remains NP-hard even when the base elements are permutations of at most 3 elements. Lastly, we discuss the implications and possible implications of our proofs in classical and quantum complexity theory

Quantum Adversarial Learning in Emulation of Monte-Carlo Methods for Max-cut Approximation: QAOA is not optimal

One of the leading candidates for near-term quantum advantage is the class of Variational Quantum Algorithms, but these algorithms suffer from classical difficulty in optimizing the variational parameters as the number of parameters increases. Therefore, it is important to understand the expressibility and power of various ans\"atze to produce target states and distributions. To this end, we apply notions of emulation to Variational Quantum Annealing and the Quantum Approximate Optimization Algorithm (QAOA) to show that QAOA is outperformed by variational annealing schedules with equivalent numbers of parameters. Our Variational Quantum Annealing schedule is based on a novel polynomial parameterization that can be optimized in a similar gradient-free way as QAOA, using the same physical ingredients. In order to compare the performance of ans\"atze types, we have developed statistical notions of Monte-Carlo methods. Monte-Carlo methods are computer programs that generate random variables that approximate a target number that is computationally hard to calculate exactly. While the most well-known Monte-Carlo method is Monte-Carlo integration (e.g. Diffusion Monte-Carlo or path-integral quantum Monte-Carlo), QAOA is itself a Monte-Carlo method that finds good solutions to NP-complete problems such as Max-cut. We apply these statistical Monte-Carlo notions to further elucidate the theoretical framework around these quantum algorithms

Circuit Transformations for Quantum Architectures

Quantum computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, allowing for any initial and final mapping of circuit qubits to architecture qubits. To achieve this, we first consider the qubit movement subproblem and use the ROUTING VIA MATCHINGS framework to prove tighter bounds on parallel routing. In practice, we only need to perform partial permutations, so we generalize ROUTING VIA MATCHINGS to that setting. We give new routing procedures for common architecture graphs and for the generalized hierarchical product of graphs, which produces subgraphs of the Cartesian product. Secondly, for serial routing, we consider the TOKEN SWAPPING framework and extend a 4-approximation algorithm for general graphs to support partial permutations. We apply these routing procedures to give several circuit transformations, using various heuristic qubit placement subroutines. We implement these transformations in software and compare their performance for large quantum circuits on grid and modular architectures, identifying strategies that work well in practice

Deformed matrix models, supersymmetric lattice twists and N=1/4 supersymmetry

A manifestly supersymmetric nonperturbative matrix regularization for a twisted version of N=(8,8) theory on a curved background (a two-sphere) is constructed. Both continuum and the matrix regularization respect four exact scalar supersymmetries under a twisted version of the supersymmetry algebra. We then discuss a succinct Q=1 deformed matrix model regularization of N=4 SYM in d=4, which is equivalent to a non-commutative $A_4^*$ orbifold lattice formulation. Motivated by recent progress in supersymmetric lattices, we also propose a N=1/4 supersymmetry preserving deformation of N=4 SYM theory on $\R^4$. In this class of N=1/4 theories, both the regularized and continuum theory respect the same set of (scalar) supersymmetry. By using the equivalence of the deformed matrix models with the lattice formulations, we give a very simple physical argument on why the exact lattice supersymmetry must be a subset of scalar subalgebra. This argument disagrees with the recent claims of the link approach, for which we give a new interpretation.Comment: 47 pages, 3 figure