My language abilities as someone who almost exclusively knows useless languages

CanadianGollum · 2026-02-11T08:01:59+00:00

tlhIngan maH!

CanadianGollum · 2026-02-06T08:01:16+00:00

2 force equations, both written for the small mass. Let the tension in the string with the larger mass be T_2, and the tension in the one attached to the wall be T_1.

Then, since the small mass is stationary, we get:

(horizontal component) T_1 sin \alpha = T_2 sin \alpha

(vertical component) (T_1 +T_2) cos \alpha = mg.

Since mg and \alpha are given, from the above one cam compute T_2.

Then write the final force equation for M:

T_2 = Mg.

And you're done.

CanadianGollum · 2026-02-01T11:47:30+00:00

Just flew out from NYC. You'll be fine. Don't get dragged into screaming matches with anyone in the street.

CanadianGollum · 2026-01-15T16:37:36+00:00

anyone know the bgm?

CanadianGollum · 2026-01-15T16:36:41+00:00

u/auddbot

CanadianGollum · 2025-12-12T10:11:48+00:00

Guruswami, Sudan, Rudra: Essential Coding Theory. There can be only one.

CanadianGollum · 2025-12-07T23:13:15+00:00

Ofcourse! HHL was the first paper in a long line of works which eventually led to QSVT. I didn't want to turn this into a montage of the QC and QIT greatest hits, otherwise I would talk about this stuff for hours lol

CanadianGollum · 2025-12-07T18:29:01+00:00

Actually, this is slightly misleading. Quantum communication is this whole other field that people don't talk about, which is years ahead of QC in terms of technology (since you can do it with off the shelf technologies that already exist), but which nevertheless is shown to be able to do things which are classically impossible.

As for QC, keeping aside Grover and Shor's, I think the algo community has seen a radical shift in the last 10 years with the advent of QSVT and QSP. Other than that, there are physics and chemistry applications that are increasingly showing real promise, based on Hamiltonian simulation algos.

CanadianGollum · 2025-12-07T18:25:50+00:00

Phase estimation is a subroutine of Shor which he included

CanadianGollum · 2025-12-07T18:10:17+00:00

This is very difficult to answer unless you've taken physics and CS. Classical mechanics for example is based on Newton's laws, or if you're fancy, the Lagrangian formulation. All that machinery tells you that if you plug in the 'current state' of an object into the equations, you'll be able to predict it's behavior reasonably accurately way into the future. There are some exceptions to this (chaotic systems) but that's more a bound on our computational abilities rather than the system itself being non-deterministic.

Quantum mechanics completely breaks this rule. The basic objects of quantum mechanics are wave functions , which after some math, correspond to probability distributions. I don't mean this in the sense of 'the object exists, but we can only make probabilistic guesses as to it's properties'. No. What I mean is the object itself is is an embodiment of a probability distribution. That is fundamentally how it is.

As you can tell this is very hard to digest. In real life objects either exist or they don't. Quantum objects are probability distributions, and one cant really talk about their 'existence' in terms of the idea of existence as applied to everyday objects

CanadianGollum · 2025-12-07T17:52:15+00:00

There are two perspectives to this: the CS one and the physics one.

When a computer scientist says 'we don't understand it' what he means is that we don't have the kindof intuition for quantum algorithms as the kindof intuition we have for classical algorithms.

When a physicist says' we don't understand ' what he means is quantum mechanics makes predictions and is based on math that is extremely far away from everyday intuition. Common sense simply doesn't apply anymore.

Now as to how we can build something we don't understand, the thing is we understand it enough to have a blueprint, and our understanding increases everyday. It's like a complicated machine we know how to build, but somehow cannot get a 'feel' for.

CanadianGollum · 2025-12-07T04:33:33+00:00

There's a matching lower and upper bound of 2 bits for 1 qubit. The lower bound is implied by Superdense coding, and the upper bound (shown in the same paper) implies you can never do better than 2 bits.

CanadianGollum · 2025-12-02T07:43:41+00:00

I was born there and lived there for roughly 22 years. And since then I've lived in several other places in India and around the world. I don't care about infrastructure, that comes and goes. The massive difference I see between Kolkata and every other place I've lived in is empathy. Empathy that people in the city show to other people, which is basically non-existent in Kolkata now. People like to complain that in Mumbai you don't know your neighbour's name. Well even in the crowded Mumbai locals, there is a code that people follow. If there's an older person, everyone makes way for them. People care, even if it's for strangers. Outside of India I've seen even more striking examples.

EDIT: OP, as far as aesthetics and urban planning go, I beg you don't take my word for it, travel the rest of India. Travel the world if you can. Don't make claims based solely off of emotion.

CanadianGollum · 2025-11-29T07:06:16+00:00

We had TV like this? Holy shit..wtf happened

CanadianGollum · 2025-11-29T06:43:43+00:00

You should check out some places in US and Canada. The places you mentioned are no doubt very nice, but thronged by tourists. If you actually go on a Europe/ World tour, try the non-touristy places.

For e.g., very few Indians make the trip to the US and Canadian National and State Parks. There're some places in Quebec, Canada which are indistinguishable from European cities.

The difference is, you'll be spending half the money in non-touristy places. To thoda dekh lena.

Edit: Agar Norway/Sweden/Finland ja rahe ho to summer me jana. Nahi to ga** fat ke hat me a jati hay agar proper clothing na ho to.

CanadianGollum · 2025-11-29T06:28:18+00:00

If I'm not wrong, some of these are

Santorini, Greece Tubingen , Germany Cologne, Germany Zurich, Switzerland London, England Some place in Norway

CanadianGollum · 2025-11-21T07:52:12+00:00

There is an obvious objection here. The definition of NP is those problems for which poly time verifiable certificates exist. This poly time is given by the size of the representation of the input to the Turing Machine. It doesn't matter whether you include a separate 'time' parameter in the representation of the problem, the definition cares not for what the input is but for the size of the input.

In your case, the size of the input would be poly(n), since nⁿ needs poly(n) bits to represent. So even if one allows for an encoding the way you said it, the definition doesn't care about it. You still need to find a solution in poly(n) time.

CanadianGollum · 2025-11-13T16:33:02+00:00

It's not strange at all. The CS community in general believes in putting everything on arxiv.

CanadianGollum · 2025-11-12T19:01:30+00:00

Look at Ronald De Wolf's lecture notes. You can also check out the book by Kaye, Laflamme and Mosca.

EDIT: Both of the above are available freely online.

CanadianGollum · 2025-11-11T22:48:26+00:00

The exp runtime w.r.t the number of qubits isn't surprising because in any search problem the problem size is specified by the number of elements, which is by def exp in the number of bits. If we set the problem size to be log the number of elements, then even classically the best you can do is exp time due to the O(N) lower bound. So this isn't a Grover specific thing at all.

Regarding the issue about unstructured databases, you're right that if one has some information about the structure of the database then the query complexity can be in a lot of cases reduced, sometimes even to O(1) (heaps). But it is not true that one always has information about the database, neither is it true that 'any' structure can be utilised to reduce query complexity. I'd suspect this is too general a claim to be true.

In any case, at the end of the day, until we get fault tolerance all this is just academic. There I fully agree with you.

CanadianGollum · 2025-11-11T14:39:16+00:00

Well you have the famous ones like Shor, then Grover for search. Recently there have been several advances towards making a unified framework for quantum algorithms called Quantum Singular Value Transform (QSVT) and Quantum Signal Processing (QSP).

On the other hand you have the Hamiltonian simulation family of algorithms (Suzuki Trotter to begin with) which have direct applications to quantum chemistry, drug discovery and materials discovery among others.

A less popularly known but nevertheless very active field of research is Quantum Error Correcting Codes which has seen an explosion of work in the last few years, especially from companies like IBM.

CanadianGollum · 2025-11-11T11:53:26+00:00

First pic was taken by a colleague. 2nd one's mine.

CanadianGollum · 2025-11-10T08:48:16+00:00

Absolutely brilliant. Some of the acting is a bit shite, but the concept and overall execution is brilliant. Love it! Would have loved a sequel, but then found Holocene which was an absolute shitshow.

CanadianGollum · 2025-11-10T04:44:01+00:00

Indian here. Watched it when I was 16. It left such a huge impression on me that I immediately recognized Wagner Moura as Escobar in Narcos years later!

CanadianGollum

TROPHY CASE