Evaluating the Extent and Nature of ‘Envelope Wages’ in the European Union: A Geographical Analysis

To evaluate the spatialities of the illegal wage practice where employers pay their declared employees both an official declared wage and an undeclared ‘envelope’ wage so as to avoid tax liabilities, a 2007 survey conducted in 27 European Union (EU) member states is reported. The finding is that 5% of employees received envelope wages which amount on average to some two-fifths of their wage packet. Revealing how, although heavily concentrated in a small group of East-Central European nations, this wage practice is nonetheless ubiquitous, the paper concludes by discussing how this practice might be tackled

Explaining Cross-National Variations in the Prevalence and Character of Undeclared Employment in the European Union

The aim of this article is to evaluate the competing theories that variously explain the greater prevalence of undeclared employment in some countries either as: a legacy of under-development; a result of the voluntary exit from declared employment due to the high taxes, state corruption and burdensome regulations and controls, or a product of a lack of state intervention in work and welfare which leads to the exclusion of workers from the declared economy and state welfare provision. Analyzing the cross-national variations in the prevalence of, and reasons for, undeclared employment across the European Union using evidence from a 2007 Eurobarometer survey, the finding is that undeclared employment is less prevalent and more of the voluntary variety in wealthier, less corrupt and more equal societies possessing higher levels of social protection and redistribution via social transfers. The theoretical and policy implications are then discussed

Generalized Quantum Search with Parallelism

We generalize Grover's unstructured quantum search algorithm to enable it to use an arbitrary starting superposition and an arbitrary unitary matrix simultaneously. We derive an exact formula for the probability of the generalized Grover's algorithm succeeding after n iterations. We show that the fully generalized formula reduces to the special cases considered by previous authors. We then use the generalized formula to determine the optimal strategy for using the unstructured quantum search algorithm. On average the optimal strategy is about 12% better than the naive use of Grover's algorithm. The speedup obtained is not dramatic but it illustrates that a hybrid use of quantum computing and classical computing techniques can yield a performance that is better than either alone. We extend the analysis to the case of a society of k quantum searches acting in parallel. We derive an analytic formula that connects the degree of parallelism with the optimal strategy for k-parallel quantum search. We then derive the formula for the expected speed of k-parallel quantum search.Comment: 14 pages, 2 figure

<i>Kontakte</i> with piano and percussion

I designed and carried out performance of the Sound Projection for a public performance of Karlheinz Stockhausen's "Kontakte" with piano and percussion, featuring Nicolas Hodges on piano and Colin Currie on percussion at the Old Fruitmarket, Glasgow City Halls

Optimal Quantum Circuits for General Two-Qubit Gates

In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence of one-qubit and two-qubit gates. We contribute to this effort by providing a method to construct an optimal quantum circuit for a general two-qubit gate that requires at most 3 CNOT gates and 15 elementary one-qubit gates. Moreover, if the desired two-qubit gate corresponds to a purely real unitary transformation, we provide a construction that requires at most 2 CNOTs and 12 one-qubit gates. We then prove that these constructions are optimal with respect to the family of CNOT, y-rotation, z-rotation, and phase gates.Comment: 6 pages, 8 figures, new title, final journal versio

Mapping the Shadow Economy: Spatial Variations in the use of High Denomination Bank Notes in Brussels

The aim of this paper is to map the spatial variations in the size of the shadow economy within Brussels. Reporting data provided by the National Bank of Belgium on the deposit of high denomination banknotes across bank branches in the 19 municipalities of the Brussels-Capital Region, the finding is that the shadow economy is concentrated in wealthier populations and not in deprived or immigrant communities. The outcome is a call to transcend the association of the shadow economy with marginalized groups and the wider adoption of this indirect method when measuring spatial variations in the shadow economy

Ethnic perceptions of Acadia

Le nom Acadie donné à une certaine portion du territoire atlantique du nord-est de l'Amérique du Nord désigne une grande variété de référents territoriaux. À partir d'une enquête réalisée auprès d'un échantillon d'étudiants, de niveau secondaire du Nouveau-Brunswick, nous constatons que la nature exacte et l'étendue de l'aire symbolisée par ce nom varient en fonction de la provenance des répondants et de leur appartenance ethnique. Cependant, l'unanimité se fait autour de la localisation d'un foyer commun de la culture acadienne : la région de Moncton et son arrière-pays immédiat.The name Acadia, given to a portion of the Atlantic region of North America, connotes a wide variety of territorial referents. From the results of a survey of a sample of New Brunswick high school students, it was determined that the exact nature and extent of the area known under the name of Acadia varied, depending on the sample location and ethnic affiliation of the respondants. But a core area common to all samples is centered on Moncton and its immediate hinterland

Scheme for Entering Binary Data Into a Quantum Computer

A quantum algorithm provides for the encoding of an exponentially large number of classical data bits by use of a smaller (polynomially large) number of quantum bits (qubits). The development of this algorithm was prompted by the need, heretofore not satisfied, for a means of entering real-world binary data into a quantum computer. The data format provided by this algorithm is suitable for subsequent ultrafast quantum processing of the entered data. Potential applications lie in disciplines (e.g., genomics) in which one needs to search for matches between parts of very long sequences of data. For example, the algorithm could be used to encode the N-bit-long human genome in only log2N qubits. The resulting log2N-qubit state could then be used for subsequent quantum data processing - for example, to perform rapid comparisons of sequences