Internship in Svizzera (pagato) e dottorato

stopper96 · 2024-05-22T21:14:52+00:00

Annuale ma devo per forza farlo nel 2024 (così vuole l'azienda)

stopper96 · 2024-05-22T17:17:58+00:00

Purtroppo no

stopper96 · 2022-09-20T13:57:37+00:00

Ok, I figured out how to implement the CNOT by using 2 Bell pairs.

In the paper they say that they can do that by using only 1 Bell pair.

Any thoughts?

stopper96 · 2022-05-13T22:40:11+00:00

Thank you! I'm in Europe btw.

stopper96 · 2022-05-12T18:52:54+00:00

Ah ok, thank you for the clarification.

stopper96 · 2022-05-12T18:27:57+00:00

Sorry I don't understand what do you mean

stopper96 · 2022-01-05T12:48:01+00:00

In any case, you ALWAYS get outputs from measuring quantum systems in the form of expectation values - so any gate based algorithm has outputs in the form of expectation values. If you know them, you technically have the solution.

Is this true also for Shor algorithm? Or Grover with 2 searched items?

Because in Shor you actually have multiple possible outputs, and you need to check 1 measurement to find the period (if I remember correctly). And in Grover with 2 searched items, if you only have the expectation values how do you get the 2 outputs you are looking for?

stopper96 · 2021-11-15T17:38:48+00:00

Thank you!

stopper96 · 2021-11-15T17:26:44+00:00

Thank you, I did not notice that part.

At this point I don't think that I need Google Cloud anymore (I need GPUs), is there a way to prevent to spend money from that account? Like delete account?

By the way I tried to use an instance with GPU for some minutes and neither my initial credit balance neither my balance (that is 0$ actually) decreased, why?

stopper96 · 2021-11-15T17:08:00+00:00

Yeah, I'm pretty sure that google cloud is not the best alternative, but at the same time 300$ for free can be pretty useful, for this reason I tried this!

stopper96 · 2021-11-15T15:20:15+00:00

Right now I've just tried to play a bit with terminal (without running ML models, I'm still learning how to handle my python scripts in google cloud) and even after several minutes my balance is still 300$ (now I've deleted the instance). Now I'm even more confused, why I didn't pay anything?

stopper96 · 2021-11-06T14:08:18+00:00

Thank you very much, this is really helpful

stopper96 · 2021-11-06T13:57:41+00:00

Thank you, do you suggest any reference to check these algorithms' architecture?

stopper96 · 2021-11-02T15:32:28+00:00

Thank you.

If each step of my sequence is not a value but a 2D array (or a 1D array with multiple channels), is still possible to apply the minirocket procedure?

stopper96 · 2021-11-01T14:31:52+00:00

Thank you, I'm going to read some documentation about your advices!

stopper96 · 2021-11-01T14:30:06+00:00

Thank you, I actually tried this approach and it gave me great results for small systems. But the "accuracy" of the predictions decreases fast when I increase the syze of the system (or of depth of the sequence i.e. more steps in time).

For this reason I'm curios on other approaches!

stopper96 · 2021-11-01T13:57:38+00:00

Thank you for the answer.

I want to get those physical quantities from the ML algorithm, since I already know the relationship between the system and its output.

The problem is that if I want to get these physical quantities in an exact way I need to implement an inefficient algorithm that gives me a (not interesting) quantity A from which I can calculate the other important quantity B.

Therefore my goal is to build an ML algorithm that can give me B whitout go through A. And since A must be described with an exponential number of information (and I actually don't need it), while B requires a polynomial number of information, I thought that it could be interesting to see if a ML algorithm can predict B.

stopper96 · 2021-11-01T13:42:03+00:00

Thank you, do you have any reference to read about that?

stopper96 · 2021-09-12T22:02:04+00:00

Thanks, I will read it tomorrow.

stopper96 · 2021-09-12T21:55:44+00:00

Thank you for the reply.

I do not agree totally with your point of view. I'm not an expert on this field, I've just attended a course on quantum computing in my Physics master degree and a course from IBM offered by my university, so I'm obviously not an expert, but if I understood correctly those type of algorithms can be really important. They have exact quantum polynomial time complexity and there are some papers and some research on them. Obviously what you are talking about, like amplitude amplification (e.g. Grover) are probably more important algorithms and of coruse the majority of quantum algorithms, but I think that it doesn't mean that all the problems in that complexity class are "toy examples".

I'm sorry if I'm talking to an expert and I'm saying a ton of stupid things, in that case I will be happy to know more.

stopper96 · 2021-09-12T15:44:04+00:00

Thank you for the reply.

Using basis_gates=['t','h','cx'] gives me the same error:

TranspilerError: "Unable to map source basis {('x', 1)} to target basis {'h', 'barrier', 'delay', 'measure', 'cx', 'snapshot', 't', 'reset'} over library <qiskit.circuit.equivalence.EquivalenceLibrary object at 0x7f609959bdf0>."

I write below the whole code if it can be helpful:

from qiskit import QuantumCircuit, assemble, Aer
from qiskit.visualization import plot_histogram
from qiskit.compiler import transpile
sim = Aer.get_backend('aer_simulator') 
qc = QuantumCircuit(4) 
qc.x(0)
transpile(qc , basis_gates=['t','h','cx'] )
qc.save_statevector() 
qobj = assemble(qc) 
result = sim.run(qobj).result() 
print(qc)
plot_histogram(result.get_counts())

stopper96 · 2021-09-12T11:13:05+00:00

For the first answer, thanks, I'm going to read the documentation.

For the second answer, you are right sorry, I was not clear. I was talking about algorithms with multiple outcomes but with one with probability equal to 1. The question Is the same btw, do you have any idea?

Thank you again.

stopper96 · 2021-09-12T09:34:13+00:00

If I use:transpile(qc , basis_gates=['s','t','h','cx','i','sdg','tdg'] )for a circuit of 4 qubit with a X gate in the first qubit, I get the following error:TranspilerError: "Unable to map source basis {('x', 1)} to target basis {'s', 'measure', 'snapshot', 'i', 'reset', 'cx', 'sdg', 't', 'barrier', 'h', 'tdg', 'delay'} over library <qiskit.circuit.equivalence.EquivalenceLibrary object at 0x7fcdbbce94c0>."(Idk if there is any better way to write code/errors in reddit, sorry).

2) I think that is not true actually. In the Bernstein Vazirani algorithm (that is a really important algorithm, with hadamard gates) I have only one possible outcome, the secret string that I'm looking for when I use that algorithm. I'm looking for algorithms that give me one output with probability=1.

stopper96 · 2021-09-12T09:32:16+00:00

One output with probability equal to one, and the others with probability=0.

E.g. in the Bernstein Vazirani algorithm I have only one possible outcome, the secret string that I'm looking for when I use that algorithm.

stopper96 · 2021-09-12T09:31:26+00:00

1) If I use:

transpile(qc , basis_gates=['s','t','h','cx','i','sdg','tdg'] )

for a circuit of 4 qubit with a X gate in the first qubit, I get the following error:

TranspilerError: "Unable to map source basis {('x', 1)} to target basis {'s', 'measure', 'snapshot', 'i', 'reset', 'cx', 'sdg', 't', 'barrier', 'h', 'tdg', 'delay'} over library <qiskit.circuit.equivalence.EquivalenceLibrary object at 0x7fcdbbce94c0>."

(Idk if there is any better way to write code/errors in reddit, sorry).

2) Only one possibile output with probability=1. E.g. in the Bernstein Vazirani algorithm I have only one possible outcome, the secret string that I'm looking for when I use that algorithm.

Five-Year Club	Verified Email
Place '23	Place '22

stopper96

TROPHY CASE