scholarly journals On the Entanglement Cost of One-Shot Compression

Quantum ◽  
2020 ◽  
Vol 4 ◽  
pp. 286
Author(s):  
Shima Bab Hadiashar ◽  
Ashwin Nayak
Keyword(s):  
Boolean Functions ◽  
Communication Complexity ◽  
Constant Error ◽  
Communication Cost ◽  
Constant Number ◽  
Information Cost ◽  
State Splitting ◽  
The One ◽  
The Cost ◽  
The Given

We revisit the task of visible compression of an ensemble of quantum states with entanglement assistance in the one-shot setting. The protocols achieving the best compression use many more qubits of shared entanglement than the number of qubits in the states in the ensemble. Other compression protocols, with potentially larger communication cost, have entanglement cost bounded by the number of qubits in the given states. This motivates the question as to whether entanglement is truly necessary for compression, and if so, how much of it is needed. Motivated by questions in communication complexity, we lift certain restrictions that are placed on compression protocols in tasks such as state-splitting and channel simulation. We show that an ensemble of the form designed by Jain, Radhakrishnan, and Sen (ICALP'03) saturates the known bounds on the sum of communication and entanglement costs, even with the relaxed compression protocols we study. The ensemble and the associated one-way communication protocol have several remarkable properties. The ensemble is incompressible by more than a constant number of qubits without shared entanglement, even when constant error is allowed. Moreover, in the presence of shared entanglement, the communication cost of compression can be arbitrarily smaller than the entanglement cost. The quantum information cost of the protocol can thus be arbitrarily smaller than the cost of compression without shared entanglement. The ensemble can also be used to show the impossibility of reducing, via compression, the shared entanglement used in two-party protocols for computing Boolean functions.

scholarly journals ANALYSIS OF THE HOUSING MARKET IN LITHUANIA

2008 ◽  
Vol 12 (4) ◽  
pp. 271-280 ◽  
Author(s):  
Feliksas Ivanauskas ◽  
Rimantas Eidukevičius ◽  
Albinas Marčinskas ◽  
Birutė Galinienė
Keyword(s):  
Financial Markets ◽  
Interest Rates ◽  
Housing Market ◽  
Supply And Demand ◽  
Economic Factors ◽  
Causality Tests ◽  
The One ◽  
The Cost ◽  
The Given ◽  
The Relationship

Cointegration and Granger causality tests were used for the statistical analyses of the housing market in Lithuania. The relationship between the cost of housing and afford‐ability on the one hand, and interest rates, GDP and average incomes on the other was not proven to exist using the given statistical methods. The period of increase in the cost of housing in Lithuania over the last five years is exceptional and difficult to explain using fundamental economic factors and their fluctuation trends alone. The cost of housing has made a clear departure from the economic (business) cycle; the economy has grown, however at a much slower rate than rising costs in the housing market. The reasons for this situation are record lows in interest rates, good conditions to gain financing, the liberalisation of financial markets, speculative attitudes in expectation of the introduction of the Euro, and a divide between the supply and demand of housing that is available. It should be noted that the evaluation of the influence of these factors on fluctuations in costs in the housing market is more hypothetical in nature. Santrauka Nekilnojamojo turto rinkos Lietuvoje statistinei analizei buvo naudojami kointegravimo ir Grangerio priežastingumo testai. Taikant esamus statistinius metodus nebuvo įrodyta, kad egzistavo ryšys tarp nekilnojamojo turto kainos ir įperkamumo, viena vertus, ir palūkanų normų, BVP bei vidutinių pajamų, kita vertus. Nekilnojamojo turto kainos Lietuvoje didėjimo per pastaruosius penketą metų laikotarpis yra išskirtinis ir sunkiai paaiškinamas remiantis vien pagrindiniais ekonominiais veiksniais ir jų svyravimų tendencijomis. Nekilnojamojo turto kaina aiškiai nukrypo nuo ekonomikos (verslo) ciklo; ekonomika išaugo, tačiau gerokai lėtesniu tempu nei augančios kainos nekilnojamojo turto rinkoje. Šios situacijos priežastys – rekordiškai mažos palūkanų normos, geros sąlygos gauti fi nansavimą, fi nansų rinkos liberalizavimas, spekuliaciniai požiūriai tikintis įsivesti eurą ir takoskyra tarp esamo nekilnojamojo turto pasiūlos ir paklausos. Pažymėtina, kad šių veiksnių įtakos kainų svyravimo nekilnojamojo turto rinkoje įvertinimas yra labiau hipotetinis.

CLASS OF BOOLEAN FUNCTIONS CONSTRUCTED USING SIGNIFICANT BITS OF LINEAR RECURRENCES OVER THE RING ℤ2n

2019 ◽  
Vol 6 (2) ◽  
pp. 90-94
Author(s):  
Hernandez Piloto Daniel Humberto
Keyword(s):  
Linear Function ◽  
Boolean Functions ◽  
Hamming Distance ◽  
Linear Recurrences ◽  
Maximum Period ◽  
Non Linear ◽  
The Given ◽  
Class Of Functions

In this work a class of functions is studied, which are built with the help of significant bits sequences on the ring ℤ2n. This class is built with use of a function ψ: ℤ2n → ℤ2. In public literature there are works in which ψ is a linear function. Here we will use a non-linear ψ function for this set. It is known that the period of a polynomial F in the ring ℤ2n is equal to T(mod 2)2α, where α∈ , n01- . The polynomials for which it is true that T(F) = T(F mod 2), in other words α = 0, are called marked polynomials. For our class we are going to use a polynomial with a maximum period as the characteristic polyomial. In the present work we show the bounds of the given class: non-linearity, the weight of the functions, the Hamming distance between functions. The Hamming distance between these functions and functions of other known classes is also given.

THE EU SUGAR MARKET PROFILE AND ITS MAIN DRIVERS

2015 ◽  
Author(s):  
Lubos SMUTKA ◽  
Irena BENEŠOVÁ ◽  
Patrik ROVNÝ ◽  
Renata MATYSIK-PEJAS
Keyword(s):  
Market Failure ◽  
Current System ◽  
Quota System ◽  
Considerable Debate ◽  
Sugar Market ◽  
The Common ◽  
The One ◽  
Production Capacities ◽  
The Given ◽  
The Eu

Sugar is one of the most important elements in human nutrition. The Common Market Organisation for sugar has been a subject of considerable debate since its establishment in 1968. The European agricultural market has been criticized for its heavy regulations and subsidization. The sugar market is one of the most regulated ones; however, this will change radically in 2017 when the current system of production quotas will end. The current EU sugar market changed is structure during the last several decades. The significant number of companies left the market and EU internal sugar market became more concentrated. The aim of this paper is presentation characteristics of sugar market with respect to the supposed market failure – reduction in competition. The analysis also identifies the main drivers and determinants of the EU especially quota sugar market. In relation to paper’s aim the following results are important. The present conditions of the European sugar market have led to market failure when nearly 75 % (10 million tonnes) of the quota is controlled by five multinational companies only. These multinational alliances (especially German and French one) are also taking control over the production capacities of their subsidiaries. In most countries, this causes serious problems as the given quota is controlled by one or two producers only. This is a significant indicator of market imperfection. The quota system cannot overcome the problem of production quotas on the one hand and the demand on the other; furthermore, it also leads to economic inefficiency. The current EU sugar market is under the control of only Sudzucker, Nordzucker, Pfeifer and Langen, Tereos and ABF.

Quasi-Periodic Control Technique for Minimizing Fuel Consumption During Record Vehicle Competition

2013 ◽  
Vol 60 (2) ◽  
pp. 185-197 ◽  
Author(s):  
Paweł Sulikowski ◽  
Ryszard Maronski
Keyword(s):  
Fuel Consumption ◽  
Optimal Control Theory ◽  
Slope Angle ◽  
Control Technique ◽  
Decision Variables ◽  
Aeronautical Engineering ◽  
The One ◽  
Optimal Driving ◽  
The Given ◽  
Engine Power

The problem of the optimal driving technique during the fuel economy competition is reconsidered. The vehicle is regarded as a particle moving on a trace with a variable slope angle. The fuel consumption is minimized as the vehicle covers the given distance in a given time. It is assumed that the run consists of two recurrent phases: acceleration with a full available engine power and coasting down with the engine turned off. The most fuel-efficient technique for shifting gears during acceleration is found. The decision variables are: the vehicle velocities at which the gears should be shifted, on the one hand, and the vehicle velocities when the engine should be turned on and off, on the other hand. For the data of students’ vehicle representing the Faculty of Power and Aeronautical Engineering it has been found that such driving strategy is more effective in comparison with a constant speed strategy with the engine partly throttled, as well as a strategy resulting from optimal control theory when the engine is still active.

scholarly journals A Study on the Feasibility of Anaerobic Co-Digestion of Raw Cheese Whey with Coffee Pulp Residues

Energies ◽  
2021 ◽  
Vol 14 (12) ◽  
pp. 3611
Author(s):  
Sandra Gonzalez-Piedra ◽  
Héctor Hernández-García ◽  
Juan M. Perez-Morales ◽  
Laura Acosta-Domínguez ◽  
Juan-Rodrigo Bastidas-Oyanedel ◽  
...  
Keyword(s):  
Methane Production ◽  
Kinetic Models ◽  
Cheese Whey ◽  
Maximum Yield ◽  
Gompertz Model ◽  
Coffee Pulp ◽  
The One ◽  
The Cost ◽  
Best Fit ◽  
Cheese Production

In this paper, a study on the feasibility of the treatment of raw cheese whey by anaerobic co-digestion using coffee pulp residues as a co-substrate is presented. It considers raw whey generated in artisanal cheese markers, which is generally not treated, thus causing environmental pollution problems. An experimental design was carried out evaluating the effect of pH and the substrate ratio on methane production at 35 °C (i.e., mesophilic conditions). The interaction of the parameters on the co-substrate degradation and the methane production was analyzed using a response surface analysis. Furthermore, two kinetic models were proposed (first order and modified Gompertz models) to determine the dynamic profiles of methane yield. The results show that co-digestion of the raw whey is favored at pH = 6, reaching a maximum yield of 71.54 mLCH4 gVSrem−1 (31.5% VS removed) for raw cheese whey and coffee pulp ratio of 1 gVSwhey gVSCoffe−1. The proposed kinetic models successfully fit the experimental methane production data, the Gompertz model being the one that showed the best fit. Then, the results show that anaerobic co-digestion can be used to reduce the environmental impact of raw whey. Likewise, the methane obtained can be integrated into the cheese production process, which could contribute to reducing the cost per energy consumption.

scholarly journals Electoral Incentives and the Allocation of Public Funds

2020 ◽  
Author(s):  
Frederico Finan ◽  
Maurizio Mazzocco
Keyword(s):  
Electoral System ◽  
Policy Reforms ◽  
Public Funds ◽  
Term Limit ◽  
The Public ◽  
Public Projects ◽  
Electoral Incentives ◽  
Using Data ◽  
The One ◽  
The Cost

Abstract Politicians allocate public resources in ways that maximize political gains, and potentially at the cost of lower welfare. In this paper, we quantify these welfare costs in the context of Brazil’s federal legislature, which grants its members a budget to fund public projects within their states. Using data from the state of Roraima, we estimate a model of politicians’ allocation decisions and find that 26.8% of the public funds allocated by legislators are distorted relative to a social planner’s allocation. We then use the model to simulate three potential policy reforms to the electoral system: the adoption of approval voting, imposing a one-term limit, and redistricting. We find that a one-term limit and redistricting are both effective at reducing distortions. The one-term limit policy, however, increases corruption, which makes it a welfare-reducing policy.

scholarly journals A MEAN FIELD GAME ANALYSIS OF SIR DYNAMICS WITH VACCINATION

2020 ◽  
pp. 1-18
Author(s):  
Josu Doncel ◽  
Nicolas Gast ◽  
Bruno Gaujal
Keyword(s):  
Mean Field ◽  
Vaccination Strategy ◽  
Game Analysis ◽  
Total Cost ◽  
Mean Field Game ◽  
Vaccination Behavior ◽  
Switching Curve ◽  
The One ◽  
The Cost ◽  
Vaccination Period

We analyze a mean field game model of SIR dynamics (Susceptible, Infected, and Recovered) where players choose when to vaccinate. We show that this game admits a unique mean field equilibrium (MFE) that consists in vaccinating at a maximal rate until a given time and then not vaccinating. The vaccination strategy that minimizes the total cost has the same structure as the MFE. We prove that the vaccination period of the MFE is always smaller than the one minimizing the total cost. This implies that, to encourage optimal vaccination behavior, vaccination should always be subsidized. Finally, we provide numerical experiments to study the convergence of the equilibrium when the system is composed by a finite number of agents ( $N$ ) to the MFE. These experiments show that the convergence rate of the cost is $1/N$ and the convergence of the switching curve is monotone.

IMPROVED TIME-MULTIPLEXED FPGA ARCHITECTURE AND ALGORITHM FOR MINIMIZING COMMUNICATION COST DESIGNS

2013 ◽  
Vol 22 (05) ◽  
pp. 1350033
Author(s):  
CHI-CHOU KAO ◽  
YEN-TAI LAI
Keyword(s):  
Greedy Algorithm ◽  
Sequential Circuits ◽  
Precedence Constraints ◽  
Communication Cost ◽  
Experimental Results ◽  
Time Sharing ◽  
Fpga Architecture ◽  
The Given

The Time-Multiplexed FPGA (TMFPGA) architecture can improve dramatically logic utilization by time-sharing logic but it needs a large amount of registers among sub-circuits for partitioning the given sequential circuits. In this paper, we propose an improved TMFPGA architecture to simplify the precedence constraints so that the number of the registers among sub-circuits can be reduced for sequential circuits partitioning. To demonstrate the practicability of the architecture, we also present a greedy algorithm to minimize the maximum number of the registers. Experimental results demonstrate the effectives of the algorithm.

Clique Here: On the Distributed Complexity in Fully-Connected Networks

2016 ◽  
Vol 26 (01) ◽  
pp. 1650004 ◽  
Author(s):  
Benny Applebaum ◽  
Dariusz R. Kowalski ◽  
Boaz Patt-Shamir ◽  
Adi Rosén
Keyword(s):  
Boolean Function ◽  
Boolean Functions ◽  
Message Passing ◽  
Constant Number ◽  
Running Time ◽  
Message Size ◽  
Explicit Function ◽  
Randomized Protocols ◽  
Fully Connected ◽  
Fully Connected Networks

We consider a message passing model with n nodes, each connected to all other nodes by a link that can deliver a message of B bits in a time unit (typically, B = O(log n)). We assume that each node has an input of size L bits (typically, L = O(n log n)) and the nodes cooperate in order to compute some function (i.e., perform a distributed task). We are interested in the number of rounds required to compute the function. We give two results regarding this model. First, we show that most boolean functions require ‸ L/B ‹ − 1 rounds to compute deterministically, and that even if we consider randomized protocols that are allowed to err, the expected running time remains [Formula: see text] for most boolean function. Second, trying to find explicit functions that require superconstant time, we consider the pointer chasing problem. In this problem, each node i is given an array Ai of length n whose entries are in [n], and the task is to find, for any [Formula: see text], the value of [Formula: see text]. We give a deterministic O(log n/ log log n) round protocol for this function using message size B = O(log n), a slight but non-trivial improvement over the O(log n) bound provided by standard “pointer doubling.” The question of an explicit function (or functionality) that requires super constant number of rounds in this setting remains, however, open.

scholarly journals ON THE COMPLEXITY OF THE EVALUATION OF TRANSIENT EXTENSIONS OF BOOLEAN FUNCTIONS

2012 ◽  
Vol 23 (01) ◽  
pp. 21-35
Author(s):  
JANUSZ BRZOZOWSKI ◽  
BAIYU LI ◽  
YULI YE
Keyword(s):  
Boolean Functions ◽  
Hazard Detection ◽  
Np Complete ◽  
The Given ◽  
Class Of Functions

Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions to transients. Formulas for computing the output transient of a gate from the input transients are known for NOT, AND, OR and XOR gates and their complements, but, in general, even the problem of deciding whether the length of the output transient exceeds a given bound is NP-complete. We propose a method of evaluating extensions of general boolean functions. We study a class of functions for which, instead of evaluating the extensions on a given set of transients, it is possible to get the same values by using transients derived from the given ones, but having length at most 3. We prove that all functions of three variables, as well as certain other functions, have this property, and can be efficiently evaluated.

Sign in / Sign up

Export Citation Format

Share Document