Caterina Viola

Dr. Caterina Viola

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 August 2022 in Journal of Mathematical Analysis and Applications
Verified
Journal Article
Closed access
FSFriedrich Martin Schneider
Friedrich Martin Schneider
CVCaterina Viola
Caterina Viola

27 August 2024 in SN Computer Science
Verified
Journal Article
Open access
PDF file
APArianna Pavone
Arianna Pavone
CVCaterina Viola
Caterina Viola
A circular shift operator (or cyclic rotation gate) $${{\,\mathrm{\texttt {ROT}}\,}}_k$$ ROT k applies a rightward (or leftward) shift to an input register of n qubits o by as many positions as encoded by an additional input $$k \in \mathbb N$$ k ∈ N . Specifically, the qubit at position x is moved to position $$(x+k) \mod n$$ ( x + k ) mod n . While it is known that there exists a quantum rotation operator that can be implemented in $${{\,\mathrm{\mathcal {O}}\,}}(\log (n))$$ O ( log ( n ) ) -time, through the repeated parallel application of the elementary $${{\,\mathrm{\texttt {Swap}}\,}}$$ Swap operators, there is no systematic procedure that concretely constructs the quantum operator $${{\,\mathrm{\texttt {ROT}}\,}}$$ ROT for variable size n of the quantum register and a variable parameter k. We fill the gap, providing a systematic implementation of the cyclic rotation operator (denoted $${{\,\mathrm{\texttt {ROT}}\,}}$$ ROT ) in a quantum circuit model of computation whose depth is $${{\,\mathrm{\mathcal {O}}\,}}(\log (n))$$ O ( log ( n ) ) . We show how the circular shift operator can be utilized in quantum approaches to text processing, focusing on the problem of getting all possible cyclic rotations of a string in $${{\,\mathrm{\mathcal {O}}\,}}(\log ^2(n))$$ O ( log 2 ( n ) ) depth.


8 July 2024
Verified
Conference Paper
Open access
LBLibor Barto
Libor Barto
SBSilvia Butti
Silvia Butti
AKAlexandr Kazda
Alexandr Kazda
CVCaterina Viola
Caterina Viola
SŽStanislav Živný
Stanislav Živný
Following the success of the so-called algebraic approach to the study of decision constraint satisfaction problems (CSPs), exact optimization of valued CSPs, and most recently promise CSPs, we propose an algebraic framework for valued promise CSPs. To every valued promise CSP we associate an algebraic object, its so-called valued minion. Our main result shows that the existence of a homomorphism between the associated valued minions implies a polynomial-time reduction between the original CSPs. We also show that this general reduction theorem includes important inapproximability results, for instance, the inapproximability of almost solvable systems of linear equations beyond the random assignment threshold.

21 June 2024
Verified
Book Chapter
Closed access
PDF file
DCDomenico Cantone
Domenico Cantone
SFSimone Faro
Simone Faro
APArianna Pavone
Arianna Pavone
CVCaterina Viola
Caterina Viola

21 December 2025 in Theoretical Computer Science
Verified
Journal Article
Open access
DCDomenico Cantone
Domenico Cantone
SFSimone Faro
Simone Faro
APArianna Pavone
Arianna Pavone
CVCaterina Viola
Caterina Viola